Группа :: Науки/Математика
Пакет: superlu_dist
Главная Изменения Спек Патчи Sources Загрузить Gear Bugs and FR Repocop
Текущая версия: 3.3-alt2
Время сборки: 16 ноября 2017, 13:41 ( 22.6 недели назад )
Размер архива: 1889.32 Kb
Домашняя страница: http://acts.nersc.gov/superlu/
Лицензия: BSD-like
О пакете: Solve a sparse linear system A*X=B for distributed memory
Описание:
Список всех майнтейнеров, принимавших участие
в данной и/или предыдущих сборках пакета: Список rpm-пакетов, предоставляемый данным srpm-пакетом:
ACL:
Время сборки: 16 ноября 2017, 13:41 ( 22.6 недели назад )
Размер архива: 1889.32 Kb
Домашняя страница: http://acts.nersc.gov/superlu/
Лицензия: BSD-like
О пакете: Solve a sparse linear system A*X=B for distributed memory
Описание:
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.
Текущий майнтейнер: Aleksei Nikiforov 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.
Список всех майнтейнеров, принимавших участие
в данной и/или предыдущих сборках пакета: Список rpm-пакетов, предоставляемый данным srpm-пакетом:
- libsuperlu_dist
- libsuperlu_dist-debuginfo
- libsuperlu_dist-devel-doc
- libsuperlu_dist-devel
- superlu_dist-examples-debuginfo
- superlu_dist-examples