Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
- 1 May 1973
- journal article
- Published by Elsevier in Journal of Approximation Theory
- Vol. 8 (1) , 46-61
- https://doi.org/10.1016/0021-9045(73)90030-0
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract normNumerische Mathematik, 1971
- Solutions of overdetermined linear equations which minimize error in an abstract normNumerische Mathematik, 1969
- The Lawson algorithm and extensionsMathematics of Computation, 1968