NAG Library Routine Document

D02TGF

D02TGF calculates an approximate solution of a linear or linearized system of ordinary differential equations as a Chebyshev series. Suppose there are

n

differential equations for

n

variables

y_{1}, y_{2}, \dots, y_{n}

, over the range

(x_{0}, x_{1})

. Let the

i

th equation be

\sum_{j = 1}^{m_{i} + 1} \sum_{k = 1}^{n} f_{k j}^{i} (x) y_{k}^{(j - 1)} (x) = r^{i} (x)

where

y_{k}^{(j)} (x) = \frac{d^{j} y_{k} (x)}{d x^{j}}

. COEFF evaluates the coefficients

f_{k j}^{i} (x)

and the right-hand side

r^{i} (x)

for each

i

1 \leq i \leq n

, at any point

x

. The boundary conditions may be applied either at the end points or at intermediate points; they are written in the same form as the differential equations, and specified by BDYC. For example the

j

th boundary condition out of those associated with the

i

th differential equation takes the form

\sum_{j = 1}^{l_{i} + 1} \sum_{k = 1}^{n} f_{k j}^{i j} (x^{i j}) y_{k}^{(j - 1)} (x^{i j}) = r^{i j} (x^{i j}),

where

x^{i j}

lies between

x_{0}

and

x_{1}

. It is assumed in this routine that certain of the boundary conditions are associated with each differential equation. This is for your convenience; the grouping does not affect the results.

The degree of the polynomial solution must be the same for all variables. You specify the degree required,

k_{1} - 1

, and the number of collocation points,

k_{p}

, in the range. The routine sets up a system of linear equations for the Chebyshev coefficients, with

n

equations for each collocation point and one for each boundary condition. The collocation points are chosen at the extrema of a shifted Chebyshev polynomial of degree

k_{p} - 1

. The boundary conditions are satisfied exactly, and the remaining equations are solved by a least squares method. The result produced is a set of Chebyshev coefficients for the

n

functions

y_{1}, y_{2}, \dots, y_{n}

, with the range normalized to

[- 1, 1]

E02AKF can be used to evaluate the components of the solution at any point on the range

[x_{0}, x_{1}]

(see Section 9 for an example). E02AHF and E02AJF may be used to obtain Chebyshev series representations of derivatives and integrals (respectively) of the components of the solution.

4 References

Picken S M (1970) Algorithms for the solution of differential equations in Chebyshev-series by the selected points method Report Math. 94 National Physical Laboratory

5 Parameters

1: N – INTEGERInput

On entry:

n

, the number of differential equations in the system.

Constraint:

N \geq 1

2: M(N) – INTEGER arrayInput

On entry:

M (i)

must be set to the highest order derivative occurring in the

i

th equation, for

i = 1, 2, \dots, n

Constraint:

M (i) \geq 1

, for

i = 1, 2, \dots, n

3: L(N) – INTEGER arrayInput

On entry:

L (i)

must be set to the number of boundary conditions associated with the

i

th equation, for

i = 1, 2, \dots, n

Constraint:

L (i) \geq 0

, for

i = 1, 2, \dots, n

4: X0 – REAL (KIND=nag_wp)Input

On entry: the left-hand boundary,

x_{0}

5: X1 – REAL (KIND=nag_wp)Input

On entry: the right-hand boundary,

x_{1}

Constraint:

X1 > X0

6: K1 – INTEGERInput

On entry: the number of coefficients,

k_{1}

