naginterfaces.library.ode.bvp_​coll_​nth

naginterfaces.library.ode.bvp_coll_nth(n, cf, bc, x0, x1, k1, kp, comm, data=None)

bvp_coll_nth solves a regular linear two-point boundary value problem for a single $n$th-order ordinary differential equation by Chebyshev series using collocation and least squares.

For full information please refer to the NAG Library document for d02ja

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/d02/d02jaf.html

Parameters

nint

$n$, the order of the differential equation.

cfcallable retval = cf(j, x, data=None)

$cf$ defines the differential equation (see Notes).

It must return the value of a function $f_j\left(x\right)$ at a given point $x$, where, for $1\le j\le n+1$, $f_j\left(x\right)$ is the coefficient of $y^{(j-1)}\left(x\right)$ in the equation, and $f_0\left(x\right)$ is the right-hand side.

Parameters

jint

The index of the function $f_j$ to be evaluated.

xfloat

The point at which $f_j$ is to be evaluated.

dataarbitrary, optional, modifiable in place

User-communication data for callback functions.

Returns

retvalfloat

The value of $f_j\left(x\right)$ at the given point $x$.

bccallable (j, rhs) = bc(i, data=None)

$bc$ defines the boundary conditions, each of which has the form $y^{(k-1)}\left(x_1\right)=s_k$ or $y^{(k-1)}\left(x_0\right)=s_k$.

The boundary conditions may be specified in any order.

Parameters

iint

The index of the boundary condition to be defined.

dataarbitrary, optional, modifiable in place

User-communication data for callback functions.

Returns

jint

Must be set to $-k$ if the boundary condition is $y^{(k-1)}\left(x_0\right)=s_k$, and to $+k$ if it is $y^{(k-1)}\left(x_1\right)=s_k$.

$j$ must not be set to the same value $k$ for two different values of $i$.

rhsfloat

Must be set to the value $s_k$.

x0float

The left- and right-hand boundaries, $x_0$ and $x_1$, respectively.

x1float

The left- and right-hand boundaries, $x_0$ and $x_1$, respectively.

k1int

The number of coefficients to be returned in the Chebyshev series representation of the solution (hence the degree of the polynomial approximation is $k1-1$).

kpint

The number of collocation points to be used.

commdict, communication object, modified in place

Communication structure.

On initial entry: need not be set.

dataarbitrary, optional

User-communication data for callback functions.

Returns

cfloat, ndarray, shape $\left(k1\right)$

The computed Chebyshev coefficients; that is, the computed solution is:

$${\sum ^{\prime }}_{i=1}^{k1}c[i-1]T_{i-1}\left(x\right)$$

where $T_i\left(x\right)$ is the $i$th Chebyshev polynomial of the first kind, and ${\sum }^{\prime }$ denotes that the first coefficient, $c\left[0\right]$, is halved.

Raises

NagValueError

(errno $1$)

On entry, $kp=⟨value⟩$, $n=⟨value⟩$ and $k1=⟨value⟩$.

Constraint: $kp+n\ge k1$.

(errno $1$)

On entry, $k1=⟨value⟩$ and $n=⟨value⟩$.

Constraint: $k1\ge n+1$.

(errno $1$)

On entry, $x1=⟨value⟩$ and $x0=⟨value⟩$.

Constraint: $x1>x0$.

(errno $1$)

On entry, $n=⟨value⟩$.

Constraint: $n\ge 1$.

(errno $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.

(errno $4$)

Iterative refinement in the least squares solution has failed to converge. The coefficient matrix is too ill-conditioned.

Notes

No equivalent traditional C interface for this routine exists in the NAG Library.

bvp_coll_nth calculates the solution of a regular two-point boundary value problem for a single $n$th-order linear ordinary differential equation as a Chebyshev series in the interval $(x_0,x_1)$. The differential equation

$$f_{n+1}\left(x\right)y^{\left(n\right)}\left(x\right)+f_n\left(x\right)y^{(n-1)}\left(x\right)+\cdots +f_1\left(x\right)y\left(x\right)=f_0\left(x\right)$$

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, $k1-1$, and the number of collocation points, $kp$. The function sets up a system of linear equations for the Chebyshev coefficients, one equation 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 of the differential equation on an interval normalized to $(-1,1)$.

fit.dim1_cheb_eval2 can be used to evaluate the solution at any point on the interval $(x_0,x_1)$. fit.dim1_cheb_deriv followed by fit.dim1_cheb_eval2 can be used to evaluate its derivatives.

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