SuperLU

(Supernodal LU)

Copyright and License

SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions.

SuperLU package comes in three different flavors:

FAQ

The Users' Guide (Tech report LBNL-44289) describes all three libraries. (Last update: October 2011)

How to Cite SuperLU in a publication.

User Mailing List is used to announce changes, new releases, etc.

Please send email if you have used any versions of the library.

This is my survey article about sparse direct solvers of various flavours.

Usage of SuperLU (page is under construction)

This project has been funded by DOE, NSF and DARPA.

Developers:
     X. Sherry Li
     Jim Demmel
     John Gilbert
     Laura Grigori
     Meiyue Shao
     Ichitaro Yamazaki

Other Contributors:
     Pietro Cicotti, UCSD
     Daniel Schreiber
     Jinqchong Teo
     Yu Wang
     Eric Zhang, Albany High



SuperLU Version 4.3



SuperLU_MT Version 2.1



SuperLU_DIST Version 3.3


FastCounter by LinkExchange