NAG Library Routine Document
e01zmf (dimn_scat_shep)
1
Purpose
e01zmf generates a multidimensional interpolant to a set of scattered data points, using a modified Shepard method. When the number of dimensions is no more than five, there are corresponding routines in
Chapter E01 which are specific to the given dimensionality.
e01sgf generates the twodimensional interpolant, while
e01tgf,
e01tkf and
e01tmf generate the three, four and fivedimensional interpolants respectively.
2
Specification
Fortran Interface
Integer, Intent (In)  ::  d, m, nw, nq  Integer, Intent (Inout)  ::  ifail  Integer, Intent (Out)  ::  iq(2*m+1)  Real (Kind=nag_wp), Intent (In)  ::  x(d,m), f(m)  Real (Kind=nag_wp), Intent (Out)  ::  rq(*) 

C Header Interface
#include <nagmk26.h>
void 
e01zmf_ (const Integer *d, const Integer *m, const double x[], const double f[], const Integer *nw, const Integer *nq, Integer iq[], double rq[], Integer *ifail) 

3
Description
e01zmf constructs a smooth function $Q\left(\mathbf{x}\right)$, $\mathbf{x}\in {\mathbb{R}}^{d}$ which interpolates a set of $m$ scattered data points $\left({\mathbf{x}}_{r},{f}_{r}\right)$, for $r=1,2,\dots ,m$, using a modification of Shepard's method. The surface is continuous and has continuous first partial derivatives.
The basic Shepard method, which is a generalization of the twodimensional method described in
Shepard (1968), interpolates the input data with the weighted mean
where
${q}_{r}={f}_{r}$,
${w}_{r}\left(\mathbf{x}\right)=\frac{1}{{{\Vert \mathbf{x}{\mathbf{x}}_{r}\Vert}_{2}}^{2}}$.
The basic method is global in that the interpolated value at any point depends on all the data, but
e01zmf uses a modification (see
Franke and Nielson (1980) and
Renka (1988a)), whereby the method becomes local by adjusting each
${w}_{r}\left(\mathbf{x}\right)$ to be zero outside a hypersphere with centre
${\mathbf{x}}_{r}$ and some radius
${R}_{w}$. Also, to improve the performance of the basic method, each
${q}_{r}$ above is replaced by a function
${q}_{r}\left(\mathbf{x}\right)$, which is a quadratic fitted by weighted least squares to data local to
${\mathbf{x}}_{r}$ and forced to interpolate
$\left({\mathbf{x}}_{r},{f}_{r}\right)$. In this context, a point
$\mathbf{x}$ is defined to be local to another point if it lies within some distance
${R}_{q}$ of it.
The efficiency of
e01zmf is enhanced by using a cell method for nearest neighbour searching due to
Bentley and Friedman (1979) with a cell density of
$3$.
The radii
${R}_{w}$ and
${R}_{q}$ are chosen to be just large enough to include
${N}_{w}$ and
${N}_{q}$ data points, respectively, for usersupplied constants
${N}_{w}$ and
${N}_{q}$. Default values of these parameters are provided, and advice on alternatives is given in
Section 9.2.
e01zmf is derived from the new implementation of QSHEP3 described by
Renka (1988b). It uses the modification for highdimensional interpolation described by
Berry and Minser (1999).
Values of the interpolant
$Q\left(\mathbf{x}\right)$ generated by
e01zmf, and its first partial derivatives, can subsequently be evaluated for points in the domain of the data by a call to
e01znf.
4
References
Bentley J L and Friedman J H (1979) Data structures for range searching ACM Comput. Surv. 11 397–409
Berry M W, Minser K S (1999) Algorithm 798: highdimensional interpolation using the modified Shepard method ACM Trans. Math. Software 25 353–366
Franke R and Nielson G (1980) Smooth interpolation of large sets of scattered data Internat. J. Num. Methods Engrg. 15 1691–1704
Renka R J (1988a) Multivariate interpolation of large sets of scattered data ACM Trans. Math. Software 14 139–148
Renka R J (1988b) Algorithm 661: QSHEP3D: Quadratic Shepard method for trivariate interpolation of scattered data ACM Trans. Math. Software 14 151–152
Shepard D (1968) A twodimensional interpolation function for irregularly spaced data Proc. 23rd Nat. Conf. ACM 517–523 Brandon/Systems Press Inc., Princeton
5
Arguments
 1: $\mathbf{d}$ – IntegerInput

