NAG Library Routine Document

Integer, Intent (In)	::	m, ip(m), n, itmin, itmax, lwrk, liwrk
Integer, Intent (Inout)	::	ifail
Integer, Intent (Out)	::	iwrk(liwrk)
Real (Kind=nag_wp), Intent (In)	::	xmin, xmax, x(m), y(n)
Real (Kind=nag_wp), Intent (Out)	::	a(n), wrk(lwrk)

C Header Interface

#include <nagmk26.h>

void	e01aef_ (const Integer m, const double xmin, const double xmax, const double x[], const double y[], const Integer ip[], const Integer n, const Integer itmin, const Integer itmax, double a[], double wrk[], const Integer lwrk, Integer iwrk[], const Integer liwrk, Integer *ifail)

3

Description

Let

m

distinct values

x_{i}

of an independent variable

x

be given, with

x_{\min} \leq x_{i} \leq x_{\max}

, for

i = 1, 2, \dots, m

. For each value

x_{i}

, suppose that the value

y_{i}

of the dependent variable

y

together with the first

p_{i}

derivatives of

y

with respect to

x

are given. Each

p_{i}

must therefore be a non-negative integer, with the total number of interpolating conditions,

n

, equal to

m + \sum_{i = 1}^{m} p_{i}

e01aef calculates the unique polynomial

q (x)

of degree

n - 1

(or less) which is such that

q^{(k)} (x_{i}) = y_{i}^{(k)}

, for

i = 1, 2, \dots, m

and

k = 0, 1, \dots, p_{i}

. Here

q^{(0)} (x_{i})

means

q (x_{i})

. This polynomial is represented in Chebyshev series form in the normalized variable

\bar{x}

, as follows:

q (x) = \frac{1}{2} a_{0} T_{0} (\bar{x}) + a_{1} T_{1} (\bar{x}) + \dots + a_{n - 1} T_{n - 1} (\bar{x}),

where

\bar{x} = \frac{2 x - x_{\min} - x_{\max}}{x_{\max} - x_{\min}}

so that

- 1 \leq \bar{x} \leq 1

for

x

in the interval

x_{\min}

x_{\max}

, and where

T_{i} (\bar{x})

is the Chebyshev polynomial of the first kind of degree

i

with argument

\bar{x}

(The polynomial interpolant can subsequently be evaluated for any value of

x

in the given range by using e02akf. Chebyshev series representations of the derivative(s) and integral(s) of

q (x)

may be obtained by (repeated) use of e02ahf and e02ajf.)

The method used consists first of constructing a divided-difference table from the normalized

\bar{x}

values and the given values of

y

and its derivatives with respect to

\bar{x}

. The Newton form of

q (x)

is then obtained from this table, as described in Huddleston (1974) and Krogh (1970), with the modification described in Section 9.2. The Newton form of the polynomial is then converted to Chebyshev series form as described in Section 9.3.

Since the errors incurred by these stages can be considerable, a form of iterative refinement is used to improve the solution. This refinement is particularly useful when derivatives of rather high order are given in the data. In reasonable examples, the refinement will usually terminate with a certain accuracy criterion satisfied by the polynomial (see Section 7). In more difficult examples, the criterion may not be satisfied and refinement will continue until the maximum number of iterations (as specified by the input argument itmax) is reached.

In extreme examples, the iterative process may diverge (even though the accuracy criterion is satisfied): if a certain divergence criterion is satisfied, the process terminates at once. In all cases the routine returns the ‘best’ polynomial achieved before termination. For the definition of ‘best’ and details of iterative refinement and termination criteria, see Section 9.4.

4

References

Huddleston R E (1974) CDC 6600 routines for the interpolation of data and of data with derivatives SLL-74-0214 Sandia Laboratories (Reprint)

Krogh F T (1970) Efficient algorithms for polynomial interpolation and numerical differentiation Math. Comput. 24 185–190

5

Arguments

1: $m$ – IntegerInput: On entry: $m$ , the number of given values of the independent variable $x$ .

Constraint: $m \geq 1$ .
2: $xmin$ – Real (Kind=nag_wp)Input
3: $xmax$ – Real (Kind=nag_wp)Input: On entry: the lower and upper end points, respectively, of the interval $[x_{\min}, x_{\max}]$ . If they are not determined by your problem, it is recommended that they be set respectively to the smallest and largest values among the $x_{i}$ .

Constraint: $xmin < xmax$ .
4: $x (m)$ – Real (Kind=nag_wp) arrayInput: On entry: the value of $x_{i}$ , for $i = 1, 2, \dots, m$ . The $x (i)$ need not be ordered.

