A new complexity bound for the least-squares problem

DOI10.1016/0898-1221(96)00072-7MaRDI QIDQ1921252zbMATH OpenOpenAlexFDO

Authors 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

arithmetic complexityleast squares problempolynomial regression

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 811973
• Minimax estimation and the least squares method
• An Efficient Algorithm for the Classical Least Squares Approximation
• Algorithms and complexity for least median of squares regression
• scientific article; zbMATH DE number 2151323

Cites work

• Algebraic improvements of numerical algorithms: Interpolation and economization of Taylor series
• scientific article; zbMATH DE number 691245 (Why is no real title available?)
• New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions and Recurrences

Cited in

(6)

• An O(n) algorithm for least squares quasi-convex approximation
• AN EXPONENTIAL LOWER BOUND ON THE COMPLEXITY OF REGULARIZATION PATHS
• Sub-linear Time Hybrid Approximations for Least Trimmed Squares Estimator and Related Problems
• scientific article; zbMATH DE number 811973 (Why is no real title available?)
• A gradient-based approach for optimal actuator design with morphing wings
• Complexity reduction of least squares problems involving special Vandermonde matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921252)