Fast and forward stable randomized algorithms for linear least-squares problems

DOI10.1137/23m1616790MaRDI QIDQ6623665

Ethan N. Epperly

Publication date: 24 October 2024

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

sketchingnumerical stabilityrandomized algorithmleast-squares

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Unnamed Item
• Stability analysis of the method of seminormal equations for linear least squares problems
• Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares
• A fast randomized algorithm for overdetermined linear least-squares regression
• Blendenpik: Supercharging LAPACK's Least-Squares Solver
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Nearly Tight Oblivious Subspace Embeddings by Trace Inequalities
• Accuracy and Stability of Numerical Algorithms
• Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation
• Perturbation theory for pseudo-inverses
• Randomized numerical linear algebra: Foundations and algorithms
• Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions
• Are sketch-and-precondition least squares solvers numerically stable?

This page was built for publication: Fast and forward stable randomized algorithms for linear least-squares problems