Integer, Intent (In)	::	m, triang(7*m)
Integer, Intent (Inout)	::	ifail
Real (Kind=nag_wp), Intent (In)	::	x(m), y(m), f(m), grads(2,m), px, py
Real (Kind=nag_wp), Intent (Out)	::	pf

C Header Interface

#include nagmk26.h

void	e01sbf_ ( const Integer m, const double x[], const double y[], const double f[], const Integer triang[], const double grads[], const double px, const double py, double pf, Integer *ifail)

3

Description

e01sbf takes as input the arguments defining the interpolant

F (x, y)

of a set of scattered data points

(x_{r}, y_{r}, f_{r})

, for

r = 1, 2, \dots, m

, as computed by e01saf, and evaluates the interpolant at the point

(p x, p y)

(p x, p y)

is equal to

(x_{r}, y_{r})

for some value of

r

, the returned value will be equal to

f_{r}

(p x, p y)

is not equal to

(x_{r}, y_{r})

for any

r

, the derivatives in grads will be used to compute the interpolant. A triangle is sought which contains the point

(p x, p y)

, and the vertices of the triangle along with the partial derivatives and

f_{r}

values at the vertices are used to compute the value

F (p x, p y)

. If the point

(p x, p y)

lies outside the triangulation defined by the input arguments, the returned value is obtained by extrapolation. In this case, the interpolating function

f

is extended linearly beyond the triangulation boundary. The method is described in more detail in Renka and Cline (1984) and the code is derived from Renka (1984).

e01sbf must only be called after a call to e01saf.

4

References

Renka R L (1984) Algorithm 624: triangulation and interpolation of arbitrarily distributed points in the plane ACM Trans. Math. Software 10 440–442

Renka R L and Cline A K (1984) A triangle-based

C^{1}

interpolation method Rocky Mountain J. Math. 14 223–237

5

Arguments

1: $m$ – IntegerInput
2: $x (m)$ – Real (Kind=nag_wp) arrayInput
3: $y (m)$ – Real (Kind=nag_wp) arrayInput
4: $f (m)$ – Real (Kind=nag_wp) arrayInput
5: $triang (7 \times m)$ – Integer arrayInput
6: $grads (2, m)$ – Real (Kind=nag_wp) arrayInput: On entry: m, x, y, f, triang and grads must be unchanged from the previous call of e01saf.
7: $px$ – Real (Kind=nag_wp)Input
8: $py$ – Real (Kind=nag_wp)Input: On entry: the point $(p x, p y)$ at which the interpolant is to be evaluated.
9: $pf$ – Real (Kind=nag_wp)Output: On exit: the value of the interpolant evaluated at the point $(p x, p y)$ .
10: $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

- 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 < 3

$ifail = 2$: On entry, the triangulation information held in the array triang does not specify a valid triangulation of the data points. triang may have been corrupted since the call to e01saf.

$ifail = 3$: The evaluation point (px,py) lies outside the nodal triangulation, and the value returned in pf is computed by extrapolation.

$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

e01sbf is not thread safe and should not be called from a multithreaded user program. Please see Section 3.12.1 in How to Use the NAG Library and its Documentation for more information on thread safety.

e01sbf is not threaded in any implementation.

9

Further Comments

The time taken for a call of e01sbf is approximately proportional to the number of data points,

m

The results returned by this routine are particularly suitable for applications such as graph plotting, producing a smooth surface from a number of scattered points.

10

Example

See Section 10 in e01saf.

e01sbf (PDF version)

E01 (interp) Chapter Contents

E01 (interp) Chapter Introduction

NAG Library Manual

NAG Library Routine Document

e01sbf (dim2_scat_eval)

▸▿ Contents

1 Purpose

2 Specification

3 Description

4 References

5 Arguments

6 Error Indicators and Warnings

7 Accuracy

8 Parallelism and Performance

9 Further Comments

10 Example

1

Purpose

2

Specification