Computing row and column counts for sparse \(QR\) and \(LU\) factorization (Q5960909)
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: Computing row and column counts for sparse QR and LU factorization |
scientific article; zbMATH DE number 1731132
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing row and column counts for sparse \(QR\) and \(LU\) factorization |
scientific article; zbMATH DE number 1731132 |
Statements
Computing row and column counts for sparse \(QR\) and \(LU\) factorization (English)
0 references
19 September 2002
0 references
column elimination tree
0 references
row and column counts
0 references
disjoint set union
0 references
algorithms
0 references
sparse matrix
0 references
QR factorization
0 references
LU factorization
0 references
partial pivoting
0 references
sparse Cholesky factorization
0 references
0.8440630435943604
0 references
0.8440630435943604
0 references
0.8095829486846924
0 references
0.7995615601539612
0 references
