NAG Library Function Document
nag_numdiff_1d_real (d04aac)
1 Purpose
nag_numdiff_1d_real (d04aac) calculates a set of derivatives (up to order $14$) of a function of one real variable at a point, together with a corresponding set of error estimates, using an extension of the Neville algorithm.
2 Specification
#include <nag.h> 
#include <nagd04.h> 

3 Description
nag_numdiff_1d_real (d04aac) provides a set of approximations:
to the derivatives:
of a real valued function
$f\left(x\right)$ at a real abscissa
${x}_{0}$, together with a set of error estimates:
which hopefully satisfy:
You must provide the value of
${x}_{0}$, a value of
$n$ (which is reduced to
$14$ should it exceed
$14$), a function which evaluates
$f\left(x\right)$ for all real
$x$, and a step length
$h$. The results
${\mathbf{der}}\left[j1\right]$ and
${\mathbf{erest}}\left[j1\right]$ are based on
$21$ function values:
Internally nag_numdiff_1d_real (d04aac) calculates the odd order derivatives and the even order derivatives separately. There is an option you can use for restricting the calculation to only odd (or even) order derivatives. For each derivative the function employs an extension of the Neville Algorithm (see
Lyness and Moler (1969)) to obtain a selection of approximations.
For example, for odd derivatives, based on
$20$ function values, nag_numdiff_1d_real (d04aac) calculates a set of numbers:
each of which is an approximation to
${f}^{\left(2s+1\right)}\left({x}_{0}\right)/\left(2s+1\right)!$. A specific approximation
${T}_{\mathit{k},p,s}$ is of polynomial degree
$2p+2$ and is based on polynomial interpolation using function values
$f\left({x}_{0}\pm \left(2i1\right)h\right)$, for
$\mathit{k}=\mathit{k},\dots ,\mathit{k}+p$. In the absence of roundoff error, the better approximations would be associated with the larger values of
$p$ and of
$k$. However, roundoff error in function values has an increasingly contaminating effect for successively larger values of
$p$. This function proceeds to make a judicious choice between all the approximations in the following way.
For a specified value of
$s$, let:
where
${U}_{p}={\displaystyle \underset{\mathit{k}}{\mathrm{max}}}\phantom{\rule{0.25em}{0ex}}\left({T}_{\mathit{k},p,s}\right)$ and
${L}_{p}={\displaystyle \underset{\mathit{k}}{\mathrm{min}}}\phantom{\rule{0.25em}{0ex}}\left({T}_{\mathit{k},p,s}\right)$, for
$\mathit{k}=0,1,\dots ,9p$, and let
$\stackrel{}{\mathit{p}}$ be such that
${R}_{\stackrel{}{\mathit{p}}}={\displaystyle \underset{\mathit{p}}{\mathrm{min}}}\phantom{\rule{0.25em}{0ex}}\left({R}_{\mathit{p}}\right)$, for
$\mathit{p}=s,\dots ,6$.
The function returns:
and
where
${K}_{j}$ is a safety factor which has been assigned the values:
${K}_{j}=1$, 
$j\le 9$ 
${K}_{j}=1.5$, 
$j=10,11$ 
${K}_{j}=2$ 
$j\ge 12$, 
on the basis of performance statistics.
The even order derivatives are calculated in a precisely analogous manner.
4 References
Lyness J N and Moler C B (1966) van der Monde systems and numerical differentiation Numer. Math. 8 458–464
Lyness J N and Moler C B (1969) Generalised Romberg methods for integrals of derivatives Numer. Math. 14 1–14
5 Arguments
 1:
xval – doubleInput
On entry: the point at which the derivatives are required, ${x}_{0}$.
 2:
nder – IntegerInput
On entry: must be set so that its absolute value is the highest order derivative required.
 ${\mathbf{nder}}>0$
 All derivatives up to order $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{nder}},14\right)$ are calculated.
 ${\mathbf{nder}}<0$ and nder is even
 Only even order derivatives up to order $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{nder}},14\right)$ are calculated.
 ${\mathbf{nder}}<0$ and nder is odd
 Only odd order derivatives up to order $\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{nder}},13\right)$ are calculated.
 3:
hbase – doubleInput
On entry: the initial step length which may be positive or negative. For advice on the choice of
hbase see
Section 9.
Constraint:
${\mathbf{hbase}}\ne 0.0$.
 4:
der[$14$] – doubleOutput
On exit:
${\mathbf{der}}\left[j1\right]$ contains an approximation to the
$j$th derivative of
$f\left(x\right)$ at
$x={\mathbf{xval}}$, so long as the
$j$th derivative is one of those requested by you when specifying
nder. For other values of
$j$,
${\mathbf{der}}\left[j1\right]$ is unused.
 5:
erest[$14$] – doubleOutput
On exit: an estimate of the absolute error in the corresponding result
${\mathbf{der}}\left[j1\right]$ so long as the
$j$th derivative is one of those requested by you when specifying
nder. The sign of
${\mathbf{erest}}\left[j1\right]$ is positive unless the result
${\mathbf{der}}\left[j1\right]$ is questionable. It is set negative when
$\left{\mathbf{der}}\left[j1\right]\right<\left{\mathbf{erest}}\left[j1\right]\right$ or when for some other reason there is doubt about the validity of the result
${\mathbf{der}}\left[j1\right]$ (see
Section 6). For other values of
$j$,
${\mathbf{erest}}\left[j1\right]$ is unused.
 6:
