Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
From MaRDI portal
Publication:780387
Recommendations
- A preconditioned GLHSS iteration method for non-Hermitian singular saddle point problems
- Efficient HSS-based preconditioners for generalized saddle point problems
- A generalized relaxed positive-definite and skew-Hermitian splitting preconditioner for non-Hermitian saddle point problems
- Parameterized generalized shift-splitting preconditioners for nonsymmetric saddle point problems
- A preconditioned HSS-like iterative method for saddle point problems
Cites work
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- A Note on Preconditioning for Indefinite Linear Systems
- A generalized variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems
- A new relaxed HSS preconditioner for saddle point problems
- A preconditioned MINRES method for nonsymmetric Toeplitz matrices
- A variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems
- Algebraic properties of the block GMRES and block Arnoldi methods
- Algorithm 866
- Analysis of iterative methods for saddle point problems: A unified approach
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- Augmentation block preconditioners for saddle point-type matrices with singular \((1,1)\) blocks
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- Combination Preconditioning and the Bramble–Pasciak$^{+}$ Preconditioner
- Combination preconditioning of saddle point systems for positive definiteness.
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Efficient solution of large-scale saddle point systems arising in Riccati-based boundary feedback stabilization of incompressible Stokes flow
- Efficient solvers for a linear stochastic Galerkin mixed formulation of diffusion problems with random data
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Global FOM and GMRES algorithms for matrix equations
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Natural preconditioning and iterative methods for saddle point systems
- New convergence results on the global GMRES method for diagonalizable matrices
- Numerical solution of saddle point problems
- On parameterized block triangular preconditioners for generalized saddle point problems
- On parameterized inexact Uzawa methods for generalized saddle point problems
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- On the eigenvalues of a class of saddle point matrices
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- Preconditioning steady-state Navier-Stokes equations with random data
- Projected Krylov methods for saddle-point systems
- Regularized HSS iteration methods for saddle-point linear systems
- Some preconditiong techniques for saddle point problems
- Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
Cited in
(3)- Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
- Efficient HSS-based preconditioners for generalized saddle point problems
- Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis
This page was built for publication: Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q780387)
