An algorithm for the computation of strict approximations in subspaces of spline functions
From MaRDI portal
Publication:796006
DOI10.1016/0021-9045(84)90089-3zbMath0543.41014MaRDI QIDQ796006
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
41A50: Best approximation, Chebyshev systems
41A52: Uniqueness of best approximation
41A15: Spline approximation
65D15: Algorithms for approximation of functions
Related Items
Uniqueness of best Chebyshev approximations in spline subspaces, Strongly unique spline approximations with free knots, Continuous selections and convergence of best Lp–approximations in subspaces of spline functions, Chebyshev approximations in subspaces of spline functions
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