Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
From MaRDI portal
Publication:5853709
Recommendations
- On the restrictively preconditioned conjugate gradient method for solving saddle point problems
- Preconditioned Conjugate Gradient Method and Generalized Successive Overrelaxation Method for the Least Squares Problems
- Updating preconditioners for modified least squares problems
- Restrictively preconditioned conjugate gradient methods for systems of linear equations
- The restrictively preconditioned conjugate gradient methods on normal residual for block two-by-two linear systems
Cites work
- scientific article; zbMATH DE number 1953446 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Combination Preconditioning and the Bramble–Pasciak$^{+}$ Preconditioner
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Methods of conjugate gradients for solving linear systems
- Modifying a Sparse Cholesky Factorization
- Multiple-rank modifications of a sparse Cholesky factorization
- Preconditioning saddle-point systems with applications in optimization
- Restrictively preconditioned conjugate gradient methods for systems of linear equations
- Row Modifications of a Sparse Cholesky Factorization
- The University of Florida sparse matrix collection
- Updating preconditioners for modified least squares problems
Cited in
(1)
This page was built for publication: Restrictively preconditioned conjugate gradient method for a series of constantly augmented least squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5853709)