On evaluating elimination tree based parallel sparse cholesky factorizations (Q4955154)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1452879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On evaluating elimination tree based parallel sparse cholesky factorizations |
scientific article; zbMATH DE number 1452879 |
Statements
On evaluating elimination tree based parallel sparse cholesky factorizations (English)
0 references
14 June 2001
0 references
equivalent reordering
0 references
parallel computation
0 references
numerical examples
0 references
Cholesky factorization
0 references
sparse matrices
0 references
elimination tree
0 references
multifrontal method
0 references
0 references
0.849039614200592
0 references
0.8446680903434753
0 references
0.8355019092559814
0 references
The computation of the Cholesky factorization of sparse matrices by parallel methods is investigated. On the basis of the elimination tree model, the four widely adopted parallel methods -- the column-, row-, submatrix-Cholesky-, and multifrontal method -- are compared with respect to the computational costs. The theoretical result that the multifrontal method is superior to the other three Cholesky factorization methods is apparently confirmed by the experimental results.
0 references