NAG Library Routine Document

e01shf  (dim2_scat_shep_eval)

 Contents

    1  Purpose
    7  Accuracy
    10  Example

1
Purpose

e01shf evaluates the two-dimensional interpolating function generated by e01sgf and its first partial derivatives.

2
Specification

Fortran Interface
Subroutine e01shf ( m, x, y, f, iq, liq, rq, lrq, n, u, v, q, qx, qy, ifail)
Integer, Intent (In):: m, iq(liq), liq, lrq, n
Integer, Intent (Inout):: ifail
Real (Kind=nag_wp), Intent (In):: x(m), y(m), f(m), rq(lrq), u(n), v(n)
Real (Kind=nag_wp), Intent (Out):: q(n), qx(n), qy(n)
C Header Interface
#include nagmk26.h
void  e01shf_ ( const Integer *m, const double x[], const double y[], const double f[], const Integer iq[], const Integer *liq, const double rq[], const Integer *lrq, const Integer *n, const double u[], const double v[], double q[], double qx[], double qy[], Integer *ifail)

3
Description

e01shf takes as input the interpolant Qx,y of a set of scattered data points xr,yr,fr, for r=1,2,,m, as computed by e01sgf, and evaluates the interpolant and its first partial derivatives at the set of points ui,vi, for i=1,2,,n.
e01shf must only be called after a call to e01sgf.
This routine is derived from the routine QS2GRD described by Renka (1988).

4
References

Renka R J (1988) Algorithm 660: QSHEP2D: Quadratic Shepard method for bivariate interpolation of scattered data ACM Trans. Math. Software 14 149–150

5
Arguments

1:     m – IntegerInput
2:     xm – Real (Kind=nag_wp) arrayInput
3:     ym – Real (Kind=nag_wp) arrayInput
4:     fm – Real (Kind=nag_wp) arrayInput
On entry: m, x, y and f must be the same values as were supplied in the preceding call to e01sgf.
5:     iqliq – Integer arrayInput
On entry: must be unchanged from the value returned from a previous call to e01sgf.
6:     liq – IntegerInput
On entry: the dimension of the array iq as declared in the (sub)program from which e01shf is called.
Constraint: liq2×m+1.
7:     rqlrq – Real (Kind=nag_wp) arrayInput
On entry: must be unchanged from the value returned from a previous call to e01sgf.
8:     lrq – IntegerInput
On entry: the dimension of the array rq as declared in the (sub)program from which e01shf is called.
Constraint: lrq6×m+5.
9:     n – IntegerInput
On entry: n, the number of evaluation points.
Constraint: n1.
10:   un – Real (Kind=nag_wp) arrayInput
11:   vn – Real (Kind=nag_wp) arrayInput
On entry: the evaluation points ui,vi, for i=1,2,,n.
12:   qn – Real (Kind=nag_wp) arrayOutput
On exit: the values of the interpolant at ui,vi, for i=1,2,,n. If any of these evaluation points lie outside the region of definition of the interpolant the corresponding entries in q are set to the largest machine representable number (see x02alf), and e01shf returns with ifail=3.
13:   qxn – Real (Kind=nag_wp) arrayOutput
14:   qyn – Real (Kind=nag_wp) arrayOutput
On exit: the values of the partial derivatives of the interpolant Qx,y at ui,vi, for i=1,2,,n. If any of these evaluation points lie outside the region of definition of the interpolant, the corresponding entries in qx and qy are set to the largest machine representable number (see x02alf), and e01shf returns with ifail=3.
15:   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).

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:
ifail=1
On entry,m<6,
orliq<2×m+1,
orlrq<6×m+5,
orn<1.
ifail=2
Values supplied in iq or rq appear to be invalid. Check that these arrays have not been corrupted between the calls to e01sgf and e01shf.
ifail=3
At least one evaluation point lies outside the region of definition of the interpolant. At all such points the corresponding values in q, qx and qy have been set to the largest machine representable number (see x02alf).
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.
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.
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

Computational errors should be negligible in most practical situations.

8
Parallelism and Performance

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

The time taken for a call to e01shf will depend in general on the distribution of the data points. If x and y are approximately uniformly distributed, then the time taken should be only On. At worst Omn time will be required.

9.1
Internal Changes

Internal changes have been made to this routine as follows:
For details of all known issues which have been reported for the NAG Library please refer to the Known Issues list.

10
Example

See Section 10 in e01sgf.
© The Numerical Algorithms Group Ltd, Oxford, UK. 2017