Synonyms
Definition
SuperLU is a general-purpose library for the solution of large, sparse, nonsymmetric systems of linear equations using direct methods. The routines perform LU decomposition with numerical pivoting and solve the triangular systems through forward and back substitution. Iterative refinement routines are provided for improved backward stability. Routines are also provided to equilibrate the system, to reorder the columns to preserve sparsity of the factored matrices, to estimate the condition number, to calculate the relative backward error, to estimate error bounds for the refined solutions, and to perform threshold-based incomplete LU factorization (ILU), which can be used as a preconditioner for iterative solvers. The algorithms are carefully designed and implemented so that they achieve excellent performance on modern high-performance machines, including shared-memory and distributed-memory multiprocessors.
Discussion
Introduction
SuperLU...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Barrett R, Berry M, Chan TF, Demmel J, Donato J, Dongarra J, Eijkhout V, Pozo R, Romine C, van der Vorst H (1994) Templates for the solution of linear systems: building blocks for the iterative methods. SIAM, Philadelphia, PA
Davis TA, Gilbert JR, Larimore S, Ng E (2004) A column approximate minimum degree ordering algorithm. ACM Trans Math Softw 30(3):353–376
Demmel JW, Eisenstat SC, Gilbert JR, Li XS, Liu JWH (1999) A supernodal approach to sparse partial pivoting. SIAM J Matrix Anal Appl 20(3):720–755
Demmel JW, Gilbert JR, Li XS (1999) An asynchronous parallel supernodal algorithm for sparse gaussian elimination. SIAM J Matrix Anal Appl 20(4):915–952
Demmel JW, Gilbert JR, Li XS (1999) SuperLU users’ guide. technical report LBNL-44289, Lawrence Berkeley National Laboratory, September 1999. http://crd.lbl.gov/~xiaoye/SuperLU/ Last update: September 2007
Duff IS, Koster J (1999) The design and use of algorithms for permuting large entries to the diagonal of sparse matrices. SIAM J Matrix Anal Appl 20(4):889–901
BLAS Technical Forum (2002) Basic Linear Algebra Subprograms Technical (BLAST) Forum Standard I. Int J High Perform Comput Appl 16:1–111
BLAS Technical Forum (2002) Basic Linear Algebra Subprograms Technical (BLAST) Forum Standard II. Int J High Perform Comput Appl 16:115–199
George A, Liu J, Ng E (1988) A data structure for sparse QR and LU factorizations. SIAM J Sci Stat Comput 9:100–121
Gilbert JR, Ng E (1993) Predicting structure in nonsymmetric sparse matrix factorizations. In: George A, Gilbert JR, Liu JWH (eds) Graph theory and sparse matrix computation. Springer-Verlag, New York, pp 107–139
Grigori L, Demmel J, Xiang H (2008) Communication-avoiding Gaussian elimination. In: Supercomputing 08, Austin, TX, November 15–21, 2008.
Grigori L, Demmel JW, Li XS (2007) Parallel symbolic factorization for sparse LU with static pivoting. SIAM J Sci Comput 29(3):1289–1314
Gu M, Li XS, Vassilevski P (2010) Direction-preserving and schur-monotonic semi-separable approximations of symmetric positive definite matrices. SIAM J Matrix Anal Appl 31(5):2650–2664
Karypis G, Kumar V (1998) MeTiS – a software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices – version 4.0. University of Minnesota, September 1998. http://www-users.cs.umn.edu/~karypis/metis/ Accessed 2010
Karypis G, Schloegel K, Kumar V (2003) ParMeTiS: Parallel graph partitioning and sparse matrix ordering library – version 3.1. University of Minnesota. http://www-users.cs.umn.edu/~karypis/ metis/parmetis/ Accessed 2010
Li XS (2008) Evaluation of sparse factorization and triangular solution on multicore architectures. In: Proceedings of VECPAR08 8th international meeting high performance computing for computational science, Toulouse, France, June 24–27, 2008
Li XS (Sept 2005) An overview of SuperLU: algorithms, implementation, and user interface. ACM Trans Math Softw 31(3): 302–325
Li XS (2009) Sparse direct methods on high performance computers. University of California, Berkeley, CS267 Lecture Notes
Li XS, Demmel JW (June 2003) SuperLU DIST: a scalable distributed-memory sparse direct solver for unsymmetric linear systems. ACM Trans Math Softw 29(2):110–140
Li XS, Shao M (2011) A supernodal approach to imcomplete LU factorization with partial pivoting. ACM Trans Math Softw 37(4)
Liu JWH (1985) Modification of the minimum degree algorithm by multiple elimination. ACM Trans Math Softw 11:141–153
Xia J, Chandrasekaran S, Gu M, Li XS (2009) Superfast multifrontal method for large structured linear systems of equations. SIAM J Matrix Anal Appl 2008, 31(3):1382–1411
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Li, X.S., Demmel, J., Gilbert, J., Grigori, L., Shao, M. (2011). SuperLU. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_95
Download citation
DOI: https://doi.org/10.1007/978-0-387-09766-4_95
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-09765-7
Online ISBN: 978-0-387-09766-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering