Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- 1 October 1971
- journal article
- Published by Springer Nature in Numerische Mathematik
- Vol. 17 (5) , 387-401
- https://doi.org/10.1007/bf01436088
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Solutions of overdetermined linear equations which minimize error in an abstract normNumerische Mathematik, 1969
- 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 ChebyshevPublished by Association for Computing Machinery (ACM) ,1968
- The Lawson algorithm and extensionsMathematics of Computation, 1968
- Normed Linear SpacesPublished by Springer Nature ,1958