On nonsymmetric saddle point matrices that allow conjugate gradient iterations
From MaRDI portal
Publication:2480884
DOI10.1007/s00211-007-0131-9zbMath1142.65032OpenAlexW2065977427MaRDI QIDQ2480884
Jörg Liesen, Beresford N. Parlett
Publication date: 3 April 2008
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-007-0131-9
numerical experimentserror boundsconjugate gradient methodsaddle point problemdiagonalizable matricessymmetric indefinite matrices
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10)
Related Items (13)
Combination preconditioning of saddle point systems for positive definiteness ⋮ An Additive Schwarz Method Type Theory for Lions's Algorithm and a Symmetrized Optimized Restricted Additive Schwarz Method ⋮ An optimal control theory for nonlinear optimization ⋮ Hermitian matrix polynomials with real eigenvalues of definite type. I: Classification ⋮ Weighted Inner Products for GMRES and GMRES-DR ⋮ Two new variants of the HSS preconditioner for regularized saddle point problems ⋮ Conjugate gradient for nonsingular saddle-point systems with a maximally rank-deficient leading block ⋮ On eigenvalue distribution of constraint‐preconditioned symmetric saddle point matrices ⋮ Bramble--Pasciak-Type Conjugate Gradient Method for Darcy's Equations ⋮ Null-Space Preconditioners for Saddle Point Systems ⋮ Preconditioners for state-constrained optimal control problems with Moreau-Yosida penalty function ⋮ On the eigenvalue distribution of preconditioned nonsymmetric saddle point matrices ⋮ On Nonsingular Saddle-Point Systems with a Maximally Rank Deficient Leading Block
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum residual methods for augmented systems
- On the eigenvalues of a class of saddle point matrices
- Differences in the Effects of Rounding Errors in Krylov Solvers for Symmetric Indefinite Linear Systems
- A Taxonomy for Conjugate Gradient Methods
- Numerical solution of saddle point problems
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- Solution of Sparse Indefinite Systems of Linear Equations
- Iterative Solution Methods
- IFISS: A Computational Laboratory for Investigating Incompressible Flow Problems
- Methods of conjugate gradients for solving linear systems
- Fields of Values of a Matrix
- The role of the inner product in stopping criteria for conjugate gradient iterations
This page was built for publication: On nonsymmetric saddle point matrices that allow conjugate gradient iterations