The general problem of polynomial spline interpolation (Q721528): Difference between revisions
From MaRDI portal
Latest revision as of 09:42, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The general problem of polynomial spline interpolation |
scientific article |
Statements
The general problem of polynomial spline interpolation (English)
0 references
19 July 2018
0 references
Given a nonempty interval \([a,b]\subset\mathbb{R}\) and a set \(\Delta\) of interpolation nodes \(a =: x_0 < x_1< \cdots <x_N := b\), suppose that the values \(f_i\) of some function \(f\) are known on \(\Delta\). The author considers the general spline interpolation problem to construct a polynomial spline \(s\) of degree \(n > 0\) with knots coming from a set \(\delta: -\infty< \xi_1 < \cdots \xi_{N-n} < +\infty\) and satisfying \(s(x_i) = f_i\), \(i=0, 1, \ldots, N\). The construction of such splines uses the coefficients of expansion of a certain derivative of associated \(B\)-splines. The system of equations for these coefficients is analyzed and an estimate for the interpolation error is derived.
0 references
polynomial splines
0 references
interpolation
0 references
B-splines
0 references
construction algorithms
0 references
0 references
0 references