, to be returned in the Chebyshev series representation of the solution (hence, the degree of the polynomial approximation is

K1 - 1

Constraint:

K1 \geq 1 + \max_{1 \leq i \leq N} M (i)

7: KP – INTEGERInput

On entry: the number of collocation points to be used,

k_{p}

Constraint:

N \times KP \geq N \times K1 + \sum_{i = 1}^{N} L (i)

8: C(LDC,N) – REAL (KIND=nag_wp) arrayOutput

On exit: the

k

th column of C contains the computed Chebyshev coefficients of the

k

th component of the solution,

y_{k}

; that is, the computed solution is:

y_{k} = {\sum^{'}}_{i = 1}^{k_{1}} C (i, k) T_{i - 1} (x), 1 \leq k \leq n,

where

T_{i} (x)

is the Chebyshev polynomial of the first kind and

\sum^{'}

denotes that the first coefficient,

C (1, k)

, is halved.

9: LDC – INTEGERInput

On entry: the first dimension of the array C as declared in the (sub)program from which D02TGF is called.

Constraint:

LDC \geq K1

10: COEFF – SUBROUTINE, supplied by the user.External Procedure

COEFF defines the system of differential equations (see Section 3). It must evaluate the coefficient functions

f_{k j}^{i} (x)

and the right-hand side function

r^{i} (x)

of the

i

th equation at a given point. Only nonzero entries of the array A and RHS need be specifically assigned, since all elements are set to zero by D02TGF before calling COEFF.

The specification of COEFF is:

SUBROUTINE COEFF (

X, I, A, IA, IA1, RHS)

INTEGER	I, IA, IA1
REAL (KIND=nag_wp)	X, A(IA,IA1), RHS

Important: the dimension declaration for A must contain the variable IA, not an integer constant.

1: X – REAL (KIND=nag_wp)Input: On entry: $x$ , the point at which the functions must be evaluated.
2: I – INTEGERInput: On entry: the equation for which the coefficients and right-hand side are to be evaluated.
3: A(IA,IA1) – REAL (KIND=nag_wp) arrayInput/Output: On entry: all elements of A are set to zero.

On exit: $A (k, j)$ must contain the value $f_{k j}^{i} (x)$ , for $1 \leq k \leq n$ , $1 \leq j \leq m_{i} + 1$ .
4: IA – INTEGERInput
5: IA1 – INTEGERInput: On entry: the first dimension of the array A and the second dimension of the array A as declared in the (sub)program from which D02TGF is called.
6: RHS – REAL (KIND=nag_wp)Input/Output: On entry: is set to zero.

On exit: it must contain the value $r^{i} (x)$ .

COEFF must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which D02TGF is called. Parameters denoted as Input must not be changed by this procedure.

11: BDYC – SUBROUTINE, supplied by the user.External Procedure

BDYC defines the boundary conditions (see Section 3). It must evaluate the coefficient functions

f_{k j}^{i j}

and right-hand side function

r^{i j}

in the

j

th boundary condition associated with the

i

th equation, at the point

x^{i j}

at which the boundary condition is applied. Only nonzero entries of the array A and RHS need be specifically assigned, since all elements are set to zero by D02TGF before calling BDYC.

The specification of BDYC is:

SUBROUTINE BDYC (

X, I, J, A, IA, IA1, RHS)

INTEGER	I, J, IA, IA1
REAL (KIND=nag_wp)	X, A(IA,IA1), RHS

Important: the dimension declaration for A must contain the variable IA, not an integer constant.

1: X – REAL (KIND=nag_wp)Output: On exit: $x^{i j}$ , the value at which the boundary condition is applied.
2: I – INTEGERInput: On entry: the differential equation with which the condition is associated.
3: J – INTEGERInput: On entry: the boundary condition for which the coefficients and right-hand side are to be evaluated.
4: A(IA,IA1) – REAL (KIND=nag_wp) arrayInput/Output: On entry: all elements of A are set to zero.

On exit: the value $f_{k j}^{i j} (x^{i j})$ , for $1 \leq k \leq n$ , $1 \leq j \leq m_{i} + 1$ .
5: IA – INTEGERInput
6: IA1 – INTEGERInput: On entry: the first dimension of the array A and the second dimension of the array A as declared in the (sub)program from which D02TGF is called.
7: RHS – REAL (KIND=nag_wp)Input/Output: On entry: is set to zero.

On exit: the value $r^{i j} (x^{i j})$ .

BDYC must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which D02TGF is called. Parameters denoted as Input must not be changed by this procedure.

12: W(LW) – REAL (KIND=nag_wp) arrayWorkspace

13: LW – INTEGERInput

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

Constraint:

LW \geq 2 \times (N \times KP + NL) \times (N \times K1 + 1) + 7 \times N \times K1

, where

NL = \sum_{i = 1}^{n} L (i)

14: IW(LIW) – INTEGER arrayWorkspace

15: LIW – INTEGERInput

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

Constraint:

LIW \geq N \times K1 + 1

16: IFAIL – INTEGERInput/Output

On entry: IFAIL must be set to

0

- 1 ​ or ​ 1

. If you are unfamiliar with this parameter you should refer to Section 3.3 in the Essential Introduction 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 parameter, 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,	$N < 1$ ,
or	$M (i) < 1$ for some $i$ ,
or	$L (i) < 0$ for some $i$ ,
or	$X0 \geq X1$ ,
or	$K1 < 1 + M (i)$ for some $i$ ,
or	$N \times KP < N \times K1 + \sum_{i = 1}^{n} L (i)$ ,
or	$LDC < K1$ .

$IFAIL = 2$

On entry,	LW is too small (see Section 5),
or	$LIW < N \times K1$ .

$IFAIL = 3$: Either the boundary conditions are not linearly independent, or the rank of the matrix of equations for the coefficients is less than the number of unknowns. Increasing KP may overcome this latter problem.

$IFAIL = 4$: The least squares routine F04AMF has failed to correct the first approximate solution (see F04AMF). Increasing KP may remove this difficulty.

7 Accuracy

Estimates of the accuracy of the solution may be obtained by using the checks described in Section 8. The Chebyshev coefficients are calculated by a stable numerical method.

8 Further Comments

The time taken by D02TGF depends on the complexity of the system of differential equations, the degree of the polynomial solution and the number of matching points.

If the number of matching points

k_{p}

is equal to the number of coefficients

k_{1}

minus the average number of boundary conditions

\frac{1}{n} \sum_{i = 1}^{n} l_{i}

, then the least squares solution reduces to simple solution of linear equations and true collocation results. The accuracy of the solution may be checked by repeating the calculation with different values of

k_{1}

. If the Chebyshev coefficients decrease rapidly, the size of the last two or three gives an indication of the error. If they do not decrease rapidly, it may be desirable to use a different method. Note that the Chebyshev coefficients are calculated for the range normalized to

[- 1, 1]

Generally the number of boundary conditions required is equal to the sum of the orders of the

n

differential equations. However, in some cases fewer boundary conditions are needed, because the assumption of a polynomial solution is equivalent to one or more boundary conditions (since it excludes singular solutions).

A system of nonlinear differential equations must be linearized before using the routine. The calculation is repeated iteratively. On each iteration the linearized equation is used. In the example in Section 9, the

y

variables are to be determined at the current iteration whilst the

z

variables correspond to the solution determined at the previous iteration, (or the initial approximation on the first iteration). For a starting approximation, we may take, say, a linear function, and set up the appropriate Chebyshev coefficients before starting the iteration. For example, if

y_{1} = a x + b

in the range

(x_{0}, x_{1})

, we set

B

, the array of coefficients,

$B (1, 1) = a \times (x_{0} + x_{1}) + 2 \times b$ ,
$B (1, 2) = a \times (x_{1} - x_{0}) / 2$ ,
and the remainder of the entries to zero.

In some cases a better initial approximation may be needed and can be obtained by using E02ADF or E02AFF to obtain a Chebyshev series for an approximate solution. The coefficients of the current iterate must be communicated to COEFF and BDYC, e.g., in COMMON. (See Section 9.) The convergence of the (Newton) iteration cannot be guaranteed in general, though it is usually satisfactory from a good starting approximation.

9 Example

This example solves the nonlinear system

\begin{matrix} 2 y_{1}^{'} + (y_{2}^{2} - 1) y_{1} + y_{2} = 0, \\ 2 y_{2}^{''} - y_{1}^{'} = 0, \end{matrix}

in the range

(- 1, 1)

, with

y_{1} = 0

y_{2} = 3

y_{2}^{'} = 0

x = - 1

Suppose an approximate solution is

z_{1}

z_{2}

such that

y_{1} \sim z_{1}

y_{2} \sim z_{2}

: then the first equation gives, on linearizing,

2 y_{1}^{'} + (z_{2}^{2} - 1) y_{1} + (2 z_{1} z_{2} + 1) y_{2} = 2 z_{1} z_{2}^{2} .

The starting approximation is taken to be

z_{1} = 0

z_{2} = 3

. In the program below, the array

B

is used to hold the coefficients of the previous iterate (or of the starting approximation). We iterate until the Chebyshev coefficients converge to five figures. E02AKF is used to calculate the solution from its Chebyshev coefficients.

NAG Library Routine DocumentD02TGF

+− Contents

1 Purpose

2 Specification

3 Description

4 References

5 Parameters

6 Error Indicators and Warnings

7 Accuracy

8 Further Comments

9 Example

9.1 Program Text

9.2 Program Data

9.3 Program Results

NAG Library Routine Document

D02TGF