An algorithm for the computation of strict approximations in subspaces of spline functions
From MaRDI portal
Publication:796006
DOI10.1016/0021-9045(84)90089-3zbMATH Open0543.41014OpenAlexW2054098864MaRDI QIDQ796006FDOQ796006
Authors: 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
Recommendations
Spline approximation (41A15) Best approximation, Chebyshev systems (41A50) Algorithms for approximation of functions (65D15) Uniqueness of best approximation (41A52)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Best \(L_ 1\)-approximation
- A Remez type algorithm for spline functions
- Title not available (Why is that?)
- Chebyshev approximations in subspaces of spline functions
- Tchebycheff approximation in a compact metric space
- Title not available (Why is that?)
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
Cited In (7)
- Continuous selections and convergence of best Lp–approximations in subspaces of spline functions
- Title not available (Why is that?)
- Chebyshev approximations in subspaces of spline functions
- Strongly unique spline approximations with free knots
- Title not available (Why is that?)
- Characterization of strict approximations in subspaces of spline functions
- Uniqueness of best Chebyshev approximations in spline subspaces
This page was built for publication: An algorithm for the computation of strict 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 Q796006)
