# NAG FL Interfacee02dcf (dim2_​spline_​grid)

## 1Purpose

e02dcf computes a bicubic spline approximation to a set of data values, given on a rectangular grid in the $x$-$y$ plane. 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.

## 2Specification

Fortran Interface
 Subroutine e02dcf ( mx, x, my, y, f, s, nx, ny, mu, c, fp, wrk, lwrk, iwrk,
 Integer, Intent (In) :: mx, my, nxest, nyest, lwrk, liwrk Integer, Intent (Inout) :: nx, ny, iwrk(liwrk), ifail Real (Kind=nag_wp), Intent (In) :: x(mx), y(my), f(mx*my), s Real (Kind=nag_wp), Intent (Inout) :: lamda(nxest), mu(nyest), wrk(lwrk) Real (Kind=nag_wp), Intent (Out) :: c((nxest-4)*(nyest-4)), fp Character (1), Intent (In) :: start
#include <nag.h>
 void e02dcf_ (const char *start, const Integer *mx, const double x[], const Integer *my, const double y[], const double f[], const double *s, const Integer *nxest, const Integer *nyest, Integer *nx, double lamda[], Integer *ny, double mu[], double c[], double *fp, double wrk[], const Integer *lwrk, Integer iwrk[], const Integer *liwrk, Integer *ifail, const Charlen length_start)
The routine may be called by the names e02dcf or nagf_fit_dim2_spline_grid.

## 3Description

e02dcf determines a smooth bicubic spline approximation $s\left(x,y\right)$ to the set of data points $\left({x}_{\mathit{q}},{y}_{\mathit{r}},{f}_{\mathit{q},\mathit{r}}\right)$, for $\mathit{q}=1,2,\dots ,{m}_{x}$ and $\mathit{r}=1,2,\dots ,{m}_{y}$.
The spline is given in the B-spline representation
 $sx,y = ∑ i=1 nx-4 ∑ j=1 ny-4 cij Mix Njy ,$ (1)
where ${M}_{i}\left(x\right)$ and ${N}_{j}\left(y\right)$ denote normalized cubic B-splines, the former defined on the knots ${\lambda }_{i}$ to ${\lambda }_{i+4}$ and the latter on the knots ${\mu }_{j}$ to ${\mu }_{j+4}$. For further details, see Hayes and Halliday (1974) for bicubic splines and de Boor (1972) for normalized B-splines.
The total numbers ${n}_{x}$ and ${n}_{y}$ of these knots and their values ${\lambda }_{1},\dots ,{\lambda }_{{n}_{x}}$ and ${\mu }_{1},\dots ,{\mu }_{{n}_{y}}$ are chosen automatically by the routine. The knots ${\lambda }_{5},\dots ,{\lambda }_{{n}_{x}-4}$ and ${\mu }_{5},\dots ,{\mu }_{{n}_{y}-4}$ are the interior knots; they divide the approximation domain $\left[{x}_{1},{x}_{{m}_{x}}\right]×\left[{y}_{1},{y}_{{m}_{y}}\right]$ into $\left({n}_{x}-7\right)×\left({n}_{y}-7\right)$ subpanels $\left[{\lambda }_{\mathit{i}},{\lambda }_{\mathit{i}+1}\right]×\left[{\mu }_{\mathit{j}},{\mu }_{\mathit{j}+1}\right]$, for $\mathit{i}=4,5,\dots ,{n}_{x}-4$ and $\mathit{j}=4,5,\dots ,{n}_{y}-4$. Then, much as in the curve case (see e02bef), the coefficients ${c}_{\mathit{i}\mathit{j}}$ are determined as the solution of the following constrained minimization problem:
 $minimize⁡η ,$ (2)
subject to the constraint
 $θ = ∑ q=1 mx ∑ r=1 my ε q,r 2 ≤ S ,$ (3)
 where $\eta$ is a measure of the (lack of) smoothness of $s\left(x,y\right)$. Its value depends on the discontinuity jumps in $s\left(x,y\right)$ across the boundaries of the subpanels. It is zero only when there are no discontinuities and is positive otherwise, increasing with the size of the jumps (see Dierckx (1982) for details). ${\epsilon }_{q,r}$ denotes the residual ${f}_{q,r}-s\left({x}_{q},{y}_{r}\right)$, and $S$ is a non-negative number specified by you.
By means of the argument $S$, ‘the smoothing factor’, you will then control the balance between smoothness and closeness of fit, as measured by the sum of squares of residuals in (3). If $S$ is too large, the spline will be too smooth and signal will be lost (underfit); if $S$ is too small, the spline will pick up too much noise (overfit). In the extreme cases the routine will return an interpolating spline $\left(\theta =0\right)$ if $S$ is set to zero, and the least squares bicubic polynomial $\left(\eta =0\right)$ if $S$ is set very large. Experimenting with $S$-values between these two extremes should result in a good compromise. (See Section 9.3 for advice on choice of $S$.)
The method employed is outlined in Section 9.5 and fully described in Dierckx (1981) and Dierckx (1982). It involves an adaptive strategy for locating the knots of the bicubic spline (depending on the function underlying the data and on the value of $S$), and an iterative method for solving the constrained minimization problem once the knots have been determined.
Values and derivatives of the computed spline can subsequently be computed by calling e02def, e02dff or e02dhf as described in Section 9.6.

## 4References

de Boor C (1972) On calculating with B-splines J. Approx. Theory 6 50–62
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
Hayes J G and Halliday J (1974) The least squares fitting of cubic spline surfaces to general data sets J. Inst. Math. Appl. 14 89–103
Reinsch C H (1967) Smoothing by spline functions Numer. Math. 10 177–183

## 5Arguments

1: $\mathbf{start}$Character(1) Input
On entry: determines whether calculations are to be performed afresh (Cold Start) or whether knots found in previous calls are to be used as an initial estimate of knot placement (Warm Start).
${\mathbf{start}}=\text{'C'}$
The routine will build up the knot set starting with no interior knots. No values need be assigned to the arguments nx, ny, lamda, mu, wrk or iwrk.
${\mathbf{start}}=\text{'W'}$
The routine will restart the knot-placing strategy using the knots found in a previous call of the routine. In this case, the arguments nx, ny, lamda, mu, wrk and iwrk must be unchanged from that previous call. This warm start can save much time in determining a satisfactory set of knots for the given value of s. This is particularly useful when different smoothing factors are used for the same dataset.
Constraint: ${\mathbf{start}}=\text{'C'}$ or $\text{'W'}$.
2: $\mathbf{mx}$Integer Input
On entry: ${m}_{x}$, the number of grid points along the $x$ axis.
Constraint: ${\mathbf{mx}}\ge 4$.
3: $\mathbf{x}\left({\mathbf{mx}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{x}}\left(\mathit{q}\right)$ must be set to ${x}_{\mathit{q}}$, the $x$ coordinate of the $\mathit{q}$th grid point along the $x$ axis, for $\mathit{q}=1,2,\dots ,{m}_{x}$.
Constraint: ${x}_{1}<{x}_{2}<\cdots <{x}_{{m}_{x}}$.
4: $\mathbf{my}$Integer Input
On entry: ${m}_{y}$, the number of grid points along the $y$ axis.
Constraint: ${\mathbf{my}}\ge 4$.
5: $\mathbf{y}\left({\mathbf{my}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{y}}\left(\mathit{r}\right)$ must be set to ${y}_{\mathit{r}}$, the $y$ coordinate of the $\mathit{r}$th grid point along the $y$ axis, for $\mathit{r}=1,2,\dots ,{m}_{y}$.
Constraint: ${y}_{1}<{y}_{2}<\cdots <{y}_{{m}_{y}}$.
6: $\mathbf{f}\left({\mathbf{mx}}×{\mathbf{my}}\right)$Real (Kind=nag_wp) array Input
On entry: ${\mathbf{f}}\left({m}_{y}×\left(\mathit{q}-1\right)+\mathit{r}\right)$ must contain the data value ${f}_{\mathit{q},\mathit{r}}$, for $\mathit{q}=1,2,\dots ,{m}_{x}$ and $\mathit{r}=1,2,\dots ,{m}_{y}$.
7: $\mathbf{s}$Real (Kind=nag_wp) Input
On entry: the smoothing factor, $S$.
If ${\mathbf{s}}=0.0$, the routine returns an interpolating spline.
If s is smaller than machine precision, it is assumed equal to zero.
For advice on the choice of s, see Sections 3 and 9.3.
Constraint: ${\mathbf{s}}\ge 0.0$.
8: $\mathbf{nxest}$Integer Input
9: $\mathbf{nyest}$Integer Input
On entry: an upper bound for the number of knots ${n}_{x}$ and ${n}_{y}$ required in the $x$- and $y$-directions respectively.
In most practical situations, ${\mathbf{nxest}}={m}_{x}/2$ and ${\mathbf{nyest}}={m}_{y}/2$ is sufficient. nxest and nyest never need to be larger than ${m}_{x}+4$ and ${m}_{y}+4$ respectively, the numbers of knots needed for interpolation $\left({\mathbf{s}}=0.0\right)$. See also Section 9.4.
Constraints:
• ${\mathbf{nxest}}\ge 8$;
• ${\mathbf{nyest}}\ge 8$.
10: $\mathbf{nx}$Integer Input/Output
On entry: if the warm start option is used, the value of nx must be left unchanged from the previous call.
On exit: the total number of knots, ${n}_{x}$, of the computed spline with respect to the $x$ variable.
11: $\mathbf{lamda}\left({\mathbf{nxest}}\right)$Real (Kind=nag_wp) array Input/Output
On entry: if the warm start option is used, the values ${\mathbf{lamda}}\left(1\right),{\mathbf{lamda}}\left(2\right),\dots ,{\mathbf{lamda}}\left({\mathbf{nx}}\right)$ must be left unchanged from the previous call.
On exit: contains the complete set of knots ${\lambda }_{i}$ associated with the $x$ variable, i.e., the interior knots ${\mathbf{lamda}}\left(5\right),{\mathbf{lamda}}\left(6\right),\dots ,{\mathbf{lamda}}\left({\mathbf{nx}}-4\right)$ as well as the additional knots
 $lamda1=lamda2=lamda3=lamda4=x1$
and
 $lamdanx- 3=lamdanx- 2=lamdanx- 1=lamdanx=xmx$
needed for the B-spline representation.
12: $\mathbf{ny}$Integer Input/Output
On entry: if the warm start option is used, the value of ny must be left unchanged from the previous call.
On exit: the total number of knots, ${n}_{y}$, of the computed spline with respect to the $y$ variable.
13: $\mathbf{mu}\left({\mathbf{nyest}}\right)$Real (Kind=nag_wp) array Input/Output
On entry: if the warm start option is used, the values ${\mathbf{mu}}\left(1\right),{\mathbf{mu}}\left(2\right),\dots ,{\mathbf{mu}}\left({\mathbf{ny}}\right)$ must be left unchanged from the previous call.
On exit: contains the complete set of knots ${\mu }_{i}$ associated with the $y$ variable, i.e., the interior knots ${\mathbf{mu}}\left(5\right),{\mathbf{mu}}\left(6\right),\dots ,{\mathbf{mu}}\left({\mathbf{ny}}-4\right)$ as well as the additional knots
 $mu1=mu2=mu3=mu4=y1$
and
 $muny- 3=muny- 2=muny- 1=muny=ymy$
needed for the B-spline representation.
14: $\mathbf{c}\left(\left({\mathbf{nxest}}-4\right)×\left({\mathbf{nyest}}-4\right)\right)$Real (Kind=nag_wp) array Output
On exit: the coefficients of the spline approximation. ${\mathbf{c}}\left(\left({n}_{y}-4\right)×\left(i-1\right)+j\right)$ is the coefficient ${c}_{ij}$ defined in Section 3.
15: $\mathbf{fp}$Real (Kind=nag_wp) Output
On exit: the sum of squared residuals, $\theta$, of the computed spline approximation. If ${\mathbf{fp}}=0.0$, this is an interpolating spline. fp should equal ${\mathbf{s}}$ within a relative tolerance of $0.001$ unless ${\mathbf{nx}}={\mathbf{ny}}=8$, when the spline has no interior knots and so is simply a bicubic polynomial. For knots to be inserted, s must be set to a value below the value of fp produced in this case.
16: $\mathbf{wrk}\left({\mathbf{lwrk}}\right)$Real (Kind=nag_wp) array Communication Array
If the warm start option is used, on entry, the values ${\mathbf{wrk}}\left(1\right),\dots ,{\mathbf{wrk}}\left(4\right)$ must be left unchanged from the previous call.
This array is used as workspace.
17: $\mathbf{lwrk}$Integer Input
On entry: the dimension of the array wrk as declared in the (sub)program from which e02dcf is called.
Constraint: ${\mathbf{lwrk}}\ge 4×\left({\mathbf{mx}}+{\mathbf{my}}\right)+11×\left({\mathbf{nxest}}+{\mathbf{nyest}}\right)+{\mathbf{nxest}}×{\mathbf{my}}+\phantom{\rule{0ex}{0ex}}\mathrm{max}\phantom{\rule{0.125em}{0ex}}\left({\mathbf{my}},{\mathbf{nxest}}\right)+54$.
18: $\mathbf{iwrk}\left({\mathbf{liwrk}}\right)$Integer array Communication Array
If the warm start option is used, on entry, the values ${\mathbf{iwrk}}\left(1\right),\dots ,{\mathbf{iwrk}}\left(3\right)$ must be left unchanged from the previous call.
This array is used as workspace.
19: $\mathbf{liwrk}$Integer Input
On entry: the dimension of the array iwrk as declared in the (sub)program from which e02dcf is called.
Constraint: ${\mathbf{liwrk}}\ge 3+{\mathbf{mx}}+{\mathbf{my}}+{\mathbf{nxest}}+{\mathbf{nyest}}$.
20: $\mathbf{ifail}$Integer Input/Output
On entry: ifail must be set to $0$, $-1$ or $1$ to set behaviour on detection of an error; these values have no effect when no error is detected.
A value of $0$ causes the printing of an error message and program execution will be halted; otherwise program execution continues. A value of $-1$ means that an error message is printed while a value of $1$ means that it is not.
If halting is not appropriate, the value $-1$ or $1$ is recommended. If message printing is undesirable, then the value $1$ is recommended. Otherwise, the value $0$ is recommended. When the value $-\mathbf{1}$ or $\mathbf{1}$ is used it is essential to test the value of ifail on exit.
On exit: ${\mathbf{ifail}}={\mathbf{0}}$ unless the routine detects an error or a warning has been flagged (see Section 6).

## 6Error Indicators and Warnings

If on entry ${\mathbf{ifail}}=0$ or $-1$, explanatory error messages are output on the current error message unit (as defined by x04aaf).
Errors or warnings detected by the routine:
${\mathbf{ifail}}=1$
On entry, ${\mathbf{liwrk}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{liwrk}}\ge 〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{lwrk}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{lwrk}}\ge 〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{mx}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{mx}}\ge 〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{my}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{my}}\ge 〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{nxest}}=〈\mathit{\text{value}}〉$, ${\mathbf{mx}}=〈\mathit{\text{value}}〉$, ${\mathbf{nyest}}=〈\mathit{\text{value}}〉$ and ${\mathbf{my}}=〈\mathit{\text{value}}〉$.
Constraint: if ${\mathbf{s}}=0.0$, ${\mathbf{nxest}}\ge {\mathbf{mx}}+4$ and ${\mathbf{nyest}}\ge {\mathbf{my}}+4$.
On entry, ${\mathbf{nxest}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nxest}}\ge 〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{nyest}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{nyest}}\ge 〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{s}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{s}}\ge 0.0$.
On entry, ${\mathbf{start}}\ne \text{'W'}$ or $\text{'C'}$: ${\mathbf{start}}=〈\mathit{\text{value}}〉$.
${\mathbf{ifail}}=2$
On entry, $q=〈\mathit{\text{value}}〉$, ${\mathbf{x}}\left(q-1\right)=〈\mathit{\text{value}}〉$ and ${\mathbf{x}}\left(q\right)=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{x}}\left(q-1\right)<{\mathbf{x}}\left(q\right)$ for all $q$.
${\mathbf{ifail}}=3$
On entry, $r=〈\mathit{\text{value}}〉$, ${\mathbf{y}}\left(r-1\right)=〈\mathit{\text{value}}〉$ and ${\mathbf{y}}\left(r\right)=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{y}}\left(r-1\right)<{\mathbf{y}}\left(r\right)$ for all $r$.
${\mathbf{ifail}}=4$
The number of knots needed in one direction is greater than nxest or nyest: nxest, ${\mathbf{nyest}}=〈\mathit{\text{value}}〉,〈\mathit{\text{value}}〉$. Possibly s is too small: ${\mathbf{s}}=〈\mathit{\text{value}}〉$.
${\mathbf{ifail}}=5$
The iterative process has failed to converge. Possibly s is too small: ${\mathbf{s}}=〈\mathit{\text{value}}〉$.
${\mathbf{ifail}}=-99$
See Section 7 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-399$
Your licence key may have expired or may not have been installed correctly.
See Section 8 in the Introduction to the NAG Library FL Interface for further information.
${\mathbf{ifail}}=-999$
Dynamic memory allocation failed.
See Section 9 in the Introduction to the NAG Library FL Interface for further information.

