Computing the Strict Chebyshev Solution of Overdetermined Linear Equations
From MaRDI portal
Publication:4181889
DOI10.2307/2006127zbMath0398.65020MaRDI QIDQ4181889
Publication date: 1977
Full work available at URL: https://doi.org/10.2307/2006127
65F20: Numerical solutions to overdetermined systems, pseudoinverses
65K05: Numerical mathematical programming methods
90C05: Linear programming
65D15: Algorithms for approximation of functions
Related Items
The convergence of the best discrete linear \(L_ p\) approximation as p\(\to 1\), Strict Chebyshev approximation for general systems of linear equations, Properties of the strict Chebyshev solutions of the linear matrix equation \(AX+YB=C\), Hoffman's error bounds and uniform Lipschitz continuity of best \(l_ p\)-approximations
Cites Work
- Unnamed Item
- Unnamed Item
- Tchebycheff approximation in a compact metric space
- A Multiple Exchange Algorithm for Multivariate Chebyshev Approximation
- Chebyshev solution of overdetermined systems of linear equations
- Approximations in $L^p $ and Chebyshev Approximations
- On the Best Linear Chebyshev Approximation
- A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$