Fast randomized least-squares solvers can be just as accurate and stable as classical direct solvers

Documents similaires

• Fast and forward stable randomized algorithms for linear least-squares problems
  par: Epperly, Ethan N.
  Publié: (2023)
• Numerical Instabilities in the Kaczmarz Method and Stabilization by Iterative Refinement
  par: Dereziński, Michał, et autres
  Publié: (2026)
• Randomized flexible Krylov methods for $\ell_p$ regularization
  par: Landman, Malena Sabaté, et autres
  Publié: (2025)
• Sharp analysis of sketched least squares and randomized low-rank approximation
  par: Epperly, Ethan N., et autres
  Publié: (2026)
• Make the most of what you have: Resource-efficient randomized algorithms for matrix computations
  par: Epperly, Ethan N.
  Publié: (2025)