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

From MaRDI portal





scientific article; zbMATH DE number 5968782
Language Label Description Also known as
default for all languages
No label defined
    English
    New preconditioners based on symmetric-triangular decomposition for saddle point problems
    scientific article; zbMATH DE number 5968782

      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
      0 references
      conjugate gradient method: saddle point problem
      0 references
      precondioning
      0 references

      Identifiers