Exact prediction of QR fill-in by row-merge trees (Q2706477)
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: Exact prediction of QR fill-in by row-merge trees |
scientific article; zbMATH DE number 1579085
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact prediction of QR fill-in by row-merge trees |
scientific article; zbMATH DE number 1579085 |
Statements
19 March 2001
0 references
row-merge trees
0 references
elimination trees
0 references
sparse QR factorization
0 references
Householder reflectors
0 references
Exact prediction of QR fill-in by row-merge trees (English)
0 references
The author presents a fast and simple postprocessing step for row-merge trees that predicts the exact fill-in for sparse QR factorization using Householder reflectors for general matrices.
0 references
