A new complexity bound for the least-squares problem
Author:
- 1 June 1996
- journal article
- Published by Elsevier in Computers & Mathematics with Applications
- Vol. 31 (12) , 15-16
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor seriesMathematical and Computer Modelling, 1994