## 7Accuracy

On successful exit, the approximation returned is such that its sum of squared residuals fp is equal to the smoothing factor ${\mathbf{s}}$, up to a specified relative tolerance of $0.001$ – except that if ${n}_{x}=8$ and ${n}_{y}=8$, fp may be significantly less than ${\mathbf{s}}$: in this case the computed spline is simply the least squares bicubic polynomial approximation of degree $3$, i.e., a spline with no interior knots.

## 8Parallelism and Performance

e02dcf makes calls to BLAS and/or LAPACK routines, which may be threaded within the vendor library used by this implementation. Consult the documentation for the vendor library for further information.
Please consult the X06 Chapter Introduction for information on how to control and interrogate the OpenMP environment used within this routine. Please also consult the Users' Note for your implementation for any additional implementation-specific information.

### 9.1Timing

The time taken for a call of e02dcf depends on the complexity of the shape of the data, the value of the smoothing factor $S$, and the number of data points. If e02dcf is to be called for different values of $S$, much time can be saved by setting ${\mathbf{start}}=\text{'W'}$ after the first call.

### 9.2Weighting of Data Points

e02dcf does not allow individual weighting of the data values. If these were determined to widely differing accuracies, it may be better to use e02ddf. The computation time would be very much longer, however.

### 9.3Choice of s

