SuperLU_MT

Abstract

SuperLU_MT 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_MT is a parallel extension to the serial SuperLU library. SuperLU_MT is implemented in ANSI C, with multithreading extension, for example, using POSIX threads. Currently, only the LU factorization routine, which is the most time-consuming part of the solution process, is parallelized on machines with a shared address space. The other routines, such as column preordering and the forward and back substitutions are performed sequentially. This "alpha" release contains only double-precision real data type.

DateOfInformation

Mon Jan 4 09:20:05 1999

Domain

Math Libraries

Name

SuperLU_MT

TargetEnvironment

The following machine-specific SuperLU_MT/make.inc files are provided in the top-level directory: make.inc Platforms -------- --------- make.pthread Any machine that supports POSIX threads make.sun Sun Ultra Enterprise servers make.alpha DEC Alpha Servers make.sgi SGI Power Challenge make.origin SGI/Cray Origin2000 make.cray Cray C90/J90 For the systems other than listed above, some porting effort is needed for parallel factorization routines. Please refer to the Users' Guide for detailed instructions on porting.

Version

ALPHA

Webpage

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

ContactIs

Clay Breshears

Author(s)

James Demmel
John Gilbert
Xiaoye S. Li