# NAG FL Interfacee01znf (dimn_​scat_​shep_​eval)

## 1Purpose

e01znf evaluates the multidimensional interpolating function generated by e01zmf and its first partial derivatives.

## 2Specification

Fortran Interface
 Subroutine e01znf ( d, m, x, f, iq, rq, n, xe, q, qx,
 Integer, Intent (In) :: d, m, iq(2*m+1), n Integer, Intent (Inout) :: ifail Real (Kind=nag_wp), Intent (In) :: x(d,m), f(m), rq(*), xe(d,n) Real (Kind=nag_wp), Intent (Out) :: q(n), qx(d,n)
#include <nag.h>
 void e01znf_ (const Integer *d, const Integer *m, const double x[], const double f[], const Integer iq[], const double rq[], const Integer *n, const double xe[], double q[], double qx[], Integer *ifail)
The routine may be called by the names e01znf or nagf_interp_dimn_scat_shep_eval.

## 3Description

e01znf takes as input the interpolant $Q\left(\mathbf{x}\right)$, $\mathbf{x}\in {ℝ}^{d}$ of a set of scattered data points $\left({\mathbf{x}}_{\mathit{r}},{f}_{\mathit{r}}\right)$, for $\mathit{r}=1,2,\dots ,m$, as computed by e01zmf, and evaluates the interpolant and its first partial derivatives at the set of points ${\mathbf{x}}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$.
e01znf must only be called after a call to e01zmf.
e01znf is derived from the new implementation of QS3GRD described by Renka (1988). It uses the modification for high-dimensional interpolation described by Berry and Minser (1999).
Berry M W, Minser K S (1999) Algorithm 798: high-dimensional interpolation using the modified Shepard method ACM Trans. Math. Software 25 353–366
Renka R J (1988) Algorithm 661: QSHEP3D: Quadratic Shepard method for trivariate interpolation of scattered data ACM Trans. Math. Software 14 151–152

## 5Arguments

1: $\mathbf{d}$Integer Input
On entry: must be the same value supplied for argument d in the preceding call to e01zmf.
Constraint: ${\mathbf{d}}\ge 2$.
2: $\mathbf{m}$Integer Input
On entry: must be the same value supplied for argument m in the preceding call to e01zmf.
Constraint: ${\mathbf{m}}\ge \left({\mathbf{d}}+1\right)×\left({\mathbf{d}}+2\right)/2+2$.
3: $\mathbf{x}\left({\mathbf{d}},{\mathbf{m}}\right)$Real (Kind=nag_wp) array Input
Note: the $i$th ordinate of the point ${x}_{j}$ is stored in ${\mathbf{x}}\left(i,j\right)$.
On entry: must be the same array supplied as argument x in the preceding call to e01zmf. It must remain unchanged between calls.
4: $\mathbf{f}\left({\mathbf{m}}\right)$Real (Kind=nag_wp) array Input
On entry: must be the same array supplied as argument f in the preceding call to e01zmf. It must remain unchanged between calls.
5: $\mathbf{iq}\left(2×{\mathbf{m}}+1\right)$Integer array Input
On entry: must be the same array returned as argument iq in the preceding call to e01zmf. It must remain unchanged between calls.
6: $\mathbf{rq}\left(*\right)$Real (Kind=nag_wp) array Input
Note: the dimension of the array rq must be at least $\left(\left({\mathbf{d}}+1\right)×\left({\mathbf{d}}+2\right)/2\right)×{\mathbf{m}}+2×{\mathbf{d}}+1$.
On entry: must be the same array returned as argument rq in the preceding call to e01zmf. It must remain unchanged between calls.
7: $\mathbf{n}$Integer Input
On entry: $n$, the number of evaluation points.
Constraint: ${\mathbf{n}}\ge 1$.
8: $\mathbf{xe}\left({\mathbf{d}},{\mathbf{n}}\right)$Real (Kind=nag_wp) array Input
Note: the $i$th ordinate of the point ${x}_{j}$ is stored in ${\mathbf{xe}}\left(i,j\right)$.
On entry: ${\mathbf{xe}}\left(1:{\mathbf{d}},\mathit{j}\right)$ must be set to the evaluation point ${\mathbf{x}}_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,n$.
9: $\mathbf{q}\left({\mathbf{n}}\right)$Real (Kind=nag_wp) array Output
On exit: ${\mathbf{q}}\left(\mathit{i}\right)$ contains the value of the interpolant, at ${\mathbf{x}}_{\mathit{i}}$, for $\mathit{i}=1,2,\dots ,n$. If any of these evaluation points lie outside the region of definition of the interpolant the corresponding entries in q are set to an extrapolated approximation, and e01znf returns with ${\mathbf{ifail}}={\mathbf{3}}$.
10: $\mathbf{qx}\left({\mathbf{d}},{\mathbf{n}}\right)$Real (Kind=nag_wp) array Output
On exit: ${\mathbf{qx}}\left(i,j\right)$ contains the value of the partial derivatives with respect to the $i$th independent variable (dimension) of the interpolant $Q\left(\mathbf{x}\right)$ at ${\mathbf{x}}_{\mathit{j}}$, for $\mathit{j}=1,2,\dots ,n$, and for each of the partial derivatives $i=1,2,\dots ,d$. If any of these evaluation points lie outside the region of definition of the interpolant, the corresponding entries in qx are set to extrapolated approximations to the partial derivatives, and e01znf returns with ${\mathbf{ifail}}={\mathbf{3}}$.
11: $\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{d}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{d}}\ge 2$.
On entry, $\left(\left({\mathbf{d}}+1\right)×\left({\mathbf{d}}+2\right)/2\right)×{\mathbf{m}}+2×{\mathbf{d}}+1$ exceeds the largest machine integer.
${\mathbf{d}}=〈\mathit{\text{value}}〉$ and ${\mathbf{m}}=〈\mathit{\text{value}}〉$.
On entry, ${\mathbf{m}}=〈\mathit{\text{value}}〉$ and ${\mathbf{d}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{m}}\ge \left({\mathbf{d}}+1\right)×\left({\mathbf{d}}+2\right)/2+2$.
On entry, ${\mathbf{n}}=〈\mathit{\text{value}}〉$.
Constraint: ${\mathbf{n}}\ge 1$.
${\mathbf{ifail}}=2$
On entry, values in iq appear to be invalid. Check that iq has not been corrupted between calls to e01zmf and e01znf.
On entry, values in rq appear to be invalid. Check that rq has not been corrupted between calls to e01zmf and e01znf.
${\mathbf{ifail}}=3$
On entry, at least one evaluation point lies outside the region of definition of the interpolant. At such points the corresponding values in q and qx contain extrapolated approximations. Points should be evaluated one by one to identify extrapolated values.
${\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

Computational errors should be negligible in most practical situations.

## 8Parallelism and Performance

e01znf is threaded by NAG for parallel execution in multithreaded implementations of the NAG Library.
e01znf 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.

The time taken for a call to e01znf will depend in general on the distribution of the data points. If the data points are approximately uniformly distributed, then the time taken should be only $\mathit{O}\left(n\right)$. At worst $\mathit{O}\left(mn\right)$ time will be required.

### 9.1Internal 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.

## 10Example

This program evaluates the function (in six variables)
 $fx = x1 x2 x3 1 + 2 x4 x5 x6$
at a set of randomly generated data points and calls e01zmf to construct an interpolating function ${Q}_{x}$. It then calls e01znf to evaluate the interpolant at a set of points on the line ${x}_{i}=x$, for $\mathit{i}=1,2,\dots ,6$. To reduce the time taken by this example, the number of data points is limited. Increasing this value to the suggested minimum of $4000$ improves the interpolation accuracy at the expense of more time.