New approach for solving sequences of saddle-point linear systems
From MaRDI portal
Cites work
- A comparative study of null-space factorizations for sparse symmetric saddle point systems.
- A Note on Preconditioning for Indefinite Linear Systems
- Algorithm 866
- Block-Diagonal and Constraint Preconditioners for Nonsymmetric Indefinite Linear Systems. Part I: Theory
- Block-triangular preconditioners for PDE-constrained optimization
- Constraint preconditioners for symmetric indefinite matrices
- Constraint Preconditioning for Indefinite Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2221749 (Why is no real title available?)
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- New convergence results on the global GMRES method for diagonalizable matrices
- Null-space preconditioners for saddle point systems
- Numerical solution of saddle point problems
- Oblique projection methods for linear systems with multiple right-hand sides
- Optimal solvers for PDE-constrained optimization
- Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
- Preconditioned nullspace method for the two-dimensional Oseen problem
- Preconditioning techniques for a mixed Stokes/Darcy model in porous medium applications
- Regularized preconditioned GMRES and the regularized iteration method
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
This page was built for publication: New approach for solving sequences of saddle-point linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6875695)