E01BFF evaluates a piecewise cubic Hermite interpolant at a set of points.
E01BFF evaluates a piecewise cubic Hermite interpolant, as computed by
E01BEF, at the points
, for
. If any point lies outside the interval from
to
, a value is extrapolated from the nearest extreme cubic, and a warning is returned.
The routine is derived from routine PCHFE in
Fritsch (1982).
If on entry
or
, explanatory error messages are output on the current error message unit (as defined by
X04AAF).
The computational errors in the array
PF should be negligible in most practical situations.
Not applicable.
The time taken by E01BFF is approximately proportional to the number of evaluation points,
. The evaluation will be most efficient if the elements of
PX are in nondecreasing order (or,
more generally, if they are grouped in increasing order of the intervals
). A single call of
E01BFF with
is more efficient than several calls with
.
This example reads in values of
N,
X,
F and
D, and then calls
E01BFF to evaluate the interpolant at equally spaced points.