Numerical differentiation

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In numerical analysis, numerical differentiation describes algorithms for estimating the derivative of a mathematical function or function subroutine using values of the function and perhaps other knowledge about the function.

Derivative.png

Finite difference formula[edit]

The simplest method is to use finite difference approximations.

A simple two-point estimation is to compute the slope of a nearby secant line through the points (x,f(x)) and (x+h,f(x+h)).[1] Choosing a small number h, h represents a small change in x, and it can be either positive or negative. The slope of this line is

{f(x+h)-f(x)\over h}.

This expression is Newton's difference quotient.

The slope of this secant line differs from the slope of the tangent line by an amount that is approximately proportional to h. As h approaches zero, the slope of the secant line approaches the slope of the tangent line. Therefore, the true derivative of f at x is the limit of the value of the difference quotient as the secant lines get closer and closer to being a tangent line:

f'(x)=\lim_{h\to 0}{f(x+h)-f(x)\over h}.

Since immediately substituting 0 for h results in division by zero, calculating the derivative directly can be unintuitive.

Equivalently, the slope could be estimated by employing positions (x - h) and x.

Another two-point formula is to compute the slope of a nearby secant line through the points (x-h,f(x-h)) and (x+h,f(x+h)). The slope of this line is

{f(x+h)-f(x-h)\over 2h}.

In this case the first-order errors cancel, so the slope of these secant lines differ from the slope of the tangent line by an amount that is approximately proportional to h^2. Hence for small values of h this is a more accurate approximation to the tangent line than the one-sided estimation. Note however that although the slope is being computed at x, the value of the function at x is not involved.

The estimation error is given by:

R = {{-f^{(3)}(c)}\over {6}}h^2,

where c is some point between x-h and x+h. This error does not include the rounding error due to numbers being represented and calculations being performed in limited precision.

Practical considerations using floating point arithmetic[edit]

Example showing the difficulty of choosing h due to both rounding error and formula error

An important consideration in practice when the function is approximated using floating point arithmetic is how small a value of h to choose. If chosen too small, the subtraction will yield a large rounding error. In fact all the finite difference formulae are ill-conditioned[2] and due to cancellation will produce a value of zero if h is small enough.[3] If too large, the calculation of the slope of the secant line will be more accurately calculated, but the estimate of the slope of the tangent by using the secant could be worse.

A choice for h which is small without producing a large rounding error is \sqrt{\varepsilon}x where the machine epsilon ε is typically of the order 2.2×10−16. [4] This epsilon is for double precision (64-bit) variables: such calculations in single precision are rarely useful. The resulting value is unlikely to be a "round" number in binary, so it is important to realise that although x is a machine-representable number, x + h almost certainly will not be. This means that x + h will be changed (via rounding or truncation) to a nearby machine-representable number, with the consequence that (x + h) - x will not equal h; the two function evaluations will not be exactly h apart. In this regard, since most decimal fractions are recurring sequences in binary (just as 1/3 is in decimal) a seemingly round step such as h = 0.1 will not be a round number in binary; it is 0.000110011001100... A possible approach is as follows:

 h:=sqrt(eps)*x;
 xph:=x + h;
 dx:=xph - x;
 slope:=(F(xph) - F(x))/dx;

However, with computers, compiler optimization facilities may fail to attend to the details of actual computer arithmetic, and instead apply the axioms of mathematics to deduce that dx and h are the same. With C and similar languages, a directive that xph is a volatile variable will prevent this.

Higher-order methods[edit]

Further information: Finite difference coefficients

Higher-order methods for approximating the derivative, as well as methods for higher derivatives exist.

Given below is the five point method for the first derivative (five-point stencil in one dimension).[5]

f'(x) = \frac{-f(x+2 h)+8 f(x+h)-8 f(x-h)+f(x-2h)}{12 h}+\frac{h^4}{30}f^{(5)}(c)

where c\in[x-2h,x+2h].

Differential quadrature[edit]

Differential quadrature is the approximation of derivatives by using weighted sums of function values.[6][7] The name is in analogy with quadrature meaning Numerical integration where weighted sums are used in methods such Simpson's method or the Trapezium rule. There are various methods for determining the weight coefficients. Differential quadrature is used to solve partial differential equations.

Complex variable methods[edit]

The classical finite difference approximations for numerical differentiation are ill-conditioned. However, if f is a holomorphic function, real-valued on the real line, which can be evaluated at points in the complex plane near x then there are stable methods. For example,[3] the first derivative can be calculated by the complex-step derivative formula:[8]

f'(x)\approx \Im(f(x + ih))/h.

The above formula is only valid for calculating a first-order derivative. A generalization of the above for calculating derivatives of any order derivatives employ multicomplex numbers, resulting in multicomplex derivatives.[9]

In general, derivatives of any order can be calculated using Cauchy's integral formula:

f^{(n)}(a) = {n! \over 2\pi i} \oint_\gamma {f(z) \over (z-a)^{n+1}}\, \mathrm{d}z,

where the integration is done numerically.

Using complex variables for numerical differentiation was started by Lyness and Moler in 1967.[10] A method based on numerical inversion of a complex Laplace transform was developed by Abate and Dubner.[11] An algorithm which can be used without requiring knowledge about the method or the character of the function was developed by Fornberg.[2]

See also[edit]

References[edit]

  1. ^ Richard L. Burden, J. Douglas Faires (2000), Numerical Analysis, (7th Ed), Brooks/Cole. ISBN 0-534-38216-9
  2. ^ a b Numerical Differentiation of Analytic Functions, B Fornberg - ACM Transactions on Mathematical Software (TOMS), 1981
  3. ^ a b Using Complex Variables to Estimate Derivatives of Real Functions, W Squire, G Trapp - SIAM REVIEW, 1998
  4. ^ Following Numerical Recipes in C, Chapter 5.7
  5. ^ Abramowitz & Stegun, Table 25.2
  6. ^ Differential Quadrature and Its Application in Engineering: Engineering Applications, Chang Shu, Springer, 2000, ISBN 978-1-85233-209-9
  7. ^ Advanced Differential Quadrature Methods, Yingyan Zhang, CRC Press, 2009, ISBN 978-1-4200-8248-7
  8. ^ Martins, JRRA; Sturdza, P; Alonso, JJ (2003). "The Complex-Step Derivative Approximation". ACM Transactions on Mathematical Software 29 (3): 245–262. doi:10.1145/838250.838251. CiteSeerX: 10.1.1.141.8002. 
  9. ^ http://russell.ae.utexas.edu/FinalPublications/ConferencePapers/2010Feb_SanDiego_AAS-10-218_mulicomplex.pdf
  10. ^ Lyness, J. N.; Moler, C. B. (1967). "Numerical differentiation of analytic functions". SIAM J.Numer. Anal. 4: 202–210. doi:10.1137/0704019. 
  11. ^ Abate, J; Dubner, H (March 1968). "A New Method for Generating Power Series Expansions of Functions". SIAM J. Numer. Anal. 5 (1): 102–112. doi:10.1137/0705008. 

External links[edit]