nag_ode_bvp_ps_lin_solve (d02uec) (PDF version)
d02 Chapter Contents
d02 Chapter Introduction
NAG C Library Manual

NAG Library Function Document

nag_ode_bvp_ps_lin_solve (d02uec)

+ Contents

    1  Purpose
    7  Accuracy

1  Purpose

nag_ode_bvp_ps_lin_solve (d02uec) finds the solution of a linear constant coefficient boundary value problem by using the Chebyshev integration formulation on a Chebyshev Gauss–Lobatto grid.

2  Specification

#include <nag.h>
#include <nagd02.h>
void  nag_ode_bvp_ps_lin_solve (Integer n, double a, double b, Integer m, const double c[], double bmat[], const double y[], const double bvec[], double f[], double uc[], double *resid, NagError *fail)

3  Description

nag_ode_bvp_ps_lin_solve (d02uec) solves the constant linear coefficient ordinary differential problem
j=0 m fj+1 dju dxj = fx ,  x a,b
subject to a set of m linear constraints at points yia,b , for i=1,2,,m:
j=0 m B i,j+1 dju dxj x=yi = βi ,
where 1m4, B is an m×m+1 matrix of constant coefficients and βi are constants. The points yi are usually either a or b.
The function fx is supplied as an array of Chebyshev coefficients cj, j=0,1,,n for the function discretized on n+1 Chebyshev Gauss–Lobatto points (as returned by nag_ode_bvp_ps_lin_cgl_grid (d02ucc)); the coefficients are normally obtained by a previous call to nag_ode_bvp_ps_lin_coeffs (d02uac). The solution and its derivatives (up to order m) are returned, in the form of their Chebyshev series representation, as arrays of Chebyshev coefficients; subsequent calls to nag_ode_bvp_ps_lin_cgl_vals (d02ubc) will return the corresponding function and derivative values at the Chebyshev Gauss–Lobatto discretization points on a,b. Function and derivative values can be obtained on any uniform grid over the same range a,b by calling the interpolation function nag_ode_bvp_ps_lin_grid_vals (d02uwc).

4  References

Clenshaw C W (1957) The numerical solution of linear differential equations in Chebyshev series Proc. Camb. Phil. Soc. 53 134–149
Coutsias E A, Hagstrom T and Torres D (1996) An efficient spectral method for ordinary differential equations with rational function coefficients Mathematics of Computation 65(214) 611–635
Greengard L (1991) Spectral integration and two-point boundary value problems SIAM J. Numer. Anal. 28(4) 1071–80
Lundbladh A, Hennigson D S and Johannson A V (1992) An efficient spectral integration method for the solution of the Navier–Stokes equations Technical report FFA–TN 1992–28 Aeronautical Research Institute of Sweden
Muite B K (2010) A numerical comparison of Chebyshev methods for solving fourth-order semilinear initial boundary value problems Journal of Computational and Applied Mathematics 234(2) 317–342

5  Arguments

1:     nIntegerInput
On entry: n, where the number of grid points is n+1.
Constraint: n8 and n is even.
2:     adoubleInput
On entry: a, the lower bound of domain a,b.
Constraint: a<b.
3:     bdoubleInput
On entry: b, the upper bound of domain a,b.
Constraint: b>a.
4:     mIntegerInput
On entry: the order, m, of the boundary value problem to be solved.
Constraint: 1m4.
5:     c[n+1]const doubleInput
On entry: the Chebyshev coefficients cj, j=0,1,,n, for the right hand side of the boundary value problem. Usually these are obtained by a previous call of nag_ode_bvp_ps_lin_coeffs (d02uac).
6:     bmat[m×m+1]doubleInput/Output
On entry: bmat[j×m+i-1] must contain the coefficients Bi,j+1, for i=1,2,,m and j=0,1,,m, in the problem formulation of Section 3.
On exit: the coefficients have been scaled to form an equivalent problem defined on the domain -1,1.
7:     y[m]const doubleInput
On entry: the points, yi, for i=1,2,,m, where the boundary conditions are discretized.
8:     bvec[m]const doubleInput
On entry: the values, βi, for i=1,2,,m, in the formulation of the boundary conditions given in Section 3.
9:     f[m+1]doubleInput/Output
On entry: the coefficients, fj, for j=1,2,,m+1, in the formulation of the linear boundary value problem given in Section 3. The highest order term, f[m], needs to be nonzero to have a well posed problem.
On exit: the coefficients have been scaled to form an equivalent problem defined on the domain -1,1.
10:   uc[n+1×m+1]doubleOutput
Note: the i,jth element of the matrix is stored in uc[j-1×n+1+i-1].
On exit: the Chebyshev coefficients in the Chebyshev series representations of the solution and derivatives of the solution to the boundary value problem. The coefficients of U are stored as the first n+1 elements of uc, the first derivative coefficients are stored as the next n+1 elements of uc, and so on.
11:   residdouble *Output
On exit: the maximum residual resulting from substituting the solution vectors returned in uc into both linear equations of Section 3 representing the linear boundary value problem and associated boundary conditions. That is
max max i=1,m j=0 m B i,j+1 dju dxj x=yi - βi , max i=1, n+1 j=0 m f j+1 dju dxj x=xi - fx .
12:   failNagError *Input/Output
The NAG error argument (see Section 3.6 in the Essential Introduction).

6  Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
NE_BAD_PARAM
On entry, argument value had an illegal value.
NE_CONVERGENCE
During iterative refinement, convergence was achieved, but the residual is more than 100×machine precision. Residual achieved on convergence=value.
NE_INT
On entry, m=value.
Constraint: 1m4.
On entry, n=value.
Constraint: n is even.
On entry, n=value.
Constraint: n8.
NE_INTERNAL_ERROR
An internal error has occurred in this function. Check the function call and any array sizes. If the call is correct then please contact NAG for assistance.
Internal error while unpacking matrix during iterative refinement.
Please contact NAG.
NE_REAL_2
On entry, a=value and b=value.
Constraint: a<b.
NE_REAL_ARRAY
On entry, f[m]=0.0.
NE_SINGULAR_MATRIX
Singular matrix encountered during iterative refinement.
Please check that your system is well posed.
NE_TOO_MANY_ITER
During iterative refinement, the maximum number of iterations was reached.
Number of iterations=value and residual achieved=value.

7  Accuracy

The accuracy should be close to machine precision for well conditioned boundary value problems.

8  Further Comments

The number of operations is of the order nlogn and the memory requirements are On; thus the computation remains efficient and practical for very fine discretizations (very large values of n). Collocation methods will be faster for small problems, but the method of nag_ode_bvp_ps_lin_solve (d02uec) should be faster for larger discretizations.

9  Example

This example solves the third-order problem 4Uxxx + 3Uxx + 2Ux + U = 2sinx - 2cosx  on -π/2,π/2  subject to the boundary conditions U -π/2 = 0 , 3Uxx -π/2 + 2Ux -π/2 + U -π/2 =2, and 3Uxx π/2 + 2Ux π/2 + U π/2 =-2  using the Chebyshev integration formulation on a Chebyshev Gauss–Lobatto grid of order 16.

9.1  Program Text

Program Text (d02uece.c)

9.2  Program Data

Program Data (d02uece.d)

9.3  Program Results

Program Results (d02uece.r)


nag_ode_bvp_ps_lin_solve (d02uec) (PDF version)
d02 Chapter Contents
d02 Chapter Introduction
NAG C Library Manual

© The Numerical Algorithms Group Ltd, Oxford, UK. 2012