hide long namesshow long names
hide short namesshow short names
Integer type:  int32  int64  nag_int  show int32  show int32  show int64  show int64  show nag_int  show nag_int

PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

NAG Toolbox: nag_interp_5d_scat_shep_eval (e01tn)

Purpose

nag_interp_5d_scat_shep_eval (e01tn) evaluates the five-dimensional interpolating function generated by nag_interp_5d_scat_shep (e01tm) and its first partial derivatives.

Syntax

[q, qx, ifail] = e01tn(x, f, iq, rq, xe, 'm', m, 'n', n)
[q, qx, ifail] = nag_interp_5d_scat_shep_eval(x, f, iq, rq, xe, 'm', m, 'n', n)

Description

nag_interp_5d_scat_shep_eval (e01tn) takes as input the interpolant Q (x) Q (x) , x5x5 of a set of scattered data points (xr,fr) (xr,fr) , for r = 1,2,,mr=1,2,,m, as computed by nag_interp_5d_scat_shep (e01tm), and evaluates the interpolant and its first partial derivatives at the set of points xixi, for i = 1,2,,ni=1,2,,n.
nag_interp_5d_scat_shep_eval (e01tn) must only be called after a call to nag_interp_5d_scat_shep (e01tm).
nag_interp_5d_scat_shep_eval (e01tn) is derived from the new implementation of QS3GRD described by Renka (1988). It uses the modification for five-dimensional interpolation described by Berry and Minser (1999).

References

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

Parameters

Compulsory Input Parameters

1:     x(55,m) – double array
must be the same array supplied as parameter x in the preceding call to nag_interp_5d_scat_shep (e01tm). It must remain unchanged between calls.
2:     f(m) – double array
m, the dimension of the array, must satisfy the constraint m23m23.
must be the same array supplied as parameter f in the preceding call to nag_interp_5d_scat_shep (e01tm). It must remain unchanged between calls.
3:     iq(2 × m + 12×m+1) – int64int32nag_int array
must be the same array returned as parameter iq in the preceding call to nag_interp_5d_scat_shep (e01tm). It must remain unchanged between calls.
4:     rq(21 × m + 1121×m+11) – double array
must be the same array returned as parameter rq in the preceding call to nag_interp_5d_scat_shep (e01tm). It must remain unchanged between calls.
5:     xe(55,n) – double array
xe(1 : 5,i)xe1:5i must be set to the evaluation point xixi , for i = 1,2,,ni=1,2,,n.

Optional Input Parameters

1:     m – int64int32nag_int scalar
Default: The dimension of the array f and the second dimension of the array x. (An error is raised if these dimensions are not equal.)
must be the same value supplied for parameter m in the preceding call to nag_interp_5d_scat_shep (e01tm).
Constraint: m23m23.
2:     n – int64int32nag_int scalar
Default: The second dimension of the array xe.
nn, the number of evaluation points.
Constraint: n1n1.

Input Parameters Omitted from the MATLAB Interface

None.

Output Parameters

1:     q(n) – double array
q(i)qi contains the value of the interpolant, at xixi, for i = 1,2,,ni=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 nag_machine_real_largest (x02al)), and nag_interp_5d_scat_shep_eval (e01tn) returns with ifail = 3ifail=3.
2:     qx(55,n) – double array
qx(j,i)qxji contains the value of the partial derivatives with respect to xjxj of the interpolant Q (x) Q (x) at xixi, for i = 1,2,,ni=1,2,,n, and for each of the five partial derivatives j = 1,2,3,4,5j=1,2,3,4,5. If any of these evaluation points lie outside the region of definition of the interpolant, the corresponding entries in qx are set to the largest machine representable number (see nag_machine_real_largest (x02al)), and nag_interp_5d_scat_shep_eval (e01tn) returns with ifail = 3ifail=3.
3:     ifail – int64int32nag_int scalar
ifail = 0ifail=0 unless the function detects an error (see [Error Indicators and Warnings]).

Error Indicators and Warnings

Errors or warnings detected by the function:
  ifail = 1ifail=1
Constraint: m23m23.
Constraint: n1n1.
  ifail = 2ifail=2
On entry, values in iq appear to be invalid. Check that iq has not been corrupted between calls to nag_interp_5d_scat_shep (e01tm) and nag_interp_5d_scat_shep_eval (e01tn).
On entry, values in rq appear to be invalid. Check that rq has not been corrupted between calls to nag_interp_5d_scat_shep (e01tm) and nag_interp_5d_scat_shep_eval (e01tn).
  ifail = 3ifail=3
On entry, at least one evaluation point lies outside the region of definition of the interpolant.

Accuracy

Computational errors should be negligible in most practical situations.

Further Comments

