NAG FL Interface
d02jbf (bvp_coll_sys)
1
Purpose
d02jbf solves a regular linear twopoint boundary value problem for a system of ordinary differential equations by Chebyshev series using collocation and least squares.
2
Specification
Fortran Interface
Subroutine d02jbf ( 
n, cf, bc, x0, x1, k1, kp, c, ldc, w, lw, iw, liw, ifail) 
Integer, Intent (In) 
:: 
n, k1, kp, ldc, lw, liw 
Integer, Intent (Inout) 
:: 
ifail 
Integer, Intent (Out) 
:: 
iw(liw) 
Real (Kind=nag_wp), External 
:: 
cf 
Real (Kind=nag_wp), Intent (In) 
:: 
x0, x1 
Real (Kind=nag_wp), Intent (Inout) 
:: 
c(ldc,n) 
Real (Kind=nag_wp), Intent (Out) 
:: 
w(lw) 
External 
:: 
bc 

C Header Interface
#include <nag.h>
void 
d02jbf_ (const Integer *n, double (NAG_CALL *cf)(const Integer *i, const Integer *j, const double *x), void (NAG_CALL *bc)(const Integer *i, Integer *j, double *rhs), const double *x0, const double *x1, const Integer *k1, const Integer *kp, double c[], const Integer *ldc, double w[], const Integer *lw, Integer iw[], const Integer *liw, Integer *ifail) 

C++ Header Interface
#include <nag.h> extern "C" {
void 
d02jbf_ (const Integer &n, double (NAG_CALL *cf)(const Integer &i, const Integer &j, const double &x), void (NAG_CALL *bc)(const Integer &i, Integer &j, double &rhs), const double &x0, const double &x1, const Integer &k1, const Integer &kp, double c[], const Integer &ldc, double w[], const Integer &lw, Integer iw[], const Integer &liw, Integer &ifail) 
}

The routine may be called by the names d02jbf or nagf_ode_bvp_coll_sys.
3
Description
d02jbf calculates the solution of a regular twopoint boundary value problem for a regular linear
$n$thorder system of firstorder ordinary differential equations as a Chebyshev series in the interval
$\left({x}_{0},{x}_{1}\right)$. The differential equation
is defined by
cf, and the boundary conditions at the points
${x}_{0}$ and
${x}_{1}$ are defined by
bc.
You specify the degree of Chebyshev series required,
${\mathbf{k1}}1$, and the number of collocation points,
kp. The routine sets up a system of linear equations for the Chebyshev coefficients,
$n$ equations for each collocation point and one for each boundary condition. The boundary conditions are solved exactly, and the remaining equations are then solved by a least squares method. The result produced is a set of coefficients for a Chebyshev series solution for each component of the solution of the system of differential equations on an interval normalized to
$\left(1,1\right)$.
e02akf can be used to evaluate the components of the solution at any point on the interval
$\left({x}_{0},{x}_{1}\right)$ – see
Section 10 for an example.
e02ahf followed by
e02akf can be used to evaluate their derivatives.
4
References
Picken S M (1970) Algorithms for the solution of differential equations in Chebyshevseries by the selected points method Report Math. 94 National Physical Laboratory
5
Arguments

1:
$\mathbf{n}$ – Integer
Input

On entry: $n$, the order of the system of differential equations.
Constraint:
${\mathbf{n}}\ge 1$.

2:
$\mathbf{cf}$ – real (Kind=nag_wp) Function, supplied by the user.
External Procedure

cf defines the system of differential equations (see
Section 3). It must return the value of a coefficient function
${a}_{i,j}\left(x\right)$, of
$A$, at a given point
$x$, or of a righthand side function
${r}_{i}\left(x\right)$ if
${\mathbf{j}}=0$.
The specification of
cf is:
Fortran Interface
Real (Kind=nag_wp) 
:: 
cf 
Integer, Intent (In) 
:: 
i, j 
Real (Kind=nag_wp), Intent (In) 
:: 
x 

C Header Interface
double 
cf_ (const Integer *i, const Integer *j, const double *x) 

C++ Header Interface
#include <nag.h> extern "C" {
double 
cf_ (const Integer &i, const Integer &j, const double &x) 
}


1:
$\mathbf{i}$ – Integer
Input

2:
$\mathbf{j}$ – Integer
Input

On entry: indicate the function to be evaluated, namely ${a}_{i,j}\left(x\right)$ if $1\le {\mathbf{j}}\le n$, or ${r}_{i}\left(x\right)$ if ${\mathbf{j}}=0$.
$1\le {\mathbf{i}}\le n$, $0\le {\mathbf{j}}\le n$.

