naginterfaces.library.fit.dim1_​cheb_​eval

naginterfaces.library.fit.dim1_cheb_eval(a, xcap)

dim1_cheb_eval evaluates a polynomial from its Chebyshev series representation.

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

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/e02/e02aef.html

Parameters

afloat, array-like, shape $\left(\text{nplus1}\right)$

$a[\text{i}-1]$ must be set to the value of the $\text{i}$th coefficient in the series, for $\text{i}=1,2,\dots ,n+1$.

xcapfloat

$\overline{x}$, the argument at which the polynomial is to be evaluated. It should lie in the range $-1$ to $+1$, but a value just outside this range is permitted (see Exceptions) to allow for possible rounding errors committed in the transformation from $x$ to $\overline{x}$ discussed in Notes. Provided the recommended form of the transformation is used, a successful exit is thus assured whenever the value of $x$ lies in the range $x_{min}$ to $x_{max}$.

Returns

pfloat

The value of the polynomial.

Raises

NagValueError

(errno $1$)

On entry, $xcap=⟨value⟩$ and $EPS=⟨value⟩$.

Constraint: $\left|xcap\right|\le 1+4\times EPS$, where $EPS$ is machine precision.

(errno $2$)

On entry, $\text{nplus1}=⟨value⟩$.

Constraint: $\text{nplus1}\ge 1$.

Notes

In the NAG Library the traditional C interface for this routine uses a different algorithmic base. Please contact NAG if you have any questions about compatibility.

dim1_cheb_eval evaluates the polynomial

$$\frac{1}{2}{a}_1{T}_0\left(\overline{x}\right)+a_2{T}_1\left(\overline{x}\right)+a_3{T}_2\left(\overline{x}\right)+\cdots +a_{n+1}{T}_n\left(\overline{x}\right)$$

for any value of $\overline{x}$ satisfying $-1\le \overline{x}\le 1$. Here $T_j\left(\overline{x}\right)$ denotes the Chebyshev polynomial of the first kind of degree $j$ with argument $\overline{x}$. The value of $n$ is prescribed by you.

In practice, the variable $\overline{x}$ will usually have been obtained from an original variable $x$, where $x_{min}\le x\le x_{max}$ and

$$\overline{x}=\frac{((x-x_{min})-(x_{max}-x))}{(x_{max}-x_{min})}$$

Note that this form of the transformation should be used computationally rather than the mathematical equivalent

$$\overline{x}=\frac{(2x-x_{min}-x_{max})}{(x_{max}-x_{min})}$$

since the former guarantees that the computed value of $\overline{x}$ differs from its true value by at most $4ϵ$, where $ϵ$ is the machine precision, whereas the latter has no such guarantee.

The method employed is based on the three-term recurrence relation due to Clenshaw (1955), with modifications to give greater numerical stability due to Reinsch and Gentleman (see Gentleman (1969)).

For further details of the algorithm and its use see Cox (1974) and Cox and Hayes (1973).

References

Clenshaw, C W, 1955, A note on the summation of Chebyshev series, Math. Tables Aids Comput. (9), 118–120

Cox, M G, 1974, A data-fitting package for the non-specialist user, Software for Numerical Mathematics, (ed D J Evans), Academic Press

Cox, M G and Hayes, J G, 1973, Curve fitting: a guide and suite of algorithms for the non-specialist user, NPL Report NAC26, National Physical Laboratory

Gentleman, W M, 1969, An error analysis of Goertzel’s (Watt’s) method for computing Fourier coefficients, Comput. J. (12), 160–165