PLSS: A Projected Linear Systems Solver

DOI10.1137/22m1509783zbMath1512.65042arXiv2207.07615OpenAlexW4367306131MaRDI QIDQ6039256

Johannes J. Brust, Michael A. Saunders

Publication date: 4 May 2023

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.07615

zbMATH Keywords

linear systemsprojection methoditerative solverKaczmarz methodLSQRCraig's methodrandomized numerical linear algebraLSMR

Mathematics Subject Classification ID

Quadratic programming (90C20) Iterative numerical methods for linear systems (65F10) Complexity and performance of numerical algorithms (65Y20) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• A randomized Kaczmarz algorithm with exponential convergence
• LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
• Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
• Sparser Johnson-Lindenstrauss Transforms
• Extensions of Lipschitz mappings into a Hilbert space
• Randomized Iterative Methods for Linear Systems
• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
• The Fast Johnson–Lindenstrauss Transform and Approximate Nearest Neighbors
• Bidiagonalization of Matrices and Solution of Linear Equations
• Methods of conjugate gradients for solving linear systems