naginterfaces.library.fit.dim2_​cheb_​lines

naginterfaces.library.fit.dim2_cheb_lines(m, k, l, x, y, f, w, na, xmin, xmax, nux, nuy)

dim2_cheb_lines forms an approximation to the weighted, least squares Chebyshev series surface fit to data arbitrarily distributed on lines parallel to one independent coordinate axis.

For full information please refer to the NAG Library document for e02ca

https://support.nag.com/numeric/nl/nagdoc_30.3/flhtml/e02/e02caf.html

Parameters

mint, array-like, shape $\left(n\right)$

$m[\text{s}-1]$ must be set to $m_{\text{s}}$, the number of data $x$ values on the line $y=y_{\text{s}}$, for $\text{s}=1,2,\dots ,n$.

kint

$k$, the required degree of $x$ in the fit.

lint

$l$, the required degree of $y$ in the fit.

xfloat, array-like, shape $\left(sum\left(m\right)\right)$

The $x$ values of the data points. The sequence must be

all points on $y=y_1$, followed by

all points on $y=y_2$, followed by

$⋮$

all points on $y=y_n$.

yfloat, array-like, shape $\left(n\right)$

$y[\text{s}-1]$ must contain the $y$ value of line $y=y_{\text{s}}$, for $\text{s}=1,2,\dots ,n$, on which data is given.

ffloat, array-like, shape $\left(sum\left(m\right)\right)$

$f$, the data values of the dependent variable in the same sequence as the $x$ values.

wfloat, array-like, shape $\left(sum\left(m\right)\right)$

The weights to be assigned to the data points, in the same sequence as the $x$ values. These weights should be calculated from estimates of the absolute accuracies of the $f_r$, expressed as standard deviations, probable errors or some other measure which is of the same dimensions as $f_r$. Specifically, each $w_r$ should be inversely proportional to the accuracy estimate of $f_r$. Often weights all equal to unity will be satisfactory. If a particular weight is zero, the corresponding data point is omitted from the fit.

naint

The dimension of the array $a$.

xminfloat, array-like, shape $\left(n\right)$

$xmin[\text{s}-1]$ must contain $x_{min}^{\left(\text{s}\right)}$, the lower end of the range of $x$ on the line $y=y_{\text{s}}$, for $\text{s}=1,2,\dots ,n$. It must not be greater than the lowest data value of $x$ on the line. Each $x_{min}^{\left(s\right)}$ is scaled to $-1.0$ in the fit. (See also Further Comments.)

xmaxfloat, array-like, shape $\left(n\right)$

$xmax[\text{s}-1]$ must contain $x_{max}^{\left(\text{s}\right)}$, the upper end of the range of $x$ on the line $y=y_{\text{s}}$, for $\text{s}=1,2,\dots ,n$. It must not be less than the highest data value of $x$ on the line. Each $x_{max}^{\left(s\right)}$ is scaled to $+1.0$ in the fit. (See also Further Comments.)

nuxfloat, array-like, shape $\left(\text{inuxp1}\right)$

$nux[\text{i}-1]$ must contain the coefficient of the Chebyshev polynomial of degree $(\text{i}-1)$ in $\overline{x}$, in the Chebyshev series representation of the polynomial factor in $\overline{x}$ which you require the fit to contain, for $\text{i}=1,2,\dots ,\text{inuxp1}$. These coefficients are defined according to the standard convention of Notes.

nuyfloat, array-like, shape $\left(\text{inuyp1}\right)$

$nuy[\text{i}-1]$ must contain the coefficient of the Chebyshev polynomial of degree $(\text{i}-1)$ in $\overline{y}$, in the Chebyshev series representation of the polynomial factor which you require the fit to contain, for $\text{i}=1,2,\dots ,\text{inuyp1}$. These coefficients are defined according to the standard convention of Notes.

Returns

afloat, ndarray, shape $\left(na\right)$

Contains the Chebyshev coefficients of the fit. $a[i\times (l+1)+j-1]$ is the coefficient $a_{ij}$ of Notes defined according to the standard convention. These coefficients are used by dim2_cheb_eval() to calculate values of the fitted function.

Raises

NagValueError

(errno $1$)

On entry, $na$ is too small. $na=⟨value⟩$. Minimum possible dimension: $⟨value⟩$.

(errno $1$)

On entry, $\text{mtot}$ is too small. $\text{mtot}=⟨value⟩$. Minimum possible dimension: $⟨value⟩$.

(errno $1$)

On entry, $\text{I}=⟨value⟩$, $m[\text{I}-1]=⟨value⟩$, $k=⟨value⟩$ and $\text{inuxp1}=⟨value⟩$.

Constraint: $m[\text{I}-1]\ge k-\text{inuxp1}+2$.

(errno $1$)

On entry, $n=⟨value⟩$, $l=⟨value⟩$ and $\text{inuyp1}=⟨value⟩$.

Constraint: $n\ge l-\text{inuyp1}+2$.

(errno $1$)

On entry, $\text{inuyp1}=⟨value⟩$ and $l=⟨value⟩$.

Constraint: $\text{inuyp1}\le l+1$.

(errno $1$)

On entry, $\text{inuxp1}=⟨value⟩$ and $k=⟨value⟩$.

Constraint: $\text{inuxp1}\le k+1$.

(errno $1$)

On entry, $\text{inuyp1}=⟨value⟩$.

Constraint: $\text{inuyp1}\ge 1$.

(errno $1$)

On entry, $\text{inuxp1}=⟨value⟩$.

Constraint: $\text{inuxp1}\ge 1$.

(errno $1$)

On entry, $l=⟨value⟩$.

