scientific article; zbMATH DE number 3893716

From MaRDI portal
Publication:5186121





[For the entire collection see Zbl 0554.00008.] A survey of best approximation by splines with fixed knots in various norms with special emphasis on numerical methods is given. Several parts of this field were fully developed in the last decade. In addition, an algorithm for computing (continuous) piecewise polynomials with free knots is discussed. Section 1 deals with characterization and uniqueness of best uniform spline approximations and continuity of the corresponding set-value metric projection. Moreover, a Remez type algorithm for computing best spline approximations in the uniform norm is described in section 2. Section 3 is devoted to uniqueness and intepolation at canonical points in \(L_ 1\)-approximation by splines. In section 4 uniqueness in one-sided \(L_ 1\)-approximation by splines and the relationship to Gauss quadrature formulas are considered. Finally, section 5 contains a description of an algorithm for computing best piecewise polynomial approximations in the uniform norm. The survey shows that various problems of best approximation by splines with fixed knots were completely solved, but for the case of splines with free knots and multivariate splines several deep problems are still open at present.




Cited in
(22)








This page was built for publication:

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