Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis
From MaRDI portal
Publication:3390773
DOI10.22067/IJNAO.2021.71036.1044zbMATH Open1482.65056OpenAlexW3193288186MaRDI QIDQ3390773FDOQ3390773
A. Taherian, Faezeh Toutounian
Publication date: 25 March 2022
Full work available at URL: https://ijnao.um.ac.ir/article_40458.html
Recommendations
- Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
- Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis
- Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
- A new family of global methods for linear systems with multiple right-hand sides
- A Preconditioned Iterative Method for Saddlepoint Problems
convergence analysissaddle point problemsmultiple right-hand sidesindefinite preconditioningpreconditioned global GPBiCG
Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Cites Work
- Symmetric-triangular decomposition and its applications. II: Preconditioners for indefinite systems
- The university of Florida sparse matrix collection
- Numerical Optimization
- Title not available (Why is that?)
- Mixed and Hybrid Finite Element Methods
- On generalized successive overrelaxation methods for augmented linear systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- SOR-like methods for augmented systems
- Block triangular preconditioners for symmetric saddle-point problems
- Preconditioned Hermitian and skew-Hermitian splitting methods for non-Hemitian positive semidefinite linear systems
- Shift-splitting preconditioners for saddle point problems
- New preconditioners for saddle point problems
- A new SOR-like method for the saddle point problems
- Constraint preconditioners for symmetric indefinite matrices
- Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems
- Constraint Preconditioning for Indefinite Linear Systems
- A Note on Preconditioning for Indefinite Linear Systems
- A Preconditioner for Generalized Saddle Point Problems
- Spectral Properties of the Hermitian and Skew-Hermitian Splitting Preconditioner for Saddle Point Problems
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- Uzawa type algorithms for nonsymmetric saddle point problems
- An Accelerated SOR-Like Method for Generalised Saddle Point Problems
- Block-Diagonal and Constraint Preconditioners for Nonsymmetric Indefinite Linear Systems. Part I: Theory
- Some generalizations of the new SOR-like method for solving symmetric saddle-point problems
- A generalized shift-splitting preconditioner for saddle point problems
- Positive stable block triangular preconditioners for symmetric saddle point problems
- Variants of the Uzawa method for saddle point problem
- Title not available (Why is that?)
- A note on an SOR-like method for augmented systems
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- Linear Algebra Methods in a Mixed Approximation of Magnetostatic Problems
- New convergence results on the global GMRES method for diagonalizable matrices
- On parameterized block triangular preconditioners for generalized saddle point problems
- Global GPBiCG method for complex non-Hermitian linear systems with multiple right-hand sides
- Oblique projection methods for linear systems with multiple right-hand sides
- Title not available (Why is that?)
- Some preconditiong techniques for saddle point problems
- A new relaxed HSS preconditioner for saddle point problems
- Projected Krylov Methods for Saddle-Point Systems
- Regularized HSS iteration methods for saddle-point linear systems
- Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
- Block GPBi-CG method for solving nonsymmetric linear systems with multiple right-hand sides and its convergence analysis
- Title not available (Why is that?)
- Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
Cited In (3)
- Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides
- On an inversion-free algorithm for the nonlinear matrix problem Xα+A∗X−βA+B∗X−γB=I,
- Error and stability estimates of a time-fractional option pricing model under fully spatial-temporal graded meshes
Uses Software
This page was built for publication: Preconditioned global GPBiCG method for solving saddle point problems with multiple right-hand sides and its convergence analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3390773)
