Name
Abstract | ||
|---|---|---|
We investigate several ways to improve the performance of sparse LU factorization with partial pivoting, as used to solve unsymmetric linear systems. We introduce the notion of unsymmetric supernodes to perform most of the numerical computation in dense matrix kernels. We introduce unsymmetric supernode-panel updates and two-dimensional data partitioning to better exploit the memory hierarchy. We use Gilbert and Peierls's depth-first search with Eisenstat and Liu's symmetric structural reductions to speed up symbolic factorization. We have developed a sparse LU code using all these ideas. We present experiments demonstrating that it is significantly faster than earlier partial pivoting codes. We also compare its performance with UMFPACK, which uses a multifrontal approach; our code is very competitive in time and storage requirements, especially for large problems. |
Year | DOI | Venue |
|---|---|---|
1999 | 10.1137/S0895479895291765 | SIAM Journal on Matrix Analysis and Applications |
Keywords | DocType | Volume |
partial pivoting code,unsymmetric supernodes,unsymmetric supernode-panel updates,depth-first search,supernodal approach,dense matrix kernel,symbolic factorization,unsymmetric linear system,sparse partial pivoting,sparse lu code,partial pivoting,sparse lu factorization | Journal | 20 |
Issue | ISSN | Citations |
3 | 0895-4798 | 214 |
PageRank | References | Authors |
19.39 | 16 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| James Demmel | 1 | 4817 | 551.47 |
| Stanley C. Eisenstat | 2 | 870 | 255.64 |
| John R. Gilbert | 3 | 2369 | 308.81 |
| Xiaoye S. Li | 4 | 1042 | 98.22 |
| Joseph W. H. Liu | 5 | 829 | 217.74 |