Continuous selections and convergence of best Lp–approximations in subspaces of spline functions

DOI10.1080/01630568308816162MaRDI QIDQ3311064zbMATH OpenOpenAlexFDO

Authors M. Sommer

Publication date 1983

Published in Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01630568308816162

zbMATH Keywords

metric projectioncontinuous selectionspolynomial spline functions

Mathematics Subject Classification ID

Spline approximation (41A15) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Cites work

• scientific article; zbMATH DE number 3258269 (Why is no real title available?)
• scientific article; zbMATH DE number 3295416 (Why is no real title available?)
• A Remez type algorithm for spline functions
• A characterization of pointwise-lipschitz-continuous selections for the metric projection
• An algorithm for the computation of strict approximations in subspaces of spline functions
• Approximations in $L^p $ and Chebyshev Approximations
• Best approximation with respect to nearby norms
• Characterization of continuous selections of the metric projection for spline functions
• Characterization of strict approximations in subspaces of spline functions
• Chebyshev approximations in subspaces of spline functions
• Continuous selections and maximal alternators for spline approximation

Cited in

(3)

• Nonuniqueness and selections in spline approximation
• Parametric approximation by splines
• The Pólya algorithm in sequence spaces

This page was built for publication: Continuous selections and convergence of best L_p–approximations in subspaces of spline functions

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