Bug#265217: ITP: superlu -- Subroutines to solve a sparse linear system A*X=B

[Christophe Prud'homme <prudhomm@mit.edu>]

Package: wnpp
Severity: wishlist


* Package name    : superlu
  Version         : 3.0
  Upstream Author : Xiaoye S. Li <xsli@lbl.gov>, James W. Demmel, John R.
  Gilbert
* URL             : http://crd.lbl.gov/~xiaoye/SuperLU/
* License         : Public Domain
  Description     : Subroutines to solve a sparse linear system A*X=B

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. 

-- System Information:
Debian Release: 3.1
Architecture: amd64 (x86_64)
Kernel: Linux 2.6.7-5-amd64-k8-smp
Locale: LANG=fr_FR, LC_CTYPE=fr_FR