NAG Library Routine Document

e01daf (dim2_spline_grid)


e01daf computes a bicubic spline interpolating surface through a set of data values, given on a rectangular grid in the x-y plane.


Fortran Interface
Subroutine e01daf ( mx, my, x, y, f, px, py, lamda, mu, c, wrk, ifail)
Integer, Intent (In):: mx, my
Integer, Intent (Inout):: ifail
Integer, Intent (Out):: px, py
Real (Kind=nag_wp), Intent (In):: x(mx), y(my), f(mx*my)
Real (Kind=nag_wp), Intent (Out):: lamda(mx+4), mu(my+4), c(mx*my), wrk((mx+6)*(my+6))
C Header Interface
#include <nagmk26.h>
void  e01daf_ (const Integer *mx, const Integer *my, const double x[], const double y[], const double f[], Integer *px, Integer *py, double lamda[], double mu[], double c[], double wrk[], Integer *ifail)


e01daf determines a bicubic spline interpolant to the set of data points x q , y r , f q , r , for q=1,2,,mx and r=1,2,,my. The spline is given in the B-spline representation
such that
where Mix and Njy denote normalized cubic B-splines, the former defined on the knots λi to λi+4 and the latter on the knots μj to μj+4, and the cij are the spline coefficients. These knots, as well as the coefficients, are determined by the routine, which is derived from the routine B2IRE in Anthony et al. (1982). The method used is described in Section 9.2.
For further information on splines, see Hayes and Halliday (1974) for bicubic splines and de Boor (1972) for normalized B-splines.
Values and derivatives of the computed spline can subsequently be computed by calling e02def, e02dff or e02dhf as described in Section 9.3.


Anthony G T, Cox M G and Hayes J G (1982) DASL – Data Approximation Subroutine Library National Physical Laboratory
Cox M G (1975) An algorithm for spline interpolation J. Inst. Math. Appl. 15 95–108
de Boor C (1972) On calculating with B-splines J. Approx. Theory 6 50–62
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


1:     mx – IntegerInput
2:     my – IntegerInput
On entry: mx and my must specify mx and my respectively, the number of points along the x and y axis that define the rectangular grid.
Constraint: mx4 and my4.
3:     xmx – Real (Kind=nag_wp) arrayInput
4:     ymy – Real (Kind=nag_wp) arrayInput
On entry: xq and yr must contain xq, for q=1,2,,mx, and yr, for r=1,2,,my, respectively.
  • xq<xq+1, for q=1,2,,mx-1;
  • yr<yr+1, for r=1,2,,my-1.
5:     fmx×my – Real (Kind=nag_wp) arrayInput
On entry: fmy×q-1+r must contain fq,r, for q=1,2,,mx and r=1,2,,my.
6:     px – IntegerOutput
7:     py – IntegerOutput
On exit: px and py contain mx+4 and my+4, the total number of knots of the computed spline with respect to the x and y variables, respectively.
8:     lamdamx+4 – Real (Kind=nag_wp) arrayOutput
9:     mumy+4 – Real (Kind=nag_wp) arrayOutput
On exit: lamda contains the complete set of knots λi associated with the x variable, i.e., the interior knots lamda5,lamda6,,lamdapx-4, as well as the additional knots
needed for the B-spline representation.
10:   cmx×my – Real (Kind=nag_wp) arrayOutput
On exit: the coefficients of the spline interpolant. cmy×i-1+j contains the coefficient cij described in Section 3.
11:   wrkmx+6×my+6 – Real (Kind=nag_wp) arrayWorkspace
12:   ifail – IntegerInput/Output
On entry: ifail must be set to 0, -1 or 1. If you are unfamiliar with this argument you should refer to Section 3.4 in How to Use the NAG Library and its Documentation for details.
For environments where it might be inappropriate to halt program execution when an error is detected, the value -1 or 1 is recommended. If the output of error messages is undesirable, then the value 1 is recommended. Otherwise, if you are not familiar with this argument, the recommended value is 0. When the value -1 or 1 is used it is essential to test the value of ifail on exit.
On exit: ifail=0 unless the routine detects an error or a warning has been flagged (see Section 6).

