Group :: Sciences/Mathematics
RPM: superlu_dist
Navigation
Main Changelog Spec Patches Sources Download Gear Bugs and FR Repocop
Current version: 2.3-alt1.M50.1
Build date: 19 may 2009, 10:16 ( 779.3 weeks ago )
Size: 1724.64 Kb
Home page: http://acts.nersc.gov/superlu/
License: BSD-like
Summary: Solve a sparse linear system A*X=B for distributed memory
Description:
List of contributors List of rpms provided by this srpm:
ACL:
Build date: 19 may 2009, 10:16 ( 779.3 weeks ago )
Size: 1724.64 Kb
Home page: http://acts.nersc.gov/superlu/
License: BSD-like
Summary: Solve a sparse linear system A*X=B for distributed memory
Description:
SuperLU_DIST contains a set of subroutines to solve a sparse linear system
A*X=B. It uses Gaussian elimination with static pivoting (GESP).
Static pivoting is a technique that combines the numerical stability of
partial pivoting with the scalability of Cholesky (no pivoting),
to run accurately and efficiently on large numbers of processors.
SuperLU_DIST is a parallel extension to the serial SuperLU library.
It is targeted for the distributed memory parallel machines.
SuperLU_DIST is implemented in ANSI C, and MPI for communications.
Currently, the LU factorization and triangular solution routines,
which are the most time-consuming part of the solution process,
are parallelized. The other routines, such as static pivoting and
column preordering for sparsity are performed sequentially.
This "alpha" release contains double-precision real and double-precision
complex data types.
Current maintainer: Eugeny A. Rostovtsev (REAL) A*X=B. It uses Gaussian elimination with static pivoting (GESP).
Static pivoting is a technique that combines the numerical stability of
partial pivoting with the scalability of Cholesky (no pivoting),
to run accurately and efficiently on large numbers of processors.
SuperLU_DIST is a parallel extension to the serial SuperLU library.
It is targeted for the distributed memory parallel machines.
SuperLU_DIST is implemented in ANSI C, and MPI for communications.
Currently, the LU factorization and triangular solution routines,
which are the most time-consuming part of the solution process,
are parallelized. The other routines, such as static pivoting and
column preordering for sparsity are performed sequentially.
This "alpha" release contains double-precision real and double-precision
complex data types.
List of contributors List of rpms provided by this srpm:
- libsuperlu_dist-devel
- libsuperlu_dist-devel-doc
- superlu_dist
- superlu_dist-examples