On algorithms for parabolic splines. (English) Zbl 0693.65005

Let \(a=x_ 0<x_ 1<...<x_{n+1}=b\) be a partition of the interval [a,b]. The following problem is discussed. Given a set of real numbers \(\{g_ i:\) \(0\leq i\leq n\}\). Find a quadratic spline \(S_ 2\in C^ 1[a,b]\), with knots at \(x_ 0,x_ 1,...,x_{n+1}\), such that \((1)\quad S_ 2(t_ i)=g_ i\quad (0\leq i\leq n).\) The nodes \(t_ i\) (0\(\leq i\leq n)\) are such that \(t_{i-1}<x_ i<t_ i\quad (1\leq i\leq n);\quad t_ 0=a,\quad t_ n=b.\) Imposing two extra boundary conditions the author shows that there exists a unique spline \(S_ 2\) which satisfies the interpolatory conditions (1). An algorithm for numerical evaluation of the quadratic spline interpolant \(S_ 2\) is included.
Reviewer: E.Neuman


65D07 Numerical computation using splines
41A15 Spline approximation
Full Text: EuDML


[1] Ahlberg J. H., Nilson E. N., Walsh J. L.: The theory of splines and its applications. · Zbl 0158.15901
[2] de Boor C.: The practical guide to splines. Springer, N.Y. 1978 · Zbl 0406.41003
[3] Kobza J.: An algorithm for biparabolic spline. Aplikace matematiky 32 (1987), 5, 401-413. · Zbl 0635.65006
[4] Makarov V. L., Chlobystov V. V.: Splajn approksimacija funkcij. Moskva, 1983
[5] Schultz M. H.: Spline analysis. Prentice-Hall, N.J. 1973 · Zbl 0333.41009
[6] Stěčkin S. B., Subbotin J. N.: Splajny v vyčislitelnoj matematike. Moskva 1976
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.