A Finite Step Algorithm for Determining the “Strict” Chebyshev Solution to $Ax=b$
Authors:
- C. S. DurisCDC. S. Duris
- M. G. TempleMTM. G. Temple
- 1 September 1973
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 10 (4) , 690-699
Abstract
This paper develops a finite step algorithm for determining the “strict” Chebyshev solution to an overdetermined system of linear equations $Ax = b$, where A is an $m \times n$ matrix of rank $n < m$. The construction of the strict Chebyshev solution is based on a new way of constructively defining the strict solution, which is shown to be equivalent to the construction based on knowing all the possible Chebyshev solutions. A discussion of the computational problems encountered in this algorithm is given, along with the solutions to some examples.
Keywords
This publication has 9 references indexed in Scilit:
- Chebyshev and $l^1 $-Solutions of Linear Equations Using Least Squares SolutionsSIAM Journal on Numerical Analysis, 1968
- An exchange method for solving Haar or non-Haar overdetermined linear equations in the sense of Chebyshev1968
- On the Best Linear Chebyshev ApproximationThe Computer Journal, 1967
- Algorithms for bestL 1 andL ∞ linear approximations on a discrete setNumerische Mathematik, 1966
- Approximations in $L^p $ and Chebyshev ApproximationsJournal of the Society for Industrial and Applied Mathematics, 1963
- Tchebycheff approximation in a compact metric spaceBulletin of the American Mathematical Society, 1962
- Dégénérescence dans les approximations de Tschebyscheff linéaires et discrètesNumerische Mathematik, 1961
- Über diskrete und lineare Tschebyscheff-ApproximationenNumerische Mathematik, 1959
- On the “Best” and “Least Q th” Approximation of an Overdetermined System of Linear EquationsJournal of the ACM, 1957