Constraint: $l\ge 0$.

(errno $1$)

On entry, $k=⟨value⟩$.

Constraint: $k\ge 0$.

(errno $2$)

On entry, $xmin[\text{I}-1]$ and $xmax[\text{I}-1]$ do not span the data $x$ values on $y=y[\text{I}-1]$: $\text{I}=⟨value⟩$, $xmin[\text{I}-1]=⟨value⟩$, $xmax[\text{I}-1]=⟨value⟩$ and $y[\text{I}-1]=⟨value⟩$.

(errno $3$)

On entry, the data $x$ values are not nondecreasing for $y=y[\text{I}-1]$: $\text{I}=⟨value⟩$ and $y[\text{I}-1]=⟨value⟩$.

(errno $3$)

On entry, $\text{I}=⟨value⟩$, $y[\text{I}-1]=⟨value⟩$ and $y[\text{I}-2]=⟨value⟩$.

Constraint: $y[\text{I}-1]>y[\text{I}-2]$.

(errno $4$)

On entry, the number of distinct $x$ values with nonzero weight on $y=y[\text{I}-1]$ is less than $k-\text{inuxp1}+2$: $\text{I}=⟨value⟩$, $y[\text{I}-1]=⟨value⟩$, $k=⟨value⟩$ and $\text{inuxp1}=⟨value⟩$.

(errno $5$)

On entry, $\text{inuxp1}=⟨value⟩$, $nux[\text{inuxp1}-1]=⟨value⟩$, $\text{inuyp1}=⟨value⟩$ and $nuy[\text{inuyp1}-1]=⟨value⟩$.

Constraint: if $nux[\text{inuxp1}-1]=0.0$, $\text{inuxp1}=1$; if $nuy[\text{inuyp1}-1]=0.0$, $\text{inuyp1}=1$.

Notes

dim2_cheb_lines determines a bivariate polynomial approximation of degree $k$ in $x$ and $l$ in $y$ to the set of data points $(x_{\text{r},\text{s}},y_{\text{s}},f_{\text{r},\text{s}})$, with weights $w_{\text{r},\text{s}}$, for $\text{r}=1,2,\dots ,m_{\text{s}}$, for $\text{s}=1,2,\dots ,n$. That is, the data points are on lines $y=y_s$, but the $x$ values may be different on each line. The values of $k$ and $l$ are prescribed by you (for guidance on their choice, see Further Comments). The function is based on the method described in Sections 5 and 6 of Clenshaw and Hayes (1965).

The polynomial is represented in double Chebyshev series form with arguments $\overline{x}$ and $\overline{y}$. The arguments lie in the range $-1$ to $+1$ and are related to the original variables $x$ and $y$ by the transformations

$$\overline{x}=\frac{2x-(x_{max}+x_{min})}{(x_{max}-x_{min})}\text{and}\overline{y}=\frac{2y-(y_{max}+y_{min})}{(y_{max}-y_{min})}\text{.}$$

Here $y_{max}$ and $y_{min}$ are set by the function to, respectively, the largest and smallest value of $y_s$, but $x_{max}$ and $x_{min}$ are functions of $y$ prescribed by you (see Further Comments). For this function, only their values $x_{max}^{\left(s\right)}$ and $x_{min}^{\left(s\right)}$ at each $y=y_s$ are required. For each $s=1,2,\dots ,n$, $x_{max}^{\left(s\right)}$ must not be less than the largest $x_{r,s}$ on the line $y=y_s$, and, similarly, $x_{min}^{\left(s\right)}$ must not be greater than the smallest $x_{r,s}$.

The double Chebyshev series can be written as

$$\sum _{i=0}^k\sum _{j=0}^l{a}_{ij}{T}_i\left(\overline{x}\right)T_j\left(\overline{y}\right)$$

where $T_i\left(\overline{x}\right)$ is the Chebyshev polynomial of the first kind of degree $i$ with argument $\overline{x}$, and $T_j\left(y\right)$ is similarly defined. However, the standard convention, followed in this function, is that coefficients in the above expression which have either $i$ or $j$ zero are written as $\frac{1}{2}{a}_{ij}$, instead of simply $a_{ij}$, and the coefficient with both $i$ and $j$ equal to zero is written as $\frac{1}{4}{a}_{0,0}$. The series with coefficients output by the function should be summed using this convention. dim2_cheb_eval() is available to compute values of the fitted function from these coefficients.

The function first obtains Chebyshev series coefficients $c_{s,\text{i}}$, for $\text{i}=0,1,\dots ,k$, of the weighted least squares polynomial curve fit of degree $k$ in $\overline{x}$ to the data on each line $y=y_{\text{s}}$, for $\text{s}=1,2,\dots ,n$, in turn, using an auxiliary function. The same function is then called $k+1$ times to fit $c_{\text{s},i}$, for $\text{s}=1,2,\dots ,n$, by a polynomial of degree $l$ in $\overline{y}$, for each $i=0,1,\dots ,k$. The resulting coefficients are the required $a_{ij}$.

You can force the fit to contain a given polynomial factor. This allows for the surface fit to be constrained to have specified values and derivatives along the boundaries $x=x_{min}$, $x=x_{max}$, $y=y_{min}$ and $y=y_{max}$ or indeed along any lines $\overline{x}=$ constant or $\overline{y}=$ constant (see Section 8 of Clenshaw and Hayes (1965)).

References

Clenshaw, C W and Hayes, J G, 1965, Curve and surface fitting, J. Inst. Math. Appl. (1), 164–183

Hayes, J G (ed.), 1970, Numerical Approximation to Functions and Data, Athlone Press, London