Constraint: $xmin \leq x (i) \leq xmax$ , and the $x (i)$ must be distinct.
5: $y (n)$ – Real (Kind=nag_wp) arrayInput: On entry: the given values of the dependent variable, and derivatives, as follows:
The first $p_{1} + 1$ elements contain $y_{1}, y_{1}^{(1)}, \dots, y_{1}^{(p_{1})}$ in that order.

The next $p_{2} + 1$ elements contain $y_{2}, y_{2}^{(1)}, \dots, y_{2}^{(p_{2})}$ in that order.

$⋮$

The last $p_{m} + 1$ elements contain $y_{m}, y_{m}^{(1)}, \dots, y_{m}^{(p_{m})}$ in that order.
6: $ip (m)$ – Integer arrayInput: On entry: $p_{i}$ , the order of the highest-order derivative whose value is given at $x_{i}$ , for $i = 1, 2, \dots, m$ . If the value of $y$ only is given for some $x_{i}$ then the corresponding value of $ip (i)$ must be zero.

Constraint: $ip (i) \geq 0$ , for $i = 1, 2, \dots, m$ .
7: $n$ – IntegerInput: On entry: $n$ , the total number of interpolating conditions.

Constraint: $n = m + \sum_{i = 1}^{m} ip (i)$ .
8: $itmin$ – IntegerInput
9: $itmax$ – IntegerInput: On entry: respectively the minimum and maximum number of iterations to be performed by the routine (for full details see Section 9.4). Setting itmin and/or itmax negative or zero invokes default value(s) of $2$ and/or $10$ , respectively.
The default values will be satisfactory for most problems, but occasionally significant improvement will result from using higher values.

Suggested value: $itmin = 0$ and $itmax = 0$ .
10: $a (n)$ – Real (Kind=nag_wp) arrayOutput: On exit: $a (i + 1)$ contains the coefficient $a_{i}$ in the Chebyshev series representation of $q (x)$ , for $i = 0, 1, \dots, n - 1$ .
11: $wrk (lwrk)$ – Real (Kind=nag_wp) arrayOutput: On exit: used as workspace, but see also Section 9.5.
12: $lwrk$ – IntegerInput: On entry: the dimension of the array wrk as declared in the (sub)program from which e01aef is called.

Constraint: $lwrk \geq 7 \times n + 5 \times \max (ipmax, 0) + m + 7$ , where $ipmax$ is the largest element of $ip (i)$ , for $i = 1, 2, \dots, m$ .
13: $iwrk (liwrk)$ – Integer arrayOutput: On exit: used as workspace, but see also Section 9.5.
14: $liwrk$ – IntegerInput: On entry: the dimension of the array iwrk as declared in the (sub)program from which e01aef is called.

Constraint: $liwrk \geq 2 \times m + 2$ .
15: $ifail$ – IntegerInput/Output: On entry: ifail must be set to $0$ , $- 1 or 1$ . If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value $- 1 or 1$ is recommended. If the output of error messages is undesirable, then the value $1$ is recommended. Otherwise, if you are not familiar with this argument, the recommended value is $0$ . When the value $- 1 or 1$ is used it is essential to test the value of ifail on exit.

On exit: $ifail = 0$ unless the routine detects an error or a warning has been flagged (see Section 6).

6

Error Indicators and Warnings

If on entry

ifail = 0

- 1

, explanatory error messages are output on the current error message unit (as defined by x04aaf).

Errors or warnings detected by the routine:

$ifail = 1$: On entry, liwrk is too small. $liwrk = 〈value〉$ . Minimum possible dimension: $〈value〉$ .

On entry, lwrk is too small. $lwrk = 〈value〉$ . Minimum possible dimension: $〈value〉$ .

On entry, $m = 〈value〉$ .
Constraint: $m \geq 1$ .

On entry, $n = 〈value〉$ and $m + ip (1) + ip (2) + \dots + ip (m) = 〈value〉$ .
Constraint: $n = m + ip (1) + ip (2) + \dots + ip (m)$ .

$ifail = 2$: On entry, $I = 〈value〉$ and $ip (I) = 〈value〉$ .
Constraint: $ip (I) \geq 0$ .

$ifail = 3$: On entry, $I = 〈value〉$ , $J = 〈value〉$ and $x (I) = 〈value〉$ .
Constraint: $x (I) \neq x (J)$ .

