Chebyshev solution of overdetermined systems of linear equations
- 1 June 1975
- journal article
- research article
- Published by Springer Nature in BIT Numerical Mathematics
- Vol. 15 (2) , 117-129
- https://doi.org/10.1007/bf01932684
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A new algorithm for the Chebyshev solution of overdetermined linear systemsMathematics of Computation, 1974
- A Fixed Point Method for Tchebycheff Solution of Inconsistent Linear EquationsIMA Journal of Applied Mathematics, 1973
- The simplex method of linear programming using LU decompositionCommunications of the ACM, 1969
- A steepest ascent method for the Chebyshev problemMathematics of Computation, 1969
- Chebyshev and $l^1 $-Solutions of Linear Equations Using Least Squares SolutionsSIAM Journal on Numerical Analysis, 1968
- On the Best Linear Chebyshev ApproximationThe Computer Journal, 1967
- Algorithms for bestL 1 andL ∞ linear approximations on a discrete setNumerische Mathematik, 1966
- Note on Jordan elimination, linear programming and Tchebycheff approximationNumerische Mathematik, 1960
- Ü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