If the standard deviation of ${f}_{q,r}$ is the same for all $q$ and $r$ (the case for which e02dcf is designed – see Section 9.2.) and known to be equal, at least approximately, to $\sigma$, say, then following Reinsch (1967) and choosing the argument s in the range ${\sigma }^{2}\left(m±\sqrt{2m}\right)$, where $m={m}_{x}{m}_{y}$, is likely to give a good start in the search for a satisfactory value. If the standard deviations vary, the sum of their squares over all the data points could be used. Otherwise experimenting with different values of s 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 s and so determine the least squares bicubic polynomial; the value returned for fp, call it ${{\mathbf{fp}}}_{0}$, gives an upper bound for s. Then progressively decrease the value of s to obtain closer fits – say by a factor of $10$ in the beginning, i.e., ${\mathbf{s}}={{\mathbf{fp}}}_{0}/10$, ${\mathbf{s}}={{\mathbf{fp}}}_{0}/100$, 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 ${\mathbf{s}}$ and on the behaviour of the function underlying the data. However, if e02dcf is called with ${\mathbf{start}}=\text{'W'}$, 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 ${\mathbf{s}}$ and ${\mathbf{start}}=\text{'W'}$, a fit can finally be accepted as satisfactory, it may be worthwhile to call e02dcf once more with the selected value for ${\mathbf{s}}$ but now using ${\mathbf{start}}=\text{'C'}$. Often, e02dcf 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.4Choice of nxest and nyest