3:
$\mathbf{x}$ – Real (Kind=nag_wp)
Input

On entry: the point at which the function is to be evaluated.
cf must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which
d02jbf is called. Arguments denoted as
Input must
not be changed by this procedure.
Note: cf should not return floatingpoint NaN (Not a Number) or infinity values, since these are not handled by
d02jbf. If your code inadvertently
does return any NaNs or infinities,
d02jbf is likely to produce unexpected results.

3:
$\mathbf{bc}$ – Subroutine, supplied by the user.
External Procedure

bc defines the
$n$ boundary conditions, which have the form
${y}_{k}\left({x}_{0}\right)=s$ or
${y}_{k}\left({x}_{1}\right)=s$. The boundary conditions may be specified in any order.
The specification of
bc is:
Fortran Interface
Subroutine bc ( 
i, j, rhs) 
Integer, Intent (In) 
:: 
i 
Integer, Intent (Out) 
:: 
j 
Real (Kind=nag_wp), Intent (Out) 
:: 
rhs 

C Header Interface
void 
bc_ (const Integer *i, Integer *j, double *rhs) 

C++ Header Interface
#include <nag.h> extern "C" {
void 
bc_ (const Integer &i, Integer &j, double &rhs) 
}


1:
$\mathbf{i}$ – Integer
Input

On entry: the index of the boundary condition to be defined.

2:
$\mathbf{j}$ – Integer
Output

On exit: must be set to
$k$ if the
$i$th boundary condition is
${y}_{k}\left({x}_{0}\right)=s$, or to
$+k$ if it is
${y}_{k}\left({x}_{1}\right)=s$.
j must not be set to the same value
$k$ for two different values of
i.

3:
$\mathbf{rhs}$ – Real (Kind=nag_wp)
Output

On exit: the value $s$.
bc must either be a module subprogram USEd by, or declared as EXTERNAL in, the (sub)program from which
d02jbf is called. Arguments denoted as
Input must
not be changed by this procedure.
Note: bc should not return floatingpoint NaN (Not a Number) or infinity values, since these are not handled by
d02jbf. If your code inadvertently
does return any NaNs or infinities,
d02jbf is likely to produce unexpected results.

4:
$\mathbf{x0}$ – Real (Kind=nag_wp)
Input

5:
$\mathbf{x1}$ – Real (Kind=nag_wp)
Input

On entry: the left and righthand boundaries, ${x}_{0}$ and ${x}_{1}$, respectively.
Constraint:
${\mathbf{x1}}>{\mathbf{x0}}$.

6:
$\mathbf{k1}$ – Integer
Input

On entry: the number of coefficients to be returned in the Chebyshev series representation of the components of the solution (hence the degree of the polynomial approximation is ${\mathbf{k1}}1$).
Constraint:
${\mathbf{k1}}\ge 2$.

7:
$\mathbf{kp}$ – Integer
Input

On entry: the number of collocation points to be used.
Constraint:
${\mathbf{kp}}\ge {\mathbf{k1}}1$.

8:
$\mathbf{c}\left({\mathbf{ldc}},{\mathbf{n}}\right)$ – Real (Kind=nag_wp) array
Output

On exit: the computed Chebyshev coefficients of the
$k$th component of the solution,
${y}_{k}$; that is, the computed solution is:
where
${T}_{i}\left(x\right)$ is the
$i$th Chebyshev polynomial of the first kind, and
${\sum}^{\prime}$ denotes that the first coefficient,
${\mathbf{c}}\left(1,k\right)$, is halved.

9:
$\mathbf{ldc}$ – Integer
Input

On entry: the first dimension of the array
c as declared in the (sub)program from which
d02jbf is called.
Constraint:
${\mathbf{ldc}}\ge {\mathbf{k1}}$.

10:
$\mathbf{w}\left({\mathbf{lw}}\right)$ – Real (Kind=nag_wp) array
Workspace

11:
$\mathbf{lw}$ – Integer
Input

On entry: the dimension of the array
w as declared in the (sub)program from which
d02jbf is called.
Constraint:
${\mathbf{lw}}\ge 2\times {\mathbf{n}}\times \left({\mathbf{kp}}+1\right)\times \left({\mathbf{n}}\times {\mathbf{k1}}+1\right)+7\times {\mathbf{n}}\times {\mathbf{k1}}$.