fun – function, supplied by the userExternal Function
fun must evaluate the function
$f\left(x\right)$ at a specified point.
The specification of
fun is:
double 
fun (double x,
Nag_Comm *comm)


 1:
x – doubleInput
On entry: the value of the argument
$x$.
If you have equally spaced tabular data, the following information may be useful:
(i) 
in any call of nag_numdiff_1d_real (d04aac) the only values of $x$ for which $f\left(x\right)$ will be required are $x={\mathbf{xval}}$ and
$x={\mathbf{xval}}\pm \left(2\mathit{j}1\right){\mathbf{hbase}}$, for $\mathit{j}=1,2,\dots ,10$; and 
(ii) 
$f\left({x}_{0}\right)$ is always computed, but it is disregarded when only odd order derivatives are required. 
 2:
comm – Nag_Comm *
Pointer to structure of type Nag_Comm; the following members are relevant to
fun.
 user – double *
 iuser – Integer *
 p – Pointer
The type Pointer will be
void *. Before calling nag_numdiff_1d_real (d04aac) you may allocate memory and initialize these pointers with various quantities for use by
fun when called from nag_numdiff_1d_real (d04aac) (see
Section 3.2.1.1 in the Essential Introduction).
 7:
comm – Nag_Comm *Communication Structure

The NAG communication argument (see
Section 3.2.1.1 in the Essential Introduction).
 8:
fail – NagError *Input/Output

The NAG error argument (see
Section 3.6 in the Essential Introduction).
6 Error Indicators and Warnings
 NE_BAD_PARAM

On entry, argument $\u27e8\mathit{\text{value}}\u27e9$ had an illegal value.
 NE_INT

On entry, ${\mathbf{nder}}=0$.
Constraint: ${\mathbf{nder}}\ne 0$.
 NE_INTERNAL_ERROR

An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact
NAG for assistance.
 NE_REAL

On entry, ${\mathbf{hbase}}=0.0$.
Constraint: ${\mathbf{hbase}}\ne 0.0$.
7 Accuracy
The accuracy of the results is problem dependent. An estimate of the accuracy of each result
${\mathbf{der}}\left[j1\right]$ is returned in
${\mathbf{erest}}\left[j1\right]$ (see
Sections 3,
5 and
9).
A basic feature of any floatingpoint function for numerical differentiation based on real function values on the real axis is that successively higher order derivative approximations are successively less accurate. It is expected that in most cases ${\mathbf{der}}\left[13\right]$ will be unusable. As an aid to this process, the sign of ${\mathbf{erest}}\left[j1\right]$ is set negative when the estimated absolute error is greater than the approximate derivative itself, i.e., when the approximate derivative may be so inaccurate that it may even have the wrong sign. It is also set negative in some other cases when information available to the function indicates that the corresponding value of ${\mathbf{der}}\left[j1\right]$ is questionable.
The actual values in
erest depend on the accuracy of the function values, the properties of the machine arithmetic, the analytic properties of the function being differentiated and the usersupplied step length
hbase (see
Section 9). The only hard and fast rule is that for a given
${\mathbf{fun}}\left({\mathbf{xval}}\right)$ and
hbase, the values of
${\mathbf{erest}}\left[j1\right]$ increase with increasing
$j$. The limit of
$14$ is dictated by experience. Only very rarely can one obtain meaningful approximations for higher order derivatives on conventional machines.
8 Parallelism and Performance
Not applicable.
The time taken by nag_numdiff_1d_real (d04aac) depends on the time spent for function evaluations. Otherwise the time is roughly equivalent to that required to evaluate the function $21$ times and calculate a finite difference table having about $200$ entries in total.
The results depend very critically on the choice of the usersupplied step length
hbase. The overall accuracy is diminished as
hbase becomes small (because of the effect of roundoff error) and as
hbase becomes large (because the discretization error also becomes large). If the function is used four or five times with different values of
hbase one can find a reasonably good value. A process in which the value of
hbase is successively halved (or doubled) is usually quite effective. Experience has shown that in cases in which the Taylor series for
${\mathbf{fun}}\left({\mathbf{x}}\right)$ about
xval has a finite radius of convergence
$R$, the choices of
${\mathbf{hbase}}>R/19$ are not likely to lead to good results. In this case some function values lie outside the circle of convergence.
10 Example
This example evaluates the oddorder derivatives of the function:
up to order
$7$ at the point
$x=\frac{1}{2}$. Several different values of
hbase are used, to illustrate that:
(i) 
extreme choices of hbase, either too large or too small, yield poor results; 
(ii) 
the quality of these results is adequately indicated by the values of erest. 
10.1 Program Text
Program Text (d04aace.c)
10.2 Program Data
None.
10.3 Program Results
Program Results (d04aace.r)