On entry, $I = 〈value〉$ , $x (I) = 〈value〉$ , $xmin = 〈value〉$ and $xmax = 〈value〉$ .
Constraint: $xmin \leq x (I) \leq xmax$ .

On entry, $xmin = 〈value〉$ and $xmax = 〈value〉$ .
Constraint: $xmin < xmax$ .

$ifail = 4$: Not all the performance indices are less than eight times the machine precision, although itmax iterations have been performed. Arguments a, wrk and iwrk relate to the best polynomial determined. A more accurate solution may possibly be obtained by increasing itmax and recalling the routine. See also Sections 7, 9.4 and 9.5.

$ifail = 5$: The computation has been terminated because the iterative process appears to be diverging. (Arguments a, wrk and iwrk relate to the best polynomial determined.) Thus the problem specified by your data is probably too ill-conditioned for the solution to be satisfactory. This may result from some of the $x (i)$ being very close together, or from the number of interpolating conditions,n, being large. If in such cases the conditions do not involve derivatives, you are likely to obtain a much more satisfactory solution to your problem either by cubic spline interpolation (see e01baf) or by curve-fitting with a polynomial or spline in which the number of coefficients is less than n, preferably much less if n is large (see Chapter E02). But see Sections 7, 9.4 and 9.5.

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.

7

Accuracy

A complete error analysis is not currently available, but the method gives good results for reasonable problems.

It is important to realise that for some sets of data, the polynomial interpolation problem is ill-conditioned. That is, a small perturbation in the data may induce large changes in the polynomial, even in exact arithmetic. Though by no means the worst example, interpolation by a single polynomial to a large number of function values given at points equally spaced across the range is notoriously ill-conditioned and the polynomial interpolating such a dataset is prone to exhibit enormous oscillations between the data points, especially near the ends of the range. These will be reflected in the Chebyshev coefficients being large compared with the given function values. A more familiar example of ill-conditioning occurs in the solution of certain systems of linear algebraic equations, in which a small change in the elements of the matrix and/or in the components of the right-hand side vector induces a relatively large change in the solution vector. The best that can be achieved in these cases is to make the residual vector small in some sense. If this is possible, the computed solution is exact for a slightly perturbed set of data. Similar considerations apply to the interpolation problem.

The residuals

y_{i}^{(k)} - q^{(k)} (x_{i})

are available for inspection (see Section 9.5). To assess whether these are reasonable, however, it is necessary to relate them to the largest function and derivative values taken by

q (x)

over the interval

[x_{\min}, x_{\max}]

. The following performance indices aim to do this. Let the

k

th derivative of

q

with respect to the normalized variable

\bar{x}

be given by the Chebyshev series

\frac{1}{2} a_{0}^{k} T_{0} (\bar{x}) + a_{1}^{k} T_{1} (\bar{x}) + \dots + a_{n - 1 - k}^{k} T_{n - 1 - k} (\bar{x}) .

Let

A_{k}

denote the sum of the moduli of these coefficients (this is an upper bound on the

k

th derivative in the interval and is taken as a measure of the maximum size of this derivative), and define

S_{k} = \max_{i \leq k} A_{i} .

Then if the root-mean-square value of the residuals of

q^{(k)}

, scaled so as to relate to the normalized variable

\bar{x}

, is denoted by

r_{k}

, the performance indices are defined by

P_{k} = r_{k} / S_{k},   for ​ k = 0, 1, \dots, \max_{i} (p_{i}) .

It is expected that, in reasonable cases, they will all be less than (say)

8

times the machine precision (this is the accuracy criterion mentioned in Section 3), and in many cases will be of the order of machine precision or less.

8

Parallelism and Performance

e01aef is not threaded in any implementation.

9

Further Comments

9.1

Timing

Computation time is approximately proportional to

it \times n^{3}

, where

it

is the number of iterations actually used. (See Section 9.5.)

9.2

Divided-difference Strategy

In constructing each new coefficient in the Newton form of the polynomial, a new

x_{i}

must be brought into the computation. The

x_{i}

chosen is that which yields the smallest new coefficient. This strategy increases the stability of the divided-difference technique, sometimes quite markedly, by reducing errors due to cancellation.

9.3

Conversion to Chebyshev Form

Conversion from the Newton form to Chebyshev series form is effected by evaluating the former at the

n

values of

\bar{x}

at which

T_{n - 1} (x)

takes the value

\pm 1

, and then interpolating these

n

function values by a call of e02aff, which provides the Chebyshev series representation of the polynomial with very small additional relative error.

9.4

Iterative Refinement

