Preordering saddle‐point systems for sparse <i>L</i><i>D</i><i>L</i><sup><i>T</i></sup> factorization without pivoting (Q4558715)
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: Preordering saddle‐point systems for sparse LDLT factorization without pivoting |
scientific article; zbMATH DE number 6987001
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Preordering saddle‐point systems for sparse <i>L</i><i>D</i><i>L</i><sup><i>T</i></sup> factorization without pivoting |
scientific article; zbMATH DE number 6987001 |
Statements
Preordering saddle‐point systems for sparse <i>L</i><i>D</i><i>L</i><sup><i>T</i></sup> factorization without pivoting (English)
0 references
29 November 2018
0 references
fill-reducing ordering
0 references
\(LDL^T\)-factorization
0 references
saddle-point systems
0 references
sparse symmetric indefinite matrices
0 references
0.8740337
0 references
0.86437386
0 references
0.8625198
0 references
0.8618542
0 references
0.86089444
0 references
0.85949725
0 references
0.8592223
0 references
0.85880786
0 references
0.8587345
0 references
