Approximation by spline functions

From MaRDI portal





Theoretical and numerical aspects of interpolation and best approximation by polynomial splines in one variable are analyzed and algorithms are described for constructing such approximations using a computer. Approximation properties of spaces of polynomials (as prototypes of Chebyshev spaces) and spline spaces (as prototypes of more general weak Chebyshev spaces) are discussed. Following topics are dealt with: unique solvability of interpolation problems for various Chebyshev spaces, construction of interpolating polynomials, choice of optimal interpolation points, best approximation by functions from Chebyshev spaces in the uniform norm, \(L_ 1\)-norm and \(L_ 2\) norm, the connection between best \(L_ 1\)-approximation and interpolation and the relationship between best one-sided \(L_ 1\)-approximation and quadrature formulas, approximation of weak Chebyshev spaces by Chebyshev spaces, B- splines, interpolation and quasi-interpolation by splines, best approximations by functions from weak Chebyshev and spline spaces in the uniform norm and the \(L_ 1\)-norm, approximation of linear functionals by linear combinations of point functionals. In the Appendix the case of splines with free knots and splines in two variables and the use of splines in the numerical solution of differential equations in connection with collocation methods are given.




Cited in
(only showing first 100 items - show all)








This page was built for publication: Approximation by spline functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3995482)