e02bec computes a cubic spline approximation to an arbitrary set of data points. The knots of the spline are located automatically, but a single argument must be specified to control the trade-off between closeness of fit and smoothness of fit.
The function may be called by the names: e02bec, nag_fit_dim1_spline_auto or nag_1d_spline_fit.
e02bec determines a smooth cubic spline approximation to the set of data points , with weights , for .
The spline is given in the B-spline representation
where denotes the normalized cubic B-spline defined upon the knots .
The total number of these knots and their values are chosen automatically by the function. The knots are the interior knots; they divide the approximation interval into sub-intervals. The coefficients are then determined as the solution of the following constrained minimization problem:
subject to the constraint
stands for the discontinuity jump in the third order derivative of at the interior knot ,
denotes the weighted residual ,
is a non-negative number to be specified by you.
The quantity can be seen as a measure of the (lack of) smoothness of , while closeness of fit is measured through . By means of the argument , ‘the smoothing factor’, you can then control the balance between these two (usually conflicting) properties. If is too large, the spline will be too smooth and signal will be lost (underfit); if is too small, the spline will pick up too much noise (overfit). In the extreme cases the function will return an interpolating spline if is set to zero, and the weighted least squares cubic polynomial if is set very large. Experimenting with values between these two extremes should result in a good compromise. (See Section 9.2 for advice on choice of .)
The method employed is outlined in Section 9.3 and fully described in Dierckx (1975), Dierckx (1981) and Dierckx (1982). It involves an adaptive strategy for locating the knots of the cubic spline (depending on the function underlying the data and on the value of ), and an iterative method for solving the constrained minimization problem once the knots have been determined.
Values of the computed spline, or of its derivatives or definite integral, can subsequently be computed by calling e02bbc,e02bccore02bdc, as described in Section 9.4.
Dierckx P (1975) An algorithm for smoothing, differentiating and integration of experimental data using spline functions J. Comput. Appl. Math.1 165–184
Dierckx P (1981) An improved algorithm for curve fitting with spline functions Report TW54 Department of Computer Science, Katholieke Univerciteit Leuven
Dierckx P (1982) A fast algorithm for smoothing data on a rectangular grid while using spline functions SIAM J. Numer. Anal.19 1286–1304
Reinsch C H (1967) Smoothing by spline functions Numer. Math.10 177–183
1: – Nag_StartInput
On entry: must be set to or .
The function will build up the knot set starting with no interior knots. No values need be assigned to the argument , and memory will be allocated internally to , , and .
The function will restart the knot-placing strategy using the knots found in a previous call of the function. In this case, all arguments except s must be unchanged from that previous call. This warm start can save much time in searching for a satisfactory value of the smoothing factor .
2: – IntegerInput
, the number of data points.
3: – const doubleInput
holds the value of the independent variable (abscissa) , for .
4: – const doubleInput
holds the value of the dependent variable (ordinate) , for .
5: – const doubleInput
On entry: the values of the weights, for . For advice on the choice of weights, see Section 2.1.2 in the E02 Chapter Introduction.
, for .
6: – doubleInput
On entry: the smoothing factor, .
If , the function returns an interpolating spline.
If is smaller than machine precision, it is assumed equal to zero.
an overestimate for the number, , of knots required.
. In most practical situations, is sufficient. nest never needs to be larger than , the number of knots needed for interpolation .
8: – double *Output
On exit: the sum of the squared weighted residuals, , of the computed spline approximation. If , this is an interpolating spline. fp should equal within a relative tolerance of unless when the spline has no interior knots and so is simply a cubic polynomial. For knots to be inserted, must be set to a value below the value of fp produced in this case.
9: – Nag_Comm *
Pointer to structure of type Nag_Comm with the following members:
nag_w – double *Input
On entry: if the warm start option is used, the values must be left unchanged from the previous call.
nag_iw – Integer *Input
On entry: if the warm start option is used, the values must be left unchanged from the previous call.
Note that when the information contained in the pointers and is no longer of use, or before a new call to e02bec with the same warmstartinf, you should free this storage using the NAG macro NAG_FREE. This storage will have been allocated only if this function returns with , NE_SPLINE_COEFF_CONV or NE_NUM_KNOTS_1D_GT.
10: – Nag_Spline *
Pointer to structure of type Nag_Spline with the following members:
n – IntegerInput/Output
On entry: if the warm start option is used, the value of must be left unchanged from the previous call.
On exit: the total number, , of knots of the computed spline.
lamda – double *Input/Output
On entry: a pointer to which, if , memory of size nest is internally allocated. If the warm start option is used, the values , , , must be left unchanged from the previous call.
On exit: the knots of the spline, i.e., the positions of the interior knots , , , as well as the positions of the additional knots and needed for the B-spline representation.
c – double *Output
On exit: a pointer to which, if , memory of size is internally allocated. holds the coefficient of the B-spline in the spline approximation , for .
Note that when the information contained in the pointers and is no longer of use, or before a new call to e02bec with the same spline, you should free this storage using the NAG macro NAG_FREE. This storage will have been allocated only if this function returns with , NE_SPLINE_COEFF_CONV, or NE_NUM_KNOTS_1D_GT.
11: – NagError *Input/Output
The NAG error argument (see Section 7 in the Introduction to the NAG Library CL Interface).
The number of knots needed is greater than nest, . If nest is already large, say , this may indicate that possibly s is too small: .
On entry, .
On entry, , , .
Constraint: when .
The iterative process has failed to converge. Possibly s is too small: .
On entry, the weights are not strictly positive: .
If the function fails with an error exit of NE_SPLINE_COEFF_CONV or NE_NUM_KNOTS_1D_GT, a spline approximation is returned, but it fails to satisfy the fitting criterion (see (2) and (3)) – perhaps by only a small amount, however.
On successful exit, the approximation returned is such that its weighted sum of squared residuals (as in (3)) is equal to the smoothing factor , up to a specified relative tolerance of – except that if , may be significantly less than : in this case the computed spline is simply a weighted least squares polynomial approximation of degree , i.e., a spline with no interior knots.
8Parallelism and Performance
e02bec is not threaded in any implementation.
The time taken for a call of e02bec depends on the complexity of the shape of the data, the value of the smoothing factor , and the number of data points. If e02bec is to be called for different values of , much time can be saved by setting after the first call.
9.2Choice of S
If the weights have been correctly chosen (see Section 2.1.2 in the E02 Chapter Introduction), the standard deviation of would be the same for all , equal to , say. In this case, choosing the smoothing factor in the range , as suggested by Reinsch (1967), is likely to give a good start in the search for a satisfactory value. Otherwise, experimenting with different values of will be required from the start, taking account of the remarks in Section 3.
In that case, in view of computation time and memory requirements, it is recommended to start with a very large value for and so determine the least squares cubic polynomial; the value returned in fp, call it , gives an upper bound for . Then progressively decrease the value of to obtain closer fits – say by a factor of in the beginning, i.e., , , and so on, and more carefully as the approximation shows more details.
The number of knots of the spline returned, and their location, generally depend on the value of and on the behaviour of the function underlying the data. However, if e02bec is called with , the knots returned may also depend on the smoothing factors of the previous calls. Therefore if, after a number of trials with different values of and , a fit can finally be accepted as satisfactory, it may be worthwhile to call e02bec once more with the selected value for but now using . Often, e02bec then returns an approximation with the same quality of fit but with fewer knots, which is therefore better if data reduction is also important.
9.3Outline of Method Used
If , the requisite number of knots is known in advance, i.e., ; the interior knots are located immediately as , for . The corresponding least squares spline (see e02bac) is then an interpolating spline and therefore a solution of the problem.
If , a suitable knot set is built up in stages (starting with no interior knots in the case of a cold start but with the knot set found in a previous call if a warm start is chosen). At each stage, a spline is fitted to the data by least squares (see e02bac) and , the weighted sum of squares of residuals, is computed. If , new knots are added to the knot set to reduce at the next stage. The new knots are located in intervals where the fit is particularly poor, their number depending on the value of and on the progress made so far in reducing . Sooner or later, we find that and at that point the knot set is accepted. The function then goes on to compute the (unique) spline which has this knot set and which satisfies the full fitting criterion specified by (2) and (3). The theoretical solution has . The function computes the spline by an iterative scheme which is ended when within a relative tolerance of . The main part of each iteration consists of a linear least squares computation of special form, done in a similarly stable and efficient manner as in e02bac.
An exception occurs when the function finds at the start that, even with no interior knots , the least squares spline already has its weighted sum of squares of residuals . In this case, since this spline (which is simply a cubic polynomial) also has an optimal value for the smoothness measure , namely zero, it is returned at once as the (trivial) solution. It will usually mean that has been chosen too large.
This example reads in a set of data values, followed by a set of values of . For each value of it calls e02bec to compute a spline approximation, and prints the values of the knots and the B-spline coefficients .
The program includes code to evaluate the computed splines, by calls to e02bbc, at the points and at points mid-way between them. These values are not printed out, however; instead the results are illustrated by plots of the computed splines, together with the data points (indicated by ) and the positions of the knots (indicated by vertical lines): the effect of decreasing can be clearly seen.