Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
DOI10.1553/etna_vol51s495zbMath1431.65028OpenAlexW3134887008WikidataQ126577836 ScholiaQ126577836MaRDI QIDQ5218404
No author found.
Publication date: 3 March 2020
Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://etna.mcs.kent.edu/volumes/2011-2020/vol51/abstract.php?vol=51&pages=495-511
Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Oblique projection methods for linear systems with multiple right-hand sides
- Deflated and augmented global Krylov subspace methods for the matrix equations
- New convergence results on the global GMRES method for diagonalizable matrices
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- Global FOM and GMRES algorithms for matrix equations
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- Regularized HSS iteration methods for saddle-point linear systems
- A generalized variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems
- Efficient Solution of Large-Scale Saddle Point Systems Arising in Riccati-Based Boundary Feedback Stabilization of Incompressible Stokes Flow
- Numerical solution of saddle point problems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
