Given a set of data points
, for
,
e02acf uses the exchange algorithm to compute an
th-order polynomial
such that
is a minimum.
The routine also returns a number whose absolute value is the final reference deviation (see
Section 6). The routine is an adaptation of
Boothroyd (1967).
- 1: – Real (Kind=nag_wp) arrayInput
-
On entry: the values of the coordinates,
, for .
Constraint:
.
- 2: – Real (Kind=nag_wp) arrayInput
-
On entry: the values of the coordinates,
, for .
- 3: – IntegerInput
-
On entry: the number of data points.
- 4: – Real (Kind=nag_wp) arrayOutput
-
On exit: the coefficients
of the final polynomial, for .
- 5: – IntegerInput
-
On entry: , where is the order of the polynomial to be found.
Constraint:
.
- 6: – Real (Kind=nag_wp)Output
-
On exit: the final reference deviation (see
Section 6).
If an error is detected in an input argument
e02acf will act as if a soft noisy exit has been requested (see
Section 3.4.4 in How to Use the NAG Library and its Documentation).
This is wholly dependent on the given data points.
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.
None.