Skip to main content

Part of the book series: Macmillan Computer Science Series ((COMPSS))

  • 47 Accesses

Abstract

The derivative of a function f(x) is defined in theory by

$${\rm{f'(}}x{\rm{)}}\mathop {\lim }\limits_{h \to 0} {{{\rm{f}}(x + h) - {\rm{f}}(x)} \over h}$$

Therefore we can obtain a numerical approximation using

$${{{\rm{f}}(x + h) - {\rm{f}}(x)} \over h}$$

for small values of h The accuracy will clearly depend on the size of h. We can improve the approximation by letting h become small, but it is obvious we cannot let it become zero since we are dealing with numerical values. If h became zero we would be dividing by zero. However, before this becomes a problem the difference between f(x) and f(x+h) would become indistinguishable on the computer and this would lead to gross inaccuracies. Therefore, by reducing h in the classical theoretical manner, we can only achieve an accuracy within the limits of that allowed by the computer we are using.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Copyright information

© 1987 E. J. Redfern

About this chapter

Cite this chapter

Redfern, E.J. (1987). Numerical Calculus. In: Introduction to Pascal for Computational Mathematics. Macmillan Computer Science Series. Palgrave, London. https://doi.org/10.1007/978-1-349-18977-9_9

Download citation

Publish with us

Policies and ethics