naginterfaces.library.fit.dim1_​spline_​knots

naginterfaces.library.fit.dim1_spline_knots(x, y, w, lamda)

dim1_spline_knots computes a weighted least squares approximation to an arbitrary set of data points by a cubic spline with knots prescribed by you. Cubic spline interpolation can also be carried out.

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

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

Parameters

xfloat, array-like, shape $\left(m\right)$

The values $x_{\text{r}}$ of the independent variable (abscissa), for $\text{r}=1,2,\dots ,m$. The values must satisfy the Schoenberg–Whitney conditions (see Further Comments).

yfloat, array-like, shape $\left(m\right)$

The values $y_{\text{r}}$ of the dependent variable (ordinate), for $\text{r}=1,2,\dots ,m$.

wfloat, array-like, shape $\left(m\right)$

The values $w_{\text{r}}$ of the weights, for $\text{r}=1,2,\dots ,m$. For advice on the choice of weights, see the E02 Introduction.

lamdafloat, array-like, shape $\left(\text{ncap7}\right)$

$lamda[\text{i}-1]$ must be set to the $(\text{i}-4)$th (interior) knot, ${\lambda }_{\text{i}}$, for $\text{i}=5,6,\dots ,\overline{n}+3$.

Returns

lamdafloat, ndarray, shape $\left(\text{ncap7}\right)$

The input values are unchanged, and $lamda[\text{i}-1]$, for $\text{i}=1,2,\dots ,4$, $\text{ncap7}-3$, $\text{ncap7}-2$, $\text{ncap7}-1$, $\text{ncap7}$ contains the additional (exterior) knots introduced by the function. For advice on the choice of knots, see the E02 Introduction.

cfloat, ndarray, shape $\left(\text{ncap7}\right)$

The coefficient $c_{\text{i}}$ of the B-spline $N_{\text{i}}\left(x\right)$, for $\text{i}=1,2,\dots ,\overline{n}+3$. The remaining elements of the array are not used.

ssfloat

The residual sum of squares, $\theta$.

Raises

NagValueError

(errno $1$)

On entry, $\text{J}=⟨value⟩$, $lamda[\text{J}-1]=⟨value⟩$ and $lamda\left[\text{J}\right]=⟨value⟩$.

Constraint: $lamda[\text{J}-1]\le lamda\left[\text{J}\right]$.

(errno $1$)

On entry, $\text{ncap7}=⟨value⟩$, $lamda[\text{ncap7}-5]=⟨value⟩$, $m=⟨value⟩$ and $x[m-1]=⟨value⟩$.

Constraint: $lamda[\text{ncap7}-5]<x[m-1]$.

(errno $1$)

On entry, $lamda\left[4\right]=⟨value⟩$ and $x\left[0\right]=⟨value⟩$.

Constraint: $lamda\left[4\right]>x\left[0\right]$.

(errno $2$)

On entry, $\text{i}=⟨value⟩$ and $w[\text{i}-1]=⟨value⟩$.

Constraint: $w[\text{i}-1]>0.0$.

(errno $3$)

On entry, the $x$ values are not in nondecreasing order. $\text{I}=⟨value⟩$, $x[\text{I}-1]=⟨value⟩$, $\text{J}=⟨value⟩$ and $\text{xdist}[\text{J}-1]=⟨value⟩$.

Constraint: $x[\text{I}-1]\ge \text{xdist}[\text{J}-1]$, where xdist is the set of distinct $x$-values.

(errno $4$)

On entry, $\text{ncap7}=⟨value⟩$ and $\text{mdist}=⟨value⟩$.

Constraint: $\text{ncap7}\le \text{mdist}+4$, where mdist is the number of distinct x-values.

(errno $4$)

On entry, $\text{ncap7}=⟨value⟩$ and $m=⟨value⟩$.

Constraint: $\text{ncap7}\le m+4$.

(errno $4$)

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

Constraint: $\text{ncap7}\ge 8$.

(errno $5$)

On entry, the Schoenberg–Whitney conditions fail to hold for at least one subset of the distinct data abscissae. $\text{I}=⟨value⟩$, $\text{xdist}[\text{I}-1]=⟨value⟩$, $\text{J}=⟨value⟩$ and $lamda[\text{J}-1]=⟨value⟩$.

Constraint: $\text{xdist}[\text{I}-1]<lamda[\text{J}-1]$, where xdist is the set of distinct $x$-values.

(errno $5$)

