Group :: Ciências/Matemática
RPM: superlu_dist
Navegação
Principal Changelog Spec Patches Sources Download Gear Bugs e FR Repocop
A versão atual: 2.3-alt1.M50.1
Data da compilação: 19 maio 2009, 10:16 ( 780.5 weeks ago )
Tamanho:: 1724.64 Kb
Home page: http://acts.nersc.gov/superlu/
Licença: BSD-like
Sumário: Solve a sparse linear system A*X=B for distributed memory
Descrição:
Lista dos contribuidores Lista dos rpms provida por esta srpm:
ACL:
Data da compilação: 19 maio 2009, 10:16 ( 780.5 weeks ago )
Tamanho:: 1724.64 Kb
Home page: http://acts.nersc.gov/superlu/
Licença: BSD-like
Sumário: Solve a sparse linear system A*X=B for distributed memory
Descrição:
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.
Mantenedor currente: 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.
Lista dos contribuidores Lista dos rpms provida por esta srpm:
- libsuperlu_dist-devel
- libsuperlu_dist-devel-doc
- superlu_dist
- superlu_dist-examples