The number of knots may also depend on the upper bounds nxest and nyest. Indeed, if at a certain stage in e02dcf the number of knots in one direction (say ${n}_{x}$) has reached the value of its upper bound (nxest), then from that moment on all subsequent knots are added in the other $\left(y\right)$ direction. Therefore you have the option of limiting the number of knots the routine locates in any direction. For example, by setting ${\mathbf{nxest}}=8$ (the lowest allowable value for nxest), you can indicate that you want an approximation which is a simple cubic polynomial in the variable $x$.

### 9.5Outline of Method Used

If $S=0$, the requisite number of knots is known in advance, i.e., ${n}_{x}={m}_{x}+4$ and ${n}_{y}={m}_{y}+4$; the interior knots are located immediately as ${\lambda }_{\mathit{i}}={x}_{\mathit{i}-2}$ and ${\mu }_{\mathit{j}}={y}_{\mathit{j}-2}$, for $\mathit{i}=5,6,\dots ,{n}_{x}-4$ and $\mathit{j}=5,6,\dots ,{n}_{y}-4$. The corresponding least squares spline is then an interpolating spline and therefore a solution of the problem.
If $S>0$, suitable knot sets are 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 bicubic spline is fitted to the data by least squares, and $\theta$, the sum of squares of residuals, is computed. If $\theta >S$, new knots are added to one knot set or the other so as to reduce $\theta$ at the next stage. The new knots are located in intervals where the fit is particularly poor, their number depending on the value of $S$ and on the progress made so far in reducing $\theta$. Sooner or later, we find that $\theta \le S$ and at that point the knot sets are accepted. The routine then goes on to compute the (unique) spline which has these knot sets and which satisfies the full fitting criterion specified by (2) and (3). The theoretical solution has $\theta =S$. The routine computes the spline by an iterative scheme which is ended when $\theta =S$ within a relative tolerance of $0.001$. 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 e02baf for least squares curve-fitting.
An exception occurs when the routine finds at the start that, even with no interior knots $\left({n}_{x}={n}_{y}=8\right)$, the least squares spline already has its sum of residuals $\text{}\le S$. In this case, since this spline (which is simply a bicubic polynomial) also has an optimal value for the smoothness measure $\eta$, namely zero, it is returned at once as the (trivial) solution. It will usually mean that $S$ has been chosen too large.
For further details of the algorithm and its use see Dierckx (1982).