On entry, the Schoenberg–Whitney conditions fail to hold for at least one subset of the distinct data abscissae. $L=⟨value⟩$, $\text{xdist}[L-1]=⟨value⟩$, $\text{I}=⟨value⟩$ and $lamda[\text{I}-1]=⟨value⟩$.

Constraint: $\text{xdist}[\text{L}-1]>lamda[\text{I}-1]$, where xdist is the set of distinct $x$-values.

(errno $5$)

On entry, the Schoenberg–Whitney conditions fail to hold for at least one subset of the distinct data abscissae. $\text{J}=⟨value⟩$, $\text{xdist}[\text{J}-1]=⟨value⟩$, $\text{J}+4=⟨value⟩$ and $lamda[\text{J}+3]=⟨value⟩$.

Constraint: $\text{xdist}[\text{J}-1]<lamda[\text{J}+3]$, where xdist is the set of distinct $x$-values.

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_spline_knots determines a least squares cubic spline approximation $s\left(x\right)$ to the set of data points $(x_{\text{r}},y_{\text{r}})$ with weights $w_{\text{r}}$, for $\text{r}=1,2,\dots ,m$. The value of $\text{ncap7}=\overline{n}+7$, where $\overline{n}$ is the number of intervals of the spline (one greater than the number of interior knots), and the values of the knots ${\lambda }_5,{\lambda }_6,\dots ,{\lambda }_{\overline{n}+3}$, interior to the data interval, are prescribed by you.

$s\left(x\right)$ has the property that it minimizes $\theta$, the sum of squares of the weighted residuals ${ϵ}_{\text{r}}$, for $\text{r}=1,2,\dots ,m$, where

$${ϵ}_r=w_r(y_r-s\left(x_r\right))\text{.}$$

The function produces this minimizing value of $\theta$ and the coefficients $c_1,c_2,\dots ,c_q$, where $q=\overline{n}+3$, in the B-spline representation

$$s\left(x\right)=\sum _{i=1}^q{c}_i{N}_i\left(x\right)\text{.}$$

Here $N_i\left(x\right)$ denotes the normalized B-spline of degree $3$ defined upon the knots ${\lambda }_i,{\lambda }_{i+1},\dots ,{\lambda }_{i+4}$.

In order to define the full set of B-splines required, eight additional knots ${\lambda }_1,{\lambda }_2,{\lambda }_3,{\lambda }_4$ and ${\lambda }_{\overline{n}+4},{\lambda }_{\overline{n}+5},{\lambda }_{\overline{n}+6},{\lambda }_{\overline{n}+7}$ are inserted automatically by the function. The first four of these are set equal to the smallest $x_r$ and the last four to the largest $x_r$.

The representation of $s\left(x\right)$ in terms of B-splines is the most compact form possible in that only $\overline{n}+3$ coefficients, in addition to the $\overline{n}+7$ knots, fully define $s\left(x\right)$.

The method employed involves forming and then computing the least squares solution of a set of $m$ linear equations in the coefficients $c_{\text{i}}$, for $\text{i}=1,2,\dots ,\overline{n}+3$. The equations are formed using a recurrence relation for B-splines that is unconditionally stable (see Cox (1972) and de Boor (1972)), even for multiple (coincident) knots. The least squares solution is also obtained in a stable manner by using orthogonal transformations, viz. a variant of Givens rotations (see Gentleman (1974) and Gentleman (1973)). This requires only one equation to be stored at a time. Full advantage is taken of the structure of the equations, there being at most four nonzero values of $N_i\left(x\right)$ for any value of $x$ and hence at most four coefficients in each equation.

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

Subsequent evaluation of $s\left(x\right)$ from its B-spline representation may be carried out using dim1_spline_eval(). If derivatives of $s\left(x\right)$ are also required, dim1_spline_deriv() may be used. dim1_spline_integ() can be used to compute the definite integral of $s\left(x\right)$.

References

Cox, M G, 1972, The numerical evaluation of B-splines, J. Inst. Math. Appl. (10), 134–149

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, 1975, Numerical methods for the interpolation and approximation of data by spline functions, PhD Thesis, City University, London

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

de Boor, C, 1972, On calculating with B-splines, J. Approx. Theory (6), 50–62

Gentleman, W M, 1973, Least squares computations by Givens transformations without square roots, J. Inst. Math. Applic. (12), 329–336

Gentleman, W M, 1974, Algorithm AS 75. Basic procedures for large sparse or weighted linear least squares problems, Appl. Statist. (23), 448–454

Schoenberg, I J and Whitney, A, 1953, On Polya frequency functions III, Trans. Amer. Math. Soc. (74), 246–259