Name
Abstract | ||
|---|---|---|
A well-known approach to computing the LU factorization of a general unsymmetric matrix A is to build the elimination tree associated with the pattern of the symmetric matrix A + AT and use it as a computational graph to drive the numerical factorization. This approach, although very efficient on a large range of unsymmetric matrices, does not capture the unsymmetric structure of the matrices. We introduce a new algorithm which detects and exploits the structural asymmetry of the submatrices involved during the processing of the elimination tree. We show that with the new algorithm, significant gains, both in memory and in time, to perform the factorization can be obtained. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1137/S0895479800375370 | SIAM Journal on Matrix Analysis and Applications |
Keywords | DocType | Volume |
well-known approach,computational graph,numerical factorization,general unsymmetric matrix,lu factorization,unsymmetric structure,new algorithm,elimination tree,unsymmetrized multifrontal lu factorization,unsymmetric matrix,symmetric matrix,fault tree analysis,linear equations,direct method | Journal | 24 |
Issue | ISSN | Citations |
2 | 0895-4798 | 18 |
PageRank | References | Authors |
2.18 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patrick R. Amestoy | 1 | 446 | 44.24 |
| Chiara Puglisi | 2 | 36 | 3.70 |