An algorithm for the computation of strict approximations in subspaces of spline functions
From MaRDI portal
Publication:796006
Recommendations
Cites work
- scientific article; zbMATH DE number 3834771 (Why is no real title available?)
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 3703310 (Why is no real title available?)
- scientific article; zbMATH DE number 3265118 (Why is no real title available?)
- scientific article; zbMATH DE number 3295416 (Why is no real title available?)
- scientific article; zbMATH DE number 3300273 (Why is no real title available?)
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
- A Remez type algorithm for spline functions
- Best \(L_ 1\)-approximation
- Chebyshev approximations in subspaces of spline functions
- Tchebycheff approximation in a compact metric space
Cited in
(7)- Uniqueness of best Chebyshev approximations in spline subspaces
- scientific article; zbMATH DE number 3859696 (Why is no real title available?)
- Chebyshev approximations in subspaces of spline functions
- scientific article; zbMATH DE number 3921182 (Why is no real title available?)
- Characterization of strict approximations in subspaces of spline functions
- Continuous selections and convergence of best Lp–approximations in subspaces of spline functions
- Strongly unique spline approximations with free knots
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)