The iterative refinement process is performed as follows.

Firstly, an initial approximation,

q_{1} (x)

say, is found by the technique described in Section 3. The

r

th step of the refinement process then consists of evaluating the residuals of the

r

th approximation

q_{r} (x)

, and constructing an interpolant,

d q_{r} (x)

, to these residuals. The next approximation

q_{r + 1} (x)

to the interpolating polynomial is then obtained as

q_{r + 1} (x) = q_{r} (x) + d q_{r} (x) .

This completes the description of the

r

th step.

The iterative process is terminated according to the following criteria. When a polynomial is found whose performance indices (as defined in Section 7) are all less than

8

times the machine precision, the process terminates after itmin further iterations (or after a total of itmax iterations if that occurs earlier). This will occur in most reasonable problems. The extra iterations are to allow for the possibility of further improvement. If no such polynomial is found, the process terminates after a total of itmax iterations. Both these criteria are over-ridden, however, in two special cases. Firstly, if for some value of

r

the sum of the moduli of the Chebyshev coefficients of

d q_{r} (x)

is greater than that of

q_{r} (x)

, it is concluded that the process is diverging and the process is terminated at once (

q_{r + 1} (x)

is not computed).

Secondly, if at any stage, the performance indices are all computed as zero, again the process is terminated at once.

As the iterations proceed, a record is kept of the best polynomial. Subsequently, at the end of each iteration, the new polynomial replaces the current best polynomial if it satisfies two conditions (otherwise the best polynomial remains unchanged). The first condition is that at least one of its root-mean-square residual values,

r_{k}

(see Section 7) is smaller than the corresponding value for the current best polynomial. The second condition takes two different forms according to whether or not the performance indices (see Section 7) of the current best polynomial are all less than

8

times the machine precision. If they are, then the largest performance index of the new polynomial is required to be less than that of the current best polynomial. If they are not, the number of indices which are less than

8

times the machine precision must not be smaller than for the current best polynomial. When the iterative process is terminated, it is the polynomial then recorded as best, which is returned to you as

q (x)

9.5

Workspace Information

On successful exit, and also if

ifail = 4

5

on exit, the following information is contained in the workspace arrays wrk and iwrk:

wrk (k + 1)

, for

k = 0, 1, \dots, ipmax

where

ipmax = \max_{i} p_{i}

, contains the ratio of

p_{k}

, the performance index relating to the

k

th derivative of the

q (x)

finally provided, to

8

times the machine precision.

wrk (ipmax + 1 + j)

, for

j = 1, 2, \dots, n

, contains the

j

th residual, i.e., the value of

y_{i}^{(k)} - q^{(k)} (x_{i})

, where

i

and

k

are the appropriate values corresponding to the

j

th element in the array y (see the description of y in Section 5).

iwrk (1)

contains the number of iterations actually performed in deriving

q (x)

If, on exit,

ifail = 4

5

, the

q (x)

finally provided may still be adequate for your requirements. To assess this you should examine the residuals contained in

wrk (ipmax + 1 + j)

, for

j = 1, 2, \dots, n

, to see whether they are acceptably small.

10

Example

This example constructs an interpolant

q (x)

to the following data:

\begin{array}{rrrll} m = 4, & x_{\min} = 2, & x_{\max} = 6, \\ x_{1} = 2, & p_{1} = 0, & y_{1} = 1, \\ x_{2} = 4, & p_{2} = 1, & y_{2} = 2, & y_{2}^{(1)} = - 1, \\ x_{3} = 5, & p_{3} = 0, & y_{3} = 1, \\ x_{4} = 6, & p_{4} = 2, & y_{4} = 2, & y_{4}^{(1)} = 4, & y_{4}^{(2)} = - 2 . \end{array}

The coefficients in the Chebyshev series representation of

q (x)

are printed, and also the residuals corresponding to each of the given function and derivative values.

This program is written in a generalized form which can read any number of data-sets.

NAG Library Routine Document

e01aef (dim1_cheb)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

9.1 Timing

9.2 Divided-difference Strategy

9.3 Conversion to Chebyshev Form

9.4 Iterative Refinement

9.5 Workspace Information

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification

3

Description

4

References

5

Arguments

6

Error Indicators and Warnings

7

Accuracy

8

Parallelism and Performance

9

Further Comments

9.1

Timing

9.2

Divided-difference Strategy

9.3

Conversion to Chebyshev Form

9.4

Iterative Refinement

9.5

Workspace Information

10

Example

10.1

Program Text

10.2

Program Data

10.3

Program Results