### 9.6Evaluation of Computed Spline

The values of the computed spline at the points $\left({x}_{\mathit{r}},{y}_{\mathit{r}}\right)$, for $\mathit{r}=1,2,\dots ,m$, may be obtained in the real array ff (see e02def), of length at least $m$, by the following call:
```ifail = 0
Call e02def(m,px,py,x,y,lamda,mu,c,ff,wrk,iwrk,ifail)```
where $\mathtt{M}=m$ and the coordinates ${x}_{r}$, ${y}_{r}$ are stored in $\mathtt{X}\left(k\right)$, $\mathtt{Y}\left(k\right)$. PX and PY have the same values as nx and ny as output from e02dcf, and LAMDA, MU and C have the same values as lamda, mu and c output from e02dcf. WRK is a real workspace array of length at least $\mathtt{PY}-4$, and IWRK is an integer workspace array of length at least $\mathtt{PY}-4$.
To evaluate the computed spline on a ${m}_{x}$ by ${m}_{y}$ rectangular grid of points in the $x$-$y$ plane, which is defined by the $x$ coordinates stored in ${\mathbf{x}}\left(\mathit{q}\right)$, for $\mathit{q}=1,2,\dots ,{m}_{x}$, and the $y$ coordinates stored in ${\mathbf{y}}\left(\mathit{r}\right)$, for $\mathit{r}=1,2,\dots ,{m}_{y}$ , returning the results in the real array ff (see e02dff) which is of length at least ${\mathbf{mx}}×{\mathbf{my}}$, the following call may be used:
``` ifail = 0
Call e02dff(mx,my,px,py,x,y,lamda,mu,c,fg,wrk,lwrk,
*            iwrk,liwrk,ifail)```
where $\mathtt{MX}={m}_{x}$, $\mathtt{MY}={m}_{y}$. PX and PY have the same values as nx and ny as output from e02dcf, and LAMDA, MU and C have the same values as lamda, mu and c output from e02dcf. WRK is a real workspace array of length at least $\mathtt{LWRK}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(\mathit{nwrk1},\mathit{nwrk2}\right)$, where $\mathit{nwrk1}=\mathtt{MX}×4+\mathtt{PX}$ and $\mathit{nwrk2}=\mathtt{MY}×4+\mathtt{PY}$. IWRK is an integer workspace array of length at least $\mathtt{LIWRK}=\mathtt{MY}+\mathtt{PY}-4$ if $\mathit{nwrk1}\ge \mathit{nwrk2}$, or $\mathtt{MX}+\mathtt{PX}-4$ otherwise.
The result of the spline evaluated at grid point $\left(q,r\right)$ is returned in element $\left(\mathtt{MY}×\left(q-1\right)+r\right)$ of the array FG.

## 10Example

This example reads in values of mx, my, ${x}_{\mathit{q}}$, for $\mathit{q}=1,2,\dots ,{\mathbf{mx}}$, and ${y}_{\mathit{r}}$, for $\mathit{r}=1,2,\dots ,{\mathbf{my}}$, followed by values of the ordinates ${f}_{q,r}$ defined at the grid points $\left({x}_{q},{y}_{r}\right)$. It then calls e02dcf to compute a bicubic spline approximation for one specified value of s, and prints the values of the computed knots and B-spline coefficients. Finally it evaluates the spline at a small sample of points on a rectangular grid.

### 10.1Program Text

Program Text (e02dcfe.f90)

### 10.2Program Data

Program Data (e02dcfe.d)

### 10.3Program Results

Program Results (e02dcfe.r)