Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
From MaRDI portal
Publication:5218404
Recommendations
- Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis
- Preconditioners for Generalized Saddle-Point Problems
- A Preconditioner for Generalized Saddle Point Problems
- A preconditioning technique in conjunction with Krylov subspace methods for solving multilinear systems
- Substructure Preconditioners for Elliptic Saddle Point Problems
- Dimensionally consistent preconditioning for saddle-point problems
- On parameterized matrix splitting preconditioner for the saddle point problems
- A parameterized splitting preconditioner for generalized saddle point problems
Cites work
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A block version of BiCGSTAB for linear systems with multiple right-hand sides
- A generalized variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems
- Deflated and augmented global Krylov subspace methods for the matrix equations
- Efficient solution of large-scale saddle point systems arising in Riccati-based boundary feedback stabilization of incompressible Stokes flow
- Global FOM and GMRES algorithms for matrix equations
- New convergence results on the global GMRES method for diagonalizable matrices
- Numerical solution of saddle point problems
- Oblique projection methods for linear systems with multiple right-hand sides
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- Regularized HSS iteration methods for saddle-point linear systems
- Some preconditiong techniques for saddle point problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
Cited in
(2)
This page was built for publication: Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5218404)