Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
From MaRDI portal
Publication:780387
DOI10.1007/s11075-019-00833-4zbMath1452.65055OpenAlexW2982970066WikidataQ126806682 ScholiaQ126806682MaRDI QIDQ780387
Publication date: 15 July 2020
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-019-00833-4
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) Preconditioners for iterative methods (65F08)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A variant of the deteriorated PSS preconditioner for nonsymmetric saddle point problems
- A new relaxed HSS preconditioner for saddle point problems
- On parameterized inexact Uzawa methods for generalized saddle point problems
- New convergence results on the global GMRES method for diagonalizable matrices
- Algebraic properties of the block GMRES and block Arnoldi methods
- On parameterized block triangular preconditioners for generalized saddle point problems
- 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
- On the choice of preconditioner for minimum residual methods for non-Hermitian matrices
- On the eigenvalues of a class of saddle point matrices
- Convergence properties of some block Krylov subspace methods for multiple linear systems
- Analysis of the convergence of the minimal and the orthogonal residual methods
- Analysis of iterative methods for saddle point problems: a unified approach
- Natural Preconditioning and Iterative Methods for Saddle Point Systems
- Efficient Solution of Large-Scale Saddle Point Systems Arising in Riccati-Based Boundary Feedback Stabilization of Incompressible Stokes Flow
- Combination preconditioning of saddle point systems for positive definiteness
- Numerical solution of saddle point problems
- Symmetric Indefinite Preconditioners for Saddle Point Problems with Applications to PDE-Constrained Optimization Problems
- Algorithm 866
- Efficient Solvers for a Linear Stochastic Galerkin Mixed Formulation of Diffusion Problems with Random Data
- Augmentation block preconditioners for saddle point-type matrices with singular (1, 1) blocks
- Combination Preconditioning and the Bramble–Pasciak$^{+}$ Preconditioner
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- A Note on Preconditioning for Indefinite Linear Systems
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Preconditioning Steady-State Navier--Stokes Equations with Random Data
- Projected Krylov Methods for Saddle-Point Systems
- A Preconditioned MINRES Method for Nonsymmetric Toeplitz Matrices
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
