SuperLU

Abstract

SuperLU contains a set of subroutines to solve a sparse linear system A*X=B. It uses Gaussian elimination with partial pivoting (GEPP). The columns of A may be preordered before factorization; the preordering for sparsity is completely separate from the factorization. SuperLU is implemented in ANSI C, and must be compiled with standard ANSI C compilers. It provides functionality for both real and complex matrices, in both single and double precision.

DateOfInformation

Mon Jan 4 09:19:18 1999

Domain

Math Libraries

Name

SuperLU

TargetEnvironment

Example machine-specific SuperLU/make.inc include files are provided in the top-level SuperLU/ directory for several systems, such as IBM RS/6000, DEC Alpha, SunOS 4.x, SunOS 5.x (Solaris), HP-PA and SGI Iris 4.x. For the systems other than listed above, slight modifications to the make.inc file will need to be made

Version

1.1

Webpage

http://http.cs.berkeley.edu/~xiaoye/superlu.html

ContactIs

Clay Breshears

Author(s)

James Demmel
John Gilbert
Xiaoye S. Li