NAG Library Function Document

nag_ode_bvp_ps_lin_cgl_grid (d02ucc)

1  Purpose

2  Specification

3  Description

4  References

5  Arguments

1:     n – IntegerInput

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: $\mathbf{n}>0$ and n is even.

2:     a – doubleInput

On entry: $a$, the lower bound of domain $\left[a,b\right]$.

Constraint: $\mathbf{a}<\mathbf{b}$.

3:     b – doubleInput

On entry: $b$, the upper bound of domain $\left[a,b\right]$.

Constraint: $\mathbf{b}>\mathbf{a}$.

4:     x[$\mathbf{n}+1$] – doubleOutput

On exit: the Chebyshev Gauss–Lobatto grid points, $x_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n+1$, on $\left[a,b\right]$.

5:     fail – NagError *Input/Output

The NAG error argument (see Section 3.6 in the Essential Introduction).

6  Error Indicators and Warnings

NE_BAD_PARAM

On entry, argument $⟨\mathit{\text{value}}⟩$ had an illegal value.

NE_INT

On entry, $\mathbf{n}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{n}>0$.

On entry, $\mathbf{n}=⟨\mathit{\text{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.

NE_REAL_2

On entry, $\mathbf{a}=⟨\mathit{\text{value}}⟩$ and $\mathbf{b}=⟨\mathit{\text{value}}⟩$.
Constraint: $\mathbf{a}<\mathbf{b}$.

7  Accuracy

8  Parallelism and Performance

9  Further Comments

10  Example