An algorithm for the computation of strict approximations in subspaces of spline functions

DOI10.1016/0021-9045(84)90089-3zbMath0543.41014OpenAlexW2054098864MaRDI QIDQ796006

Hans Strauss

Publication date: 1984

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-9045(84)90089-3

zbMATH Keywords

algorithmstrict approximationsunique best Chebyshev approximation

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Uniqueness of best approximation (41A52) Spline approximation (41A15) Algorithms for approximation of functions (65D15)

Related Items

Strongly unique spline approximations with free knots ⋮ Continuous selections and convergence of best L_p–approximations in subspaces of spline functions ⋮ Chebyshev approximations in subspaces of spline functions ⋮ Uniqueness of best Chebyshev approximations in spline subspaces

Cites Work

• Best \(L_ 1\)-approximation
• A Remez type algorithm for spline functions
• Chebyshev approximations in subspaces of spline functions
• Tchebycheff approximation in a compact metric space
• A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for the computation of strict approximations in subspaces of spline functions