New preconditioners based on symmetric-triangular decomposition for saddle point problems
From MaRDI portal
Let \[ {\mathcal A} = \begin{pmatrix} A & B \cr B^T & 0 \cr \end{pmatrix} \] be a matrix with a block structure that is typical for saddle-point problems. There are block triangular matrices \(\mathcal T\) and symmetric positive definite matrices \(\mathcal S\) such that \({\mathcal TA} = {\mathcal S} = {\mathcal LL}^T\). The matrices \(\mathcal T\) are called symmetric-triangular preconditioners and their spectral properties are studied.
Recommendations
- Block triangular preconditioners based on symmetric-triangular decomposition for generalized saddle point problems
- Block triangular preconditioners for generalized saddle point problems
- Block triangular preconditioners for symmetric saddle-point problems
- Symmetric-triangular decomposition and its applications. II: Preconditioners for indefinite systems
- Two block triangular preconditioners for asymmetric saddle point problems
Cites work
- A Preconditioning Technique for Indefinite Systems Resulting from Mixed Approximations of Elliptic Problems
- Algorithm 866
- Combination Preconditioning and the Bramble–Pasciak$^{+}$ Preconditioner
- scientific article; zbMATH DE number 5773713 (Why is no real title available?)
- scientific article; zbMATH DE number 961471 (Why is no real title available?)
- Methods of conjugate gradients for solving linear systems
- Mixed and Hybrid Finite Element Methods
- Modified ST algorithms and numerical experiments
- Numerical methods for generalized least squares problems
- Numerical solution of saddle point problems
- Numerical validation of solutions of saddle point matrix equations
- On generalized successive overrelaxation methods for augmented linear systems
- On parameterized inexact Uzawa methods for generalized saddle point problems
- Preconditioning saddle-point systems with applications in optimization
- Restrictively preconditioned conjugate gradient methods for systems of linear equations
- Row-wise algorithms of ST decomposition
- Stability of Augmented System Factorizations in Interior-Point Methods
- Symmetric-triangular decomposition and its applications. I: Theorems and algorithms
- Symmetric-triangular decomposition and its applications. II: Preconditioners for indefinite systems
- Validated Solutions of Saddle Point Linear Systems
Cited in
(15)- Block triangular preconditioners for symmetric saddle-point problems
- Block symmetric-triangular preconditioners for generalized saddle point linear systems from piezoelectric equations
- Combination of augmented Lagrangian technique and ST preconditioner for saddle point problems
- A new constraint preconditioner based on the PGSS iteration method for non-Hermitian generalized saddle point problems
- Block triangular preconditioners based on symmetric-triangular decomposition for generalized saddle point problems
- The PPS method-based constraint preconditioners for generalized saddle point problems
- Spectral analysis of the matrix splitting preconditioner for block two-by-two linear systems
- New preconditioners for saddle point problems
- Symmetric-triangular decomposition and its applications. II: Preconditioners for indefinite systems
- On the restrictively preconditioned conjugate gradient method for solving saddle point problems
- Block triangular preconditioners for generalized saddle point problems
- Block triangular preconditioner for static Maxwell equations
- New perturbation bounds analysis of a kind of generalized saddle point systems
- A class of preconditioners based on symmetric-triangular decomposition and matrix splitting for generalized saddle point problems
- Two block product-type preconditioners for double saddle point problems
This page was built for publication: New preconditioners based on symmetric-triangular decomposition for saddle point problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644879)