Error Indicators and Warnings

If on entry 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:
On entry, mx=value.
Constraint: mx4.
On entry, my=value.
Constraint: my4.
On entry, the x or the y mesh points are not in strictly ascending order.
An intermediate set of linear equations is singular – the data is too ill-conditioned to compute B-spline coefficients.
An unexpected error has been triggered by this routine. Please contact NAG.
See Section 3.9 in How to Use the NAG Library and its Documentation for further information.
Your licence key may have expired or may not have been installed correctly.
See Section 3.8 in How to Use the NAG Library and its Documentation for further information.
Dynamic memory allocation failed.
See Section 3.7 in How to Use the NAG Library and its Documentation for further information.


The main sources of rounding errors are in steps 2, 3, 6 and 7 of the algorithm described in Section 9.2. It can be shown (see Cox (1975)) that the matrix Ax formed in step 2 has elements differing relatively from their true values by at most a small multiple of 3ε, where ε is the machine precision. Ax is ‘totally positive’, and a linear system with such a coefficient matrix can be solved quite safely by elimination without pivoting. Similar comments apply to steps 6 and 7. Thus the complete process is numerically stable.

Parallelism and Performance

e01daf 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.

Further Comments


The time taken by e01daf is approximately proportional to mxmy.

Outline of Method Used

The process of computing the spline consists of the following steps:
1. choice of the interior x-knots λ5, λ6,,λmx as λi=xi-2, for i=5,6,,mx,
2. formation of the system
where Ax is a band matrix of order mx and bandwidth 4, containing in its qth row the values at xq of the B-splines in x, f is the mx by my rectangular matrix of values fq,r, and E denotes an mx by my rectangular matrix of intermediate coefficients,
3. use of Gaussian elimination to reduce this system to band triangular form,
4. solution of this triangular system for E,
5. choice of the interior y knots μ5, μ6,,μmy as μi=yi-2, for i=5,6,,my,
6. formation of the system
where Ay is the counterpart of Ax for the y variable, and C denotes the mx by my rectangular matrix of values of cij,
7. use of Gaussian elimination to reduce this system to band triangular form,
8. solution of this triangular system for CT and hence C.
For computational convenience, steps 2 and 3, and likewise steps 6 and 7, are combined so that the formation of Ax and Ay and the reductions to triangular form are carried out one row at a time.

Evaluation of Computed Spline

The values of the computed spline at the points xk,yk , for k=1,2,,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 M=m and the coordinates xk, yk are stored in Xk, Yk. PX and PY, LAMDA, MU and C have the same values as px and py lamda, mu and c output from e01daf. WRK is a real workspace array of length at least PY, and IWRK is an integer workspace array of length at least PY-4. (See e02def.)
To evaluate the computed spline on an mx by my rectangular grid of points in the x-y plane, which is defined by the x coordinates stored in Xj, for j=1,2,,mx, and the y coordinates stored in Yk, for k=1,2,,my, returning the results in the real array ff (see e02dff) which is of length at least mx×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 MX=mx, MY=my. PX and PY, LAMDA, MU and C have the same values as px, py, lamda, mu and c output from e01daf. WRK is a real workspace array of length at least LWRK = minnwrk1,nwrk2 , for nwrk1 = MX × 4 + PX , nwrk2 = MY × 4 + PY , and IWRK is an integer workspace array of length at least LIWRK = MY + PY - 4  if nwrk1 > nwrk2 , or MX + PX - 4  otherwise.
The result of the spline evaluated at grid point j,k  is returned in element ( MY×j-1+k ) of the array FG.


This example reads in values of mx, xq, for q=1,2,,mx, my and yr, for r=1,2,,my, followed by values of the ordinates fq,r defined at the grid points xq,yr.
It then calls e01daf to compute a bicubic spline interpolant of the data values, and prints the values of the knots and B-spline coefficients. Finally it evaluates the spline at a small sample of points on a rectangular grid.

Program Text

Program Text (e01dafe.f90)

Program Data

Program Data (e01dafe.d)

Program Results

Program Results (e01dafe.r)