A new complexity bound for the least-squares problem

DOI10.1016/0898-1221(96)00072-7zbMath0853.65045OpenAlexW2060746038MaRDI QIDQ1921252

Lei Li

Publication date: 13 January 1997

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00072-7

zbMATH Keywords

polynomial regressionleast squares problemarithmetic complexity

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series
• New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences

This page was built for publication: A new complexity bound for the least-squares problem