×

Quadratic spline interpolation. (English) Zbl 0295.41005


MSC:

41A15 Spline approximation
41A10 Approximation by polynomials
41A05 Interpolation in approximation theory
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Garrett Birkhoff and Carl R. De Boor, Piecewise polynomial interpolation and approximation, Approximation of Functions (Proc. Sympos. General Motors Res. Lab., 1964 ), Elsevier Publ. Co., Amsterdam, 1965, pp. 164 – 190.
[2] T. R. Lucas, Error bounds for interpolating cubic splines under various end conditions, Notices Amer. Math. Soc. 19 (1972), A-795. Abstract #699-B15.
[3] Martin Marsden, Cubic spline interpolation of continuous functions, J. Approximation Theory 10 (1974), 103 – 111. · Zbl 0281.41002
[4] Martin J. Marsden, An identity for spline functions with applications to variation-diminishing spline approximation, J. Approximation Theory 3 (1970), 7 – 49. · Zbl 0192.42103
[5] Martin Marsden and I. J. Schoenberg, On variation diminishing spline approximation methods, Mathematica (Cluj) 8 (31) (1966), 61 – 82. · Zbl 0171.31001
[6] A. Sharma and A. Meir, Degree of approximation of spline interpolation, J. Math. Mech. 15 (1966), 759 – 767. · Zbl 0158.30702
[7] Stig Nord, Approximation properties of the spline fit, Nordisk Tidskr. Informations-Behandling (BIT) 7 (1967), 132 – 144. · Zbl 0171.37304
[8] Franklin B. Richards, Best bounds for the uniform periodic spline interpolation operator, J. Approximation Theory 7 (1973), 302 – 317. · Zbl 0252.41008
[9] F. Schurer, On interpolating cubic splines with equally-spaced nodes, Nederl. Akad. Wetensch. Proc. Ser. A 71 = Indag. Math. 30 (1968), 517 – 524. · Zbl 0184.37902
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.