NAG CL Interface
d02ucc (bvp_​ps_​lin_​cgl_​grid)

1 Purpose

d02ucc returns the Chebyshev Gauss–Lobatto grid points on a,b.

2 Specification

#include <nag.h>
void  d02ucc (Integer n, double a, double b, double x[], NagError *fail)
The function may be called by the names: d02ucc or nag_ode_bvp_ps_lin_cgl_grid.

3 Description

d02ucc returns the Chebyshev Gauss–Lobatto grid points on a,b. The Chebyshev Gauss–Lobatto points on -1,1 are computed as ti = - cos i-1π n , for i=1,2,,n+1. The Chebyshev Gauss–Lobatto points on an arbitrary domain a,b are:
xi = b-a 2 ti + a+b 2 ,   i=1,2,,n+1 .  

4 References

Trefethen L N (2000) Spectral Methods in MATLAB SIAM

5 Arguments

1: n Integer Input
On entry: n, where the number of grid points is n+1. This is also the largest order of Chebyshev polynomial in the Chebyshev series to be computed.
Constraint: n>0 and n is even.
2: a double Input
On entry: a, the lower bound of domain a,b.
Constraint: a<b.
3: b double Input
On entry: b, the upper bound of domain a,b.
Constraint: b>a.
4: x[n+1] double Output
On exit: the Chebyshev Gauss–Lobatto grid points, xi, for i=1,2,,n+1, on a,b.
5: fail NagError * Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).

6 Error Indicators and Warnings

NE_ALLOC_FAIL
Dynamic memory allocation failed.
See Section 3.1.2 in the Introduction to the NAG Library CL Interface for further information.
NE_BAD_PARAM
On entry, argument value had an illegal value.
NE_INT
On entry, n=value.
Constraint: n>0.
On entry, n=value.
Constraint: n is even.
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.
See Section 7.5 in the Introduction to the NAG Library CL Interface for further information.
NE_NO_LICENCE
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library CL Interface for further information.
NE_REAL_2
On entry, a=value and b=value.
Constraint: a<b.

7 Accuracy

The Chebyshev Gauss–Lobatto grid points computed should be accurate to within a small multiple of machine precision.

8 Parallelism and Performance

d02ucc is not threaded in any implementation.

9 Further Comments

The number of operations is of the order n logn and there are no internal memory requirements; thus the computation remains efficient and practical for very fine discretizations (very large values of n).

10 Example

See Section 10 in d02uec.