Symbolic factorization for sparse Gaussian elimination with partial pivoting
SIAM Journal on Scientific and Statistical Computing
A data structure for sparse QR and LU factorizations
SIAM Journal on Scientific and Statistical Computing - Telecommunication Programs at U.S. Universities
Exploiting structural symmetry in unsymmetric sparse symbolic factorization
SIAM Journal on Matrix Analysis and Applications
Modification of the minimum-degree algorithm by multiple elimination
ACM Transactions on Mathematical Software (TOMS)
An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Applied numerical linear algebra
Applied numerical linear algebra
A Supernodal Approach to Sparse Partial Pivoting
SIAM Journal on Matrix Analysis and Applications
LAPACK Users' guide (third ed.)
LAPACK Users' guide (third ed.)
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
SIAM Journal on Matrix Analysis and Applications
An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination
SIAM Journal on Matrix Analysis and Applications
Making sparse Gaussian elimination scalable by static pivoting
SC '98 Proceedings of the 1998 ACM/IEEE conference on Supercomputing
Accuracy and Stability of Numerical Algorithms
Accuracy and Stability of Numerical Algorithms
Design, implementation and testing of extended and mixed precision BLAS
ACM Transactions on Mathematical Software (TOMS)
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
A new scheduling algorithm for parallel sparse LU factorization with static pivoting
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems
ACM Transactions on Mathematical Software (TOMS)
SuperLU Users'' Guide
A column approximate minimum degree ordering algorithm
ACM Transactions on Mathematical Software (TOMS)
ACM Transactions on Graphics (TOG)
Evaluation of Sparse LU Factorization and Triangular Solution on Multicore Platforms
High Performance Computing for Computational Science - VECPAR 2008
FPGA accelerated parallel sparse matrix factorization for circuit simulations
ARC'11 Proceedings of the 7th international conference on Reconfigurable computing: architectures, tools and applications
Design of a Multicore Sparse Cholesky Factorization Using DAGs
SIAM Journal on Scientific Computing
VBARMS: A variable block algebraic recursive multilevel solver for sparse linear systems
Journal of Computational and Applied Mathematics
| Hi-index | 0.00 |
We give an overview of the algorithms, design philosophy, and implementation techniques in the software SuperLU, for solving sparse unsymmetric linear systems. In particular, we highlight the differences between the sequential SuperLU (including its multithreaded extension) and parallel SuperLU_DIST. These include the numerical pivoting strategy, the ordering strategy for preserving sparsity, the ordering in which the updating tasks are performed, the numerical kernel, and the parallelization strategy. Because of the scalability concern, the parallel code is drastically different from the sequential one. We describe the user interfaces of the libraries, and illustrate how to use the libraries most efficiently depending on some matrix characteristics. Finally, we give some examples of how the solver has been used in large-scale scientific applications, and the performance.