Group :: Sciences/Mathematics
RPM: superlu
Navigation
Main Changelog Spec Patches Sources Download Gear Bugs and FR Repocop
Current version: 3.1-alt1.M50.1
Build date: 19 may 2009, 10:36 ( 779.7 weeks ago )
Size: 1782.18 Kb
Home page: http://acts.nersc.gov/superlu/
License: BSD-like
Summary: A set of subroutines to solve a sparse linear system A*X=B
Description:
List of contributors List of rpms provided by this srpm:
ACL:
Build date: 19 may 2009, 10:36 ( 779.7 weeks ago )
Size: 1782.18 Kb
Home page: http://acts.nersc.gov/superlu/
License: BSD-like
Summary: A set of subroutines to solve a sparse linear system A*X=B
Description:
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 provides functionality for both real and complex matrices, in both
single and double precision.
Current maintainer: Eugeny A. Rostovtsev (REAL) 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 provides functionality for both real and complex matrices, in both
single and double precision.
List of contributors List of rpms provided by this srpm:
- libsuperlu-devel
- libsuperlu-devel-doc
- superlu