New preconditioners based on symmetric-triangular decomposition for saddle point problems (Q644879): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00607-011-0150-3 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2019490405 / rank | |||
Normal rank |
Revision as of 00:52, 20 March 2024
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
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