NAG Library Routine Document

Integer, Intent (In)	::	mfirst, mlast, k, l, na, nwork
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	x(mlast), xmin, xmax, y, ymin, ymax, a(na)
Real (Kind=nag_wp), Intent (Out)	::	ff(mlast), work(nwork)

C Header Interface

#include <nagmk26.h>

void

e02cbf_ (const Integer *mfirst, const Integer *mlast, const Integer *k, const Integer *l, const double x[], const double *xmin, const double *xmax, const double *y, const double *ymin, const double *ymax, double ff[], const double a[], const Integer *na, double work[], const Integer *nwork, Integer *ifail)

3

Description

This subroutine evaluates a bivariate polynomial (represented in double Chebyshev form) of degree

k

in one variable,

\bar{x}

, and degree

l

in the other,

\bar{y}

. The range of both variables is

- 1

+ 1

. However, these normalized variables will usually have been derived (as when the polynomial has been computed by e02caf, for example) from your original variables

x

and

y

by the transformations

\bar{x} = \frac{2 x - (x_{\max} + x_{\min})}{(x_{\max} - x_{\min})} and \bar{y} = \frac{2 y - (y_{\max} + y_{\min})}{(y_{\max} - y_{\min})} .

(Here

x_{\min}

and

x_{\max}

are the ends of the range of

x

which has been transformed to the range

- 1

+ 1

\bar{x}

y_{\min}

and

y_{\max}

are correspondingly for

y

. See Section 9). For this reason, the subroutine has been designed to accept values of

x

and

y

rather than

\bar{x}

and

\bar{y}

, and so requires values of

x_{\min}

, etc. to be supplied by you. In fact, for the sake of efficiency in appropriate cases, the routine evaluates the polynomial for a sequence of values of

x

, all associated with the same value of

y

The double Chebyshev series can be written as

\sum_{i = 0}^{k} \sum_{j = 0}^{l} a_{i j} T_{i} (\bar{x}) T_{j} (\bar{y}),

where

T_{i} (\bar{x})

is the Chebyshev polynomial of the first kind of degree

i

and argument

\bar{x}

, and

T_{j} (\bar{y})

is similarly defined. However the standard convention, followed in this subroutine, is that coefficients in the above expression which have either

i

j

zero are written

\frac{1}{2} a_{i j}

, instead of simply

a_{i j}

, and the coefficient with both

i

and

j

zero is written

\frac{1}{4} a_{0, 0}

The subroutine first forms

c_{i} = \sum_{j = 0}^{l} a_{i j} T_{j} (\bar{y})

, with

a_{i, 0}

replaced by

\frac{1}{2} a_{i, 0}

, for each of

i = 0, 1, \dots, k

. The value of the double series is then obtained for each value of

x

, by summing

c_{i} \times T_{i} (\bar{x})

, with

c_{0}

replaced by

\frac{1}{2} c_{0}

, over

i = 0, 1, \dots, k

. The Clenshaw three term recurrence (see Clenshaw (1955)) with modifications due to Reinsch and Gentleman (1969) is used to form the sums.

4

References

Clenshaw C W (1955) A note on the summation of Chebyshev series Math. Tables Aids Comput. 9 118–120

Gentleman W M (1969) An error analysis of Goertzel's (Watt's) method for computing Fourier coefficients Comput. J. 12 160–165

5

Arguments

1: $mfirst$ – IntegerInput
2: $mlast$ – IntegerInput: On entry: the index of the first and last $x$ value in the array $x$ at which the evaluation is required respectively (see Section 9).

Constraint: $mlast \geq mfirst$ .
3: $k$ – IntegerInput
4: $l$ – IntegerInput: On entry: the degree $k$ of $x$ and $l$ of $y$ , respectively, in the polynomial.

Constraint: $k \geq 0$ and $l \geq 0$ .
5: $x (mlast)$ – Real (Kind=nag_wp) arrayInput: On entry: $x (i)$ , for $i = mfirst, \dots, mlast$ , must contain the $x$ values at which the evaluation is required.

Constraint: $xmin \leq x (i) \leq xmax$ , for all $i$ .
6: $xmin$ – Real (Kind=nag_wp)Input
7: $xmax$ – Real (Kind=nag_wp)Input: On entry: the lower and upper ends, $x_{\min}$ and $x_{\max}$ , of the range of the variable $x$ (see Section 3).
The values of xmin and xmax may depend on the value of $y$ (e.g., when the polynomial has been derived using e02caf).

Constraint: $xmax > xmin$ .
8: $y$ – Real (Kind=nag_wp)Input: On entry: the value of the $y$ coordinate of all the points at which the evaluation is required.

