Some Comments on Preconditioning for Normal Equations and Least Squares
From MaRDI portal
Publication:5094915
DOI10.1137/20M1387948OpenAlexW3216172936MaRDI QIDQ5094915
Publication date: 5 August 2022
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/20m1387948
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On a question of Bhatia and Kittaneh
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Preconditioning techniques for large linear systems: A survey
- Preconditioning for sparse linear systems at the dawn of the 21st century: history, current developments, and future perspectives
- Preconditioning of Linear Least Squares by Robust Incomplete Factorization for Implicitly Held Normal Equations
- Finite Elements and Fast Iterative Solvers
- LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems
- A fast randomized algorithm for overdetermined linear least-squares regression
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- How Fast are Nonsymmetric Matrix Iterations?
- Solution of Sparse Indefinite Systems of Linear Equations
- On the Numerical Solution of the Biharmonic Equation and the Role of Squaring Matrices for Preconditioning
- Iterative Krylov Methods for Large Linear Systems
- Preconditioning
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Some Comments on Preconditioning for Normal Equations and Least Squares
