e02ajf determines the coefficients in the Chebyshev series representation of the indefinite integral of a polynomial given in Chebyshev series form.

2 Specification

Fortran Interface

Subroutine e02ajf (

np1, xmin, xmax, a, ia1, la, qatm1, aintc, iaint1, laint, ifail)

Integer, Intent (In)	::	np1, ia1, la, iaint1, laint
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	xmin, xmax, a(la), qatm1
Real (Kind=nag_wp), Intent (Out)	::	aintc(laint)

C Header Interface

#include <nag.h>

void	e02ajf_ (const Integer np1, const double xmin, const double xmax, const double a[], const Integer ia1, const Integer la, const double qatm1, double aintc[], const Integer iaint1, const Integer laint, Integer *ifail)

The routine may be called by the names e02ajf or nagf_fit_dim1_cheb_integ.

3 Description

e02ajf forms the polynomial which is the indefinite integral of a given polynomial. Both the original polynomial and its integral are represented in Chebyshev series form. If supplied with the coefficients

a_{i}

, for

i = 0, 1, \dots, n

, of a polynomial

p (x)

of degree

n

, where

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

the routine returns the coefficients

a_{i}^{'}

, for

i = 0, 1, \dots, n + 1

, of the polynomial

q (x)

of degree

n + 1

, where

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

and

q (x) = \int p (x) d x .

Here

T_{j} (\bar{x})

denotes the Chebyshev polynomial of the first kind of degree

j

with argument

\bar{x}

. It is assumed that the normalized variable

\bar{x}

in the interval

[−1, + 1]

was obtained from your original variable

x

in the interval

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

by the linear transformation

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

and that you require the integral to be with respect to the variable

x

. If the integral with respect to

\bar{x}

is required, set

x_{\max} = 1

and

x_{\min} = −1

Values of the integral can subsequently be computed, from the coefficients obtained, by using e02akf.

The method employed is that of Chebyshev series (see Chapter 8 of Modern Computing Methods (1961)), modified for integrating with respect to

x

. Initially taking

a_{n + 1} = a_{n + 2} = 0

, the routine forms successively

a_{i}^{'} = \frac{a_{i - 1} - a_{i + 1}}{2 i} \times \frac{x_{\max} - x_{\min}}{2}, i = n + 1, n, \dots, 1 .

The constant coefficient

a_{0}^{'}

is chosen so that

q (x)

is equal to a specified value, qatm1, at the lower end point of the interval on which it is defined, i.e.,

\bar{x} = −1

, which corresponds to

x = x_{\min}

4 References

Modern Computing Methods (1961) Chebyshev-series NPL Notes on Applied Science 16 (2nd Edition) HMSO

5 Arguments

1: $np1$ – Integer Input

On entry:

n + 1

, where

n

is the degree of the given polynomial

p (x)

. Thus np1 is the number of coefficients in this polynomial.

Constraint:

np1 \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}]

. The Chebyshev series representation is in terms of the normalized variable

\bar{x}

, where

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

Constraint:

xmax > xmin

4: $a (la)$ – Real (Kind=nag_wp) array Input

On entry: the Chebyshev coefficients of the polynomial

p (x)

. Specifically, element

i \times ia1 + 1

of a must contain the coefficient

a_{i}

, for

i = 0, 1, \dots, n

. Only these

n + 1

elements will be accessed.

Unchanged on exit, but see aintc, below.

5: $ia1$ – Integer Input

On entry: the index increment of a. Most frequently the Chebyshev coefficients are stored in adjacent elements of a, and ia1 must be set to

1

. However, if for example, they are stored in

a (1), a (4), a (7), \dots

, the value of ia1 must be

3

. See also Section 9.

Constraint:

ia1 \geq 1

6: $la$ – Integer Input

On entry: the dimension of the array a as declared in the (sub)program from which e02ajf is called.

Constraints:

$la \geq 1 + (np1 - 1) \times ia1$ .

7: $qatm1$ – Real (Kind=nag_wp) Input

On entry: the value that the integrated polynomial is required to have at the lower end point of its interval of definition, i.e., at

\bar{x} = −1

which corresponds to

x = x_{\min}

. Thus, qatm1 is a constant of integration and will normally be set to zero by you.

8: $aintc (laint)$ – Real (Kind=nag_wp) array Output

On exit: the Chebyshev coefficients of the integral

q (x)

. (The integration is with respect to the variable

x

, and the constant coefficient is chosen so that

q (x_{\min})

equals qatm1). Specifically, element

i \times iaint1 + 1

of aintc contains the coefficient

a_{i}^{'}

, for

i = 0, 1, \dots, n + 1

. A call of the routine may have the array name aintc the same as a, provided that note is taken of the order in which elements are overwritten when choosing starting elements and increments ia1 and iaint1: i.e., the coefficients,

a_{0}, a_{1}, \dots, a_{i - 2}

must be intact after coefficient

a_{i}^{'}

is stored. In particular it is possible to overwrite the

a_{i}

entirely by having

ia1 = iaint1

, and the actual array for a and aintc identical.

9: $iaint1$ – Integer Input

On entry: the index increment of aintc. Most frequently the Chebyshev coefficients are required in adjacent elements of aintc, and iaint1 must be set to

1

. However, if, for example, they are to be stored in

aintc (1), aintc (4), aintc (7), \dots

, the value of iaint1 must be

3

. See also Section 9.

Constraint:

iaint1 \geq 1

10: $laint$ – Integer Input

On entry: the dimension of the array aintc as declared in the (sub)program from which e02ajf is called.

Constraints:

$laint \geq 1 + (np1) \times iaint1$ .

11: $ifail$ – Integer Input/Output

On entry: ifail must be set to

0

−1

1

to set behaviour on detection of an error; these values have no effect when no error is detected.

A value of

0

causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of

−1

means that an error message is printed while a value of

1

means that it is not.

If halting is not appropriate, the value

−1

1

is recommended. If message printing is undesirable, then the value

1

is recommended. Otherwise, the value

0

is recommended. 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, $ia1 = ⟨ value ⟩$ .
Constraint: $ia1 \geq 1$ .

On entry, $iaint1 = ⟨ value ⟩$ .
Constraint: $iaint1 \geq 1$ .

On entry, $la = ⟨ value ⟩$ , $np1 = ⟨ value ⟩$ and $ia1 = ⟨ value ⟩$ .
Constraint: $la > (np1 - 1) \times ia1$ .

On entry, $laint = ⟨ value ⟩$ , $np1 = ⟨ value ⟩$ and $iaint1 = ⟨ value ⟩$ .
Constraint: $laint > np1 \times iaint1$ .

On entry, $np1 = ⟨ value ⟩$ .
Constraint: $np1 \geq 1$ .

On entry, $xmax = ⟨ value ⟩$ and $xmin = ⟨ value ⟩$ .
Constraint: $xmax > xmin$ .

$ifail = - 99$: An unexpected error has been triggered by this routine. Please contact NAG.
See Section 7 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 399$: Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.

$ifail = - 999$: Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

7 Accuracy

In general there is a gain in precision in numerical integration, in this case associated with the division by

2 i

in the formula quoted in Section 3.

8 Parallelism and Performance

Background information to multithreading can be found in the Multithreading documentation.

e02ajf is not threaded in any implementation.

9 Further Comments

The time taken is approximately proportional to

n + 1

The increments ia1, iaint1 are included as arguments to give a degree of flexibility which, for example, allows a polynomial in two variables to be integrated with respect to either variable without rearranging the coefficients.

10 Example

Suppose a polynomial has been computed in Chebyshev series form to fit data over the interval

[- 0.5, 2.5]

. The following program evaluates the integral of the polynomial from

0.0

2.0

. (For the purpose of this example, xmin, xmax and the Chebyshev coefficients are simply supplied in DATA statements. Normally a program would read in or generate data and compute the fitted polynomial).