New preconditioners based on symmetric-triangular decomposition for saddle point problems (Q644879)

From MaRDI portal
Revision as of 14:36, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New preconditioners based on symmetric-triangular decomposition for saddle point problems
scientific article

    Statements

    New preconditioners based on symmetric-triangular decomposition for saddle point problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 November 2011
    0 references
    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.
    0 references
    conjugate gradient method: saddle point problem
    0 references
    precondioning
    0 references

    Identifiers