Constraint: $ymin \leq y \leq ymax$ .
9: $ymin$ – Real (Kind=nag_wp)Input
10: $ymax$ – Real (Kind=nag_wp)Input: On entry: the lower and upper ends, $y_{\min}$ and $y_{\max}$ , of the range of the variable $y$ (see Section 3).

Constraint: $ymax > ymin$ .
11: $ff (mlast)$ – Real (Kind=nag_wp) arrayOutput: On exit: $ff (i)$ gives the value of the polynomial at the point $(x_{i}, y)$ , for $i = mfirst, \dots, mlast$ .
12: $a (na)$ – Real (Kind=nag_wp) arrayInput: On entry: the Chebyshev coefficients of the polynomial. The coefficient $a_{i j}$ defined according to the standard convention (see Section 3) must be in $a (i \times (l + 1) + j + 1)$ .
13: $na$ – IntegerInput: On entry: the dimension of the array a as declared in the (sub)program from which e02cbf is called.

Constraint: $na \geq (k + 1) \times (l + 1)$ , the number of coefficients in a polynomial of the specified degree.
14: $work (nwork)$ – Real (Kind=nag_wp) arrayWorkspace
15: $nwork$ – IntegerInput: On entry: the dimension of the array work as declared in the (sub)program from which e02cbf is called.

Constraint: $nwork \geq k + 1$ .
16: $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, $k = 〈value〉$ .
Constraint: $k \geq 0$ .

On entry, $l = 〈value〉$ .
Constraint: $l \geq 0$ .

On entry, $mfirst = 〈value〉$ and $mlast = 〈value〉$ .
Constraint: $mfirst \leq mlast$ .

On entry, $na = 〈value〉$ , $k = 〈value〉$ and $l = 〈value〉$ .
Constraint: $na \geq (k + 1) \times (l + 1)$ .

On entry, $nwork = 〈value〉$ and $k = 〈value〉$ .
Constraint: $nwork \geq k + 1$ .

$ifail = 2$: On entry, $y = 〈value〉$ and $ymax = 〈value〉$ .
Constraint: $y \leq ymax$ .

On entry, $y = 〈value〉$ and $ymin = 〈value〉$ .
Constraint: $y \geq ymin$ .

On entry, $ymin = 〈value〉$ and $ymax = 〈value〉$ .
Constraint: $ymin < ymax$ .

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

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

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

$ifail = 4$: Unexpected internal failure when evaluating the polynomial.

$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

The method is numerically stable in the sense that the computed values of the polynomial are exact for a set of coefficients which differ from those supplied by only a modest multiple of machine precision.

8

Parallelism and Performance

e02cbf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.

Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

9

Further Comments

The time taken is approximately proportional to

(k + 1) \times (m + l + 1)

, where

m = mlast - mfirst + 1

, the number of points at which the evaluation is required.

This subroutine is suitable for evaluating the polynomial surface fits produced by the subroutine e02caf, which provides the real array a in the required form. For this use, the values of

y_{\min}

and

y_{\max}

supplied to the present subroutine must be the same as those supplied to e02caf. The same applies to

x_{\min}

and

x_{\max}

if they are independent of

y

. If they vary with

y

, their values must be consistent with those supplied to e02caf (see Section 9 in e02caf).

The arguments mfirst and mlast are intended to permit the selection of a segment of the array x which is to be associated with a particular value of

y

, when, for example, other segments of x are associated with other values of

y

. Such a case arises when, after using e02caf to fit a set of data, you wish to evaluate the resulting polynomial at all the data values. In this case, if the arguments x, y, mfirst and mlast of the present routine are set respectively (in terms of arguments of e02caf) to x,

y (S)

1 + \sum_{i = 1}^{s - 1} m (i)

and

\sum_{i = 1}^{s} m (i)

, the routine will compute values of the polynomial surface at all data points which have

y (S)

as their

y

coordinate (from which values the residuals of the fit may be derived).

10

Example

This example reads data in the following order, using the notation of the argument list above:

\begin{array}{l} N k l \\ a (i), & for ​ i = 1, 2, \dots, (k + 1) \times (l + 1) \\ ymin ymax \\ y (i) M (i) xmin (i) xmax (i) X1 (i) XM (i), & for ​ i = 1, 2, \dots, N . \end{array}

For each line

y = y (i)

the polynomial is evaluated at

M (i)

equispaced points between

X1 (i)

and

XM (i)

inclusive.

NAG Library Routine Document

e02cbf (dim2_cheb_eval)

▸▿ 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

10 Example

10.1 Program Text

10.2 Program Data

10.3 Program Results

1

Purpose

2

Specification