GPMR: An Iterative Method for Unsymmetric Partitioned Linear Systems
DOI10.1137/21M1459265OpenAlexW4323825473MaRDI QIDQ5885815
Dominique Orban, Alexis Montoison
Publication date: 30 March 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.07007
regularizationiterative methodssparse linear systemspreconditionersKrylov subspacesgeneralized saddle point systemsblock-Arnoldi processorthogonal Hessenberg reductionunsymmetric partitioned matrices
Computational methods for sparse matrices (65F50) Ill-posedness and regularization problems in numerical linear algebra (65F22) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Orthogonalization in numerical linear algebra (65F25) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- The block grade of a block Krylov space
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Numerics of Gram-Schmidt orthogonalization
- Partitioning mathematical programs for parallel solution
- A primal-dual regularized interior-point method for convex quadratic programs
- Preconditioners for saddle point problems arising in computational fluid dynamics
- Conjugate gradient for nonsingular saddle-point systems with a maximally rank-deficient leading block
- Block Gram-Schmidt algorithms and their stability properties
- A Note on Preconditioning Nonsymmetric Matrices
- Julia: A Fresh Approach to Numerical Computing
- Iterative Solution of Symmetric Quasi-Definite Linear Systems
- The university of Florida sparse matrix collection
- BDDC for Nonsymmetric Positive Definite and Symmetric Indefinite Problems
- Numerical solution of saddle point problems
- An Introduction to Domain Decomposition Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Two Conjugate-Gradient-Type Methods for Unsymmetric Linear Equations
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Note on Preconditioning for Indefinite Linear Systems
- SPMR: A Family of Saddle-Point Minimum Residual Solvers
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems
- BiLQ: An Iterative Method for Nonsymmetric Linear Systems with a Quasi-Minimum Error Property
- Block Gram–Schmidt Orthogonalization
- A Tridiagonalization Method for Symmetric Saddle-Point Systems
- Bidiagonalization of Matrices and Solution of Linear Equations
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
