SPMR: A family of saddle-point minimum residual solvers
From MaRDI portal
(Redirected from Publication:4569320)
Computational methods for sparse matrices (65F50) Eigenvalues, singular values, and eigenvectors (15A18) Preconditioners for iterative methods (65F08) Linear equations (linear algebraic aspects) (15A06) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)
Recommendations
Cites work
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 3511513 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- A Look-Ahead Lanczos Algorithm for Unsymmetric Matrices
- A backward error analysis of a null space algorithm in sparse quadratic programming
- An Implementation of the Look-Ahead Lanczos Algorithm for Non-Hermitian Matrices
- Any Nonincreasing Convergence Curve is Possible for GMRES
- Approximating the leading singular triplets of a large matrix function
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Computing projections with LSQR
- Constraint Preconditioning for Indefinite Linear Systems
- Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Generalized Golub-Kahan bidiagonalization and stopping criteria
- Inexact Krylov Subspace Methods for Linear Systems
- LSMR: An Iterative Algorithm for Sparse Least-Squares Problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Numerical solution of saddle point problems
- On nonsingular saddle-point systems with a maximally rank deficient leading block
- On the solution of equality constrained quadratic programming problems arising in optimization
- Preconditioners for the discretized time-harmonic Maxwell equations in mixed form
- Preconditioning
- Projected Krylov methods for saddle-point systems
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Range-Space Variants and Inexact Matrix-Vector Products in Krylov Solvers for Linear Systems Arising from Inverse Problems
- The Use ofQRFactorization in Sparse Quadratic Programming and Backward Error Issues
- Theory of Inexact Krylov Subspace Methods and Applications to Scientific Computing
- Towards an optimal condition number of certain augmented Lagrangian-type saddle-point matrices.
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
Cited in
(7)- A modified implementation of MINRES to monitor residual subvector norms for block systems
- Implementing a smooth exact penalty function for general constrained nonlinear optimization
- GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems
- GP-CMRH: an inner product free iterative method for block two-by-two nonsymmetric linear systems
- A tridiagonalization method for symmetric saddle-point systems
- Iterative preconditioned methods in Krylov spaces: trends of the 21st century
- Iterative solution of saddle-point systems of linear equations
This page was built for publication: SPMR: A family of saddle-point minimum residual solvers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569320)
