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

DOI10.1080/01630568308816162zbMath0529.41012OpenAlexW1989670211MaRDI QIDQ3311064

Manfred 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

continuous selectionsmetric projectionpolynomial spline functions

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• An algorithm for the computation of strict approximations in subspaces of spline functions
• Characterization of strict approximations in subspaces of spline functions
• Continuous selections and maximal alternators for spline approximation
• A Remez type algorithm for spline functions
• Characterization of continuous selections of the metric projection for spline functions
• Best approximation with respect to nearby norms
• Chebyshev approximations in subspaces of spline functions
• A characterization of pointwise-lipschitz-continuous selections for the metric projection
• Approximations in $L^p $ and Chebyshev Approximations
• Unnamed Item
• Unnamed Item

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