The time taken for a call to nag_interp_5d_scat_shep_eval (e01tn) 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 O(n)O(n). At worst O(mn)O(mn) time will be required.

Example

function nag_interp_5d_scat_shep_eval_example
genid = int64(1);
subid = int64(1);
seed  = [int64(1762543)];
seed2 = [int64(43331)];


% Initialize the generator to a repeatable sequence
[state, ifail] = nag_rand_init_repeat(genid, subid, seed);

% Generate the data points x
[state, x, ifail] = nag_rand_dist_uniform01(int64(5*30), state);
x = reshape(x, 5, 30);

% Evaluate function
f = ((1.25+cos(5.4*x(5,:))).*cos(6*x(1,:)).*cos(6*x(2,:)).*cos(6*x(3,:)))./...
    (6+6*(3*x(4,:)-1).^2);

% Generate the interpolant
nq = int64(0);
nw = int64(0);
[iq, rq, ifail] = nag_interp_5d_scat_shep(x, f, nw, nq);

% Generate repeatable evaluation points
[state, ifail] = nag_rand_init_repeat(genid, subid, seed2);
[state, xe, ifail] = nag_rand_dist_uniform01(int64(5*8), state);
xe = reshape(xe, 5, 8);

% Evaluate function at xe
fun = ((1.25+cos(5.4*xe(5,:))).*cos(6*xe(1,:)).*cos(6*xe(2,:)).*...
      cos(6*xe(3,:)))./(6+6*(3*xe(4,:)-1).^2);

% Evaluate the interpolant
[q, qx, ifail] = nag_interp_5d_scat_shep_eval(x, f, iq, rq, xe);

fprintf('\n i |  f(i)       q(i)   |f(i)-q(i)|\n');
fprintf('---|--------------------+---------+\n');
for i=1:8
  fprintf(' %d |%8.4f  %8.4f  %8.4f \n', i, fun(i), q(i), abs(fun(i)-q(i)));
end
 

 i |  f(i)       q(i)   |f(i)-q(i)|
---|--------------------+---------+
 1 |  0.0058    0.0464    0.0407 
 2 |  0.0034    0.4855    0.4821 
 3 | -0.1096    0.0724    0.1820 
 4 |  0.0875    0.0320    0.0555 
 5 |  0.0015    0.0373    0.0358 
 6 | -0.0158   -0.1170    0.1012 
 7 |  0.0046   -0.0484    0.0530 
 8 | -0.0090   -0.0134    0.0043 

function e01tn_example
genid = int64(1);
subid = int64(1);
seed  = [int64(1762543)];
seed2 = [int64(43331)];


% Initialize the generator to a repeatable sequence
[state, ifail] = g05kf(genid, subid, seed);

% Generate the data points x
[state, x, ifail] = g05sa(int64(5*30), state);
x = reshape(x, 5, 30);

% Evaluate function
f = ((1.25+cos(5.4*x(5,:))).*cos(6*x(1,:)).*cos(6*x(2,:)).*cos(6*x(3,:)))./...
    (6+6*(3*x(4,:)-1).^2);

% Generate the interpolant
nq = int64(0);
nw = int64(0);
[iq, rq, ifail] = e01tm(x, f, nw, nq);

% Generate repeatable evaluation points
[state, ifail] = g05kf(genid, subid, seed2);
[state, xe, ifail] = g05sa(int64(5*8), state);
xe = reshape(xe, 5, 8);

% Evaluate function at xe
fun = ((1.25+cos(5.4*xe(5,:))).*cos(6*xe(1,:)).*cos(6*xe(2,:)).*...
      cos(6*xe(3,:)))./(6+6*(3*xe(4,:)-1).^2);

% Evaluate the interpolant
[q, qx, ifail] = e01tn(x, f, iq, rq, xe);

fprintf('\n i |  f(i)       q(i)   |f(i)-q(i)|\n');
fprintf('---|--------------------+---------+\n');
for i=1:8
  fprintf(' %d |%8.4f  %8.4f  %8.4f \n', i, fun(i), q(i), abs(fun(i)-q(i)));
end
 

 i |  f(i)       q(i)   |f(i)-q(i)|
---|--------------------+---------+
 1 |  0.0058    0.0464    0.0407 
 2 |  0.0034    0.4855    0.4821 
 3 | -0.1096    0.0724    0.1820 
 4 |  0.0875    0.0320    0.0555 
 5 |  0.0015    0.0373    0.0358 
 6 | -0.0158   -0.1170    0.1012 
 7 |  0.0046   -0.0484    0.0530 
 8 | -0.0090   -0.0134    0.0043 


PDF version (NAG web site, 64-bit version, 64-bit version)
Chapter Contents
Chapter Introduction
NAG Toolbox

© The Numerical Algorithms Group Ltd, Oxford, UK. 2009–2013