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

DOI10.1080/01630568308816162zbMATH Open0529.41012OpenAlexW1989670211MaRDI QIDQ3311064FDOQ3311064

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

• Title not available (Why is that?)
• Approximations in $L^p $ and Chebyshev Approximations
• Title not available (Why is that?)
• Continuous selections and maximal alternators for spline approximation
• Best approximation with respect to nearby norms
• A Remez type algorithm for spline functions
• Chebyshev approximations in subspaces of spline functions
• An algorithm for the computation of strict approximations in subspaces of spline functions
• Characterization of strict approximations in subspaces of spline functions
• Characterization of continuous selections of the metric projection for spline functions
• A characterization of pointwise-lipschitz-continuous selections for the metric projection

Cited In (3)

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

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)