Name
Abstract | ||
|---|---|---|
In this paper, we introduce a supernode amalgamation algorithm which takes into account the characteristics of a hypermatrix data structure. The resulting frontal tree is then used to create a variable-sized partitioning of the hypermatrix. The sparse hypermatrix Cholesky factorization obtained runs slightly faster than the one which uses a fixed-sized partitioning. The algorithm also reduces data dependencies which limit exploitation of parallelism. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s11227-008-0188-y | The Journal of Supercomputing |
Keywords | DocType | Volume |
Sparse Cholesky factorization,Hypermatrix,Supernode amalgamation | Journal | 46 |
Issue | ISSN | Citations |
1 | 0920-8542 | 1 |
PageRank | References | Authors |
0.39 | 18 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| José R. Herrero | 1 | 94 | 16.90 |
| Juan J. Navarro | 2 | 323 | 42.90 |