On entry: $d$, the number of dimensions.
Constraint:
${\mathbf{d}}\ge 2$.
 2: $\mathbf{m}$ – IntegerInput

On entry:
$m$, the number of data points.
Note: on the basis of experimental results reported in
Berry and Minser (1999), when
${\mathbf{d}}\ge 5$ it is recommended to use
${\mathbf{m}}\ge 4000$.
Constraint:
${\mathbf{m}}\ge \left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)/2+2$.
 3: $\mathbf{x}\left({\mathbf{d}},{\mathbf{m}}\right)$ – Real (Kind=nag_wp) arrayInput

On entry:
${\mathbf{x}}\left(1:{\mathbf{d}},\mathit{r}\right)$ must be set to the Cartesian coordinates of the data point ${\mathbf{x}}_{\mathit{r}}$, for $\mathit{r}=1,2,\dots ,m$.
Constraint:
these coordinates must be distinct, and must not all lie on the same $\left(d1\right)$dimensional hypersurface.
 4: $\mathbf{f}\left({\mathbf{m}}\right)$ – Real (Kind=nag_wp) arrayInput

On entry: ${\mathbf{f}}\left(r\right)$ must be set to the data value ${f}_{\mathit{r}}$, for $\mathit{r}=1,2,\dots ,m$.
 5: $\mathbf{nw}$ – IntegerInput

On entry: the number
${N}_{w}$ of data points that determines each radius of influence
${R}_{w}$, appearing in the definition of each of the weights
${w}_{\mathit{r}}$, for
$\mathit{r}=1,2,\dots ,m$ (see
Section 3). Note that
${R}_{w}$ is different for each weight. If
${\mathbf{nw}}\le 0$ the default value
${\mathbf{nw}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(2\times \left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right),{\mathbf{m}}1\right)$ is used instead.
Suggested value:
${\mathbf{nw}}=1$.
Constraint:
${\mathbf{nw}}\le {\mathbf{m}}1$.
 6: $\mathbf{nq}$ – IntegerInput

On entry: the number
${N}_{q}$ of data points to be used in the least squares fit for coefficients defining the quadratic functions
${q}_{r}\left(\mathbf{x}\right)$ (see
Section 3). If
${\mathbf{nq}}\le 0$ the default value
${\mathbf{nq}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(\left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)\times 6/5,{\mathbf{m}}1\right)$ is used instead.
Suggested value:
${\mathbf{nq}}=1$.
Constraint:
${\mathbf{nq}}\le 0$ or $\left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)/21\le {\mathbf{nq}}\le {\mathbf{m}}1$.
 7: $\mathbf{iq}\left(2\times {\mathbf{m}}+1\right)$ – Integer arrayOutput

On exit: integer data defining the interpolant $Q\left(\mathbf{x}\right)$.
 8: $\mathbf{rq}\left(*\right)$ – Real (Kind=nag_wp) arrayOutput

Note: the dimension of the array
rq
must be at least
$\left(\left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)/2\right)\times {\mathbf{m}}+2\times {\mathbf{d}}+1$.
On exit: real data defining the interpolant $Q\left(\mathbf{x}\right)$.
 9: $\mathbf{ifail}$ – IntegerInput/Output

On entry:
ifail must be set to
$0$,
$1\text{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\text{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 $\mathbf{1}\text{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).
6
Error 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{d}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{d}}\ge 2$.
On entry, $\left(\left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)/2\right)\times {\mathbf{m}}+2\times {\mathbf{d}}+1$ exceeds the largest machine integer.
${\mathbf{d}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{m}}=\u2329\mathit{\text{value}}\u232a$.
On entry, ${\mathbf{m}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{d}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{m}}\ge \left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)/2+2$.
On entry, ${\mathbf{nq}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{d}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{nq}}\le 0$ or ${\mathbf{nq}}\ge \left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)/21$.
On entry, ${\mathbf{nq}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{m}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{nq}}\le {\mathbf{m}}1$.
On entry, ${\mathbf{nw}}=\u2329\mathit{\text{value}}\u232a$ and ${\mathbf{m}}=\u2329\mathit{\text{value}}\u232a$.
Constraint: ${\mathbf{nw}}\le {\mathbf{m}}1$.
 ${\mathbf{ifail}}=2$