12:
$\mathbf{iw}\left({\mathbf{liw}}\right)$ – Integer array
Workspace

13:
$\mathbf{liw}$ – Integer
Input

On entry: the dimension of the array
iw as declared in the (sub)program from which
d02jbf is called.
Constraint:
${\mathbf{liw}}\ge {\mathbf{n}}\times \left({\mathbf{k1}}+2\right)$.

14:
$\mathbf{ifail}$ – Integer
Input/Output

On entry:
ifail must be set to
$0$,
$1\text{or}1$. If you are unfamiliar with this argument you should refer to
Section 4 in the Introduction to the NAG Library FL Interface for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value
$1\text{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 $\mathbf{1}\text{or}\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit:
${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see
Section 6).
6
Error Indicators and Warnings
If on entry
${\mathbf{ifail}}=0$ or
$1$, explanatory error messages are output on the current error message unit (as defined by
x04aaf).
Errors or warnings detected by the routine:
 ${\mathbf{ifail}}=1$

On entry, ${\mathbf{k1}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{k1}}\ge 2$.
On entry, ${\mathbf{kp}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{k1}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{kp}}+1\ge {\mathbf{k1}}$.
On entry, ${\mathbf{n}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{n}}\ge 1$.
On entry, ${\mathbf{x1}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{x0}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{x1}}>{\mathbf{x0}}$.
 ${\mathbf{ifail}}=2$

On entry, ${\mathbf{liw}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{liw}}\ge {\mathbf{n}}\times {\mathbf{k1}}+2\times {\mathbf{n}}$; that is, $\u2329\mathit{\text{value}}\u232a$.
On entry, ${\mathbf{lw}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{lw}}\ge 2\times {\mathbf{n}}\times \left({\mathbf{kp}}+1\right)\times \left({\mathbf{n}}\times {\mathbf{k1}}+1\right)+7\times {\mathbf{n}}\times {\mathbf{k1}}$; that is, $\u2329\mathit{\text{value}}\u232a$.
 ${\mathbf{ifail}}=3$

Either the boundary conditions are not linearly independent, or the coefficient matrix is rank deficient. Increasing the number of collocation points may overcome this latter problem.
 ${\mathbf{ifail}}=4$

Iterative refinement in the least squares solution has failed to converge. The coefficient matrix is too illconditioned.
 ${\mathbf{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.
 ${\mathbf{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.
 ${\mathbf{ifail}}=999$
Dynamic memory allocation failed.
See
Section 9 in the Introduction to the NAG Library FL Interface for further information.
7
Accuracy
The Chebyshev coefficients are determined by a stable numerical method. The accuracy of the approximate solution may be checked by varying the degree of the polynomials and the number of collocation points (see
Section 9).
8
Parallelism and Performance
d02jbf is not thread safe and should not be called from a multithreaded user program. Please see
Section 1 in FL Interface Multithreading for more information on thread safety.
d02jbf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
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 implementationspecific information.
The time taken by d02jbf depends on the size and complexity of the differential system, the degree of the polynomial solution, and the number of matching points.
The collocation points in the interval $\left({x}_{0},{x}_{1}\right)$ are chosen to be the extrema of the appropriate shifted Chebyshev polynomial. If ${\mathbf{kp}}={\mathbf{k1}}1$, then the least squares solution reduces to the solution of a system of linear equations, and true collocation results.
The accuracy of the solution may be checked by repeating the calculation with different values of
k1 and with
kp fixed but
${\mathbf{kp}}\gg {\mathbf{k1}}1$. If the Chebyshev coefficients decrease rapidly for each component (and consistently for various
k1 and
kp), the size of the last two or three gives an indication of the error. If the Chebyshev coefficients do not decay rapidly, it is likely that the solution cannot be wellrepresented by Chebyshev series. Note that the Chebyshev coefficients are calculated for the interval
$\left(1,1\right)$.
Linear systems of highorder equations in their original form, singular problems, and, indirectly, nonlinear problems can be solved using
d02tgf.
10
Example
This example solves the equation
with boundary conditions
The equation is written as the firstorder system
for solution by
d02jbf and the boundary conditions are written
We use
${\mathbf{k1}}=4$,
$6$ and
$8$, and
${\mathbf{kp}}=10$ and
$15$, so that the different Chebyshev series may be compared. The solution for
${\mathbf{k1}}=8$ and
${\mathbf{kp}}=15$ is evaluated by
e02akf at nine equally spaced points over the interval
$\left(1,1\right)$.
10.1
Program Text
10.2
Program Data
10.3
Program Results