A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems (Q2784387)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems |
scientific article; zbMATH DE number 1732278
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems |
scientific article; zbMATH DE number 1732278 |
Statements
23 April 2002
0 references
linear sparse systems
0 references
saddle-point problems
0 references
direct methods
0 references
LDL\(^T\) decomposition
0 references
ordering of unknowns
0 references
numerical experiments
0 references
Schur complement
0 references
0.9071365
0 references
0 references
0.8628592
0 references
0.86027133
0 references
0.8577895
0 references
0.8566588
0 references
0.85570204
0 references
0.85496354
0 references
A note on the LDL\(^{T}\) decomposition of matrices from saddle-point problems (English)
0 references
The paper is devoted to theory of direct methods for linear systems \(Ax=b\) with a nonsingular and symmetric matrix \(A\) whose block structure is typical for saddle-point problems. The author is interested in such orderings of unknowns that LDL\(^T\) decomposition of the corresponding matrix \(A\) exists and lead to certain ``minization properties'' of the amount of fill-in in the coefficients.NEWLINENEWLINEThe investigation is based on the use of the basic graph theory. The suggested ordering strategy was examined in numerical experiments (the number of the unknowns is not specified) and the author writes that the solution procedure was superior to the Schur complement procedure.
0 references