There are duplicate nodes in the dataset. ${\mathbf{x}}\left(k,i\right)={\mathbf{x}}\left(k,j\right)$, for $i=\u2329\mathit{\text{value}}\u232a$, $j=\u2329\mathit{\text{value}}\u232a$ and $k=1,2,\dots ,{\mathbf{d}}$. The interpolant cannot be derived.
 ${\mathbf{ifail}}=3$

On entry, all the data points lie on the same hypersurface. No unique solution exists.
 ${\mathbf{ifail}}=99$
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.
 ${\mathbf{ifail}}=399$
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.
 ${\mathbf{ifail}}=999$
Dynamic memory allocation failed.
See
Section 3.7 in How to Use the NAG Library and its Documentation for further information.
7
Accuracy
In experiments undertaken by
Berry and Minser (1999), the accuracies obtained for a conditional function resulting in sharp functional transitions were of the order of
${10}^{1}$ at best. In other cases in these experiments, the function generated interpolates the input data with maximum absolute error of the order of
${10}^{2}$.
8
Parallelism and Performance
e01zmf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
e01zmf 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 implementationspecific information.
The time taken for a call to e01zmf will depend in general on the distribution of the data points and on the choice of ${N}_{w}$ and ${N}_{q}$ parameters. If the data points are uniformly randomly distributed, then the time taken should be $\mathit{O}\left(m\right)$. At worst $\mathit{O}\left({m}^{2}\right)$ time will be required.
Default values of the parameters ${N}_{w}$ and ${N}_{q}$ may be selected by calling e01zmf with ${\mathbf{nw}}\le 0$ and ${\mathbf{nq}}\le 0$. These default values may well be satisfactory for many applications.
If nondefault values are required they must be supplied to
e01zmf through positive values of
nw and
nq. Increasing these argument values makes the method less local. This may increase the accuracy of the resulting interpolant at the expense of increased computational cost. The default values
${\mathbf{nw}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(2\times \left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right),{\mathbf{m}}1\right)$ and
${\mathbf{nq}}=\mathrm{min}\phantom{\rule{0.125em}{0ex}}\left(\left({\mathbf{d}}+1\right)\times \left({\mathbf{d}}+2\right)\times 6/5,{\mathbf{m}}1\right)$ have been chosen on the basis of experimental results reported in
Renka (1988a) and
Berry and Minser (1999). For further advice on the choice of these arguments see
Renka (1988a) and
Berry and Minser (1999).
9.3
Internal Changes
Internal changes have been made to this routine as follows:
 At Mark 26.0: The algorithm used by this routine, based on a Modified Shepard method, has been changed to produce more reliable results for some data sets which were previously not well handled. In addition, handling of evaluation points which are far away from the original data points has been improved by use of an extrapolation method which returns useful results rather than just an error message as was done at earlier Marks.
 At Mark 26.1: The algorithm has undergone further changes which enable it to work better on certain data sets, for example data presented on a regular grid. The results returned when evaluating the function at points which are not in the original data set used to construct the interpolating function are now likely to be slightly different from those returned at previous Marks of the Library, but the function still interpolates the original data.
For details of all known issues which have been reported for the NAG Library please refer to the
Known Issues list.
10
Example
This program reads in a set of
$30$ data points and calls
e01zmf to construct an interpolating function
$Q\left(\mathbf{x}\right)$. It then calls
e01znf to evaluate the interpolant at a set of points.
Note that this example is not typical of a realistic problem: the number of data points would normally be very much larger.
See also
Section 10 in
e01znf.
10.1
Program Text
Program Text (e01zmfe.f90)
10.2
Program Data
Program Data (e01zmfe.d)
10.3
Program Results
Program Results (e01zmfe.r)