Parents (Total: 67)

The searched file hash is included in 67 parent files which include package known and seen by metalookup. A sample is included below:

Key	Value
MD5	BF8AE40A56670A02B075C11C8591CF30
PackageArch	s390x
PackageDescription	Development files for superlu_dist-mpich
PackageMaintainer	Fedora Project
PackageName	superlu_dist-mpich-devel
PackageRelease	1.el8
PackageVersion	6.1.1
SHA-1	009B816FDD7BD21DA7DC07EB4F4759BC69635722
SHA-256	833D0F1AC431DEB8A7BA4B56784CA2524FF3084788F3CBD8B1AA6786B79189F0

Key	Value
MD5	EF46B34259228D0D794790980AF6B89A
PackageArch	armv7hl
PackageDescription	Development files for superlu_dist-mpich
PackageMaintainer	Fedora Project
PackageName	superlu_dist-mpich-devel
PackageRelease	6.fc33
PackageVersion	6.1.1
SHA-1	06BC390C233C72116EE6887F2304FC886DCB636F
SHA-256	793E071A453A513399A8A40A516C7FD2277BFF56D12C27769BDAAC1730FA45E8

Key	Value
FileSize	248932
MD5	8CD77955775F8308509AA0938310C2A3
PackageDescription	Highly distributed solution of sparse linear equations SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations. The library is written in C and is callable from either C or Fortran program. It uses MPI, OpenMP and CUDA to support various forms of parallelism. It supports both real and complex datatypes, both single and double precision, and 64-bit integer indexing. The library routines performs 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. . SuperLU_DIST implements the algorithms for distributed memory, targetting highly parallel distributed memory hybrid systems. The numerical factorization routines are already implemented for hybrid systems with multiple GPUs. Further work will be needed to implement the other phases of the algorithms on the hybrid systems and to enhance strong scaling to extreme scale. . This package provides development files for building client applications against superlu-dist.
PackageMaintainer	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuperlu-dist-dev
PackageSection	libdevel
PackageVersion	6.2.0+dfsg1-3
SHA-1	06EF6C80081ADB401970D82263ECAE1C3DF9ED48
SHA-256	F3FCDEE23F6198997440700DEC6C6FD2300C5E397CC7ED18DD5D388B307DCFA3

Key	Value
FileSize	248444
MD5	860E79FBD8392652D144104CA7BF1033
PackageDescription	Highly distributed solution of sparse linear equations SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations. The library is written in C and is callable from either C or Fortran program. It uses MPI, OpenMP and CUDA to support various forms of parallelism. It supports both real and complex datatypes, both single and double precision, and 64-bit integer indexing. The library routines performs 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. . SuperLU_DIST implements the algorithms for distributed memory, targetting highly parallel distributed memory hybrid systems. The numerical factorization routines are already implemented for hybrid systems with multiple GPUs. Further work will be needed to implement the other phases of the algorithms on the hybrid systems and to enhance strong scaling to extreme scale. . This package provides development files for building client applications against superlu-dist.
PackageMaintainer	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuperlu-dist-dev
PackageSection	libdevel
PackageVersion	6.2.0+dfsg1-3
SHA-1	0DAC01441CC956491FE12EE5851A56549C9330C3
SHA-256	AA405BD196DC7F7257B049756CAA90D9E00387EA0D3B00C7994862224DD33479

Key	Value
MD5	BA8EC78E0B2052DCFBCBCA7EECBB55C4
PackageArch	i686
PackageDescription	Development files for superlu_dist-openmpi
PackageMaintainer	Fedora Project
PackageName	superlu_dist-openmpi-devel
PackageRelease	7.fc34
PackageVersion	6.1.1
SHA-1	10D39B362654F19D600055BA8946572342DE6640
SHA-256	CAC4607C61D065DA60A602F7B2634A5119D5DEA7785EF66992FA75099E6DFF00

Key	Value
FileSize	26520
MD5	BCD74421BDBDDD38991F52E02ADF1C5E
PackageDescription	Highly distributed solution of sparse linear equations SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations. The library is written in C and is callable from either C or Fortran program. It uses MPI, OpenMP and CUDA to support various forms of parallelism. It supports both real and complex datatypes, both single and double precision, and 64-bit integer indexing. The library routines performs 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. . SuperLU_DIST implements the algorithms for distributed memory, targetting highly parallel distributed memory hybrid systems. The numerical factorization routines are already implemented for hybrid systems with multiple GPUs. Further work will be needed to implement the other phases of the algorithms on the hybrid systems and to enhance strong scaling to extreme scale. . This package provides development files for building client applications against superlu-dist.
PackageMaintainer	Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageName	libsuperlu-dist-dev
PackageSection	libdevel
PackageVersion	5.3.0+dfsg1-1
SHA-1	132ABB810FE5AE32DA07C72EF458FC991BC8F8DD
SHA-256	8DC028D739D74F128A75722E70F80820FCDFB1AECE78B9954B439C15FA8B6FD3

Key	Value
FileSize	245864
MD5	208C924DAEB4BCF68CD05E2159937759
PackageDescription	Highly distributed solution of sparse linear equations SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations. The library is written in C and is callable from either C or Fortran program. It uses MPI, OpenMP and CUDA to support various forms of parallelism. It supports both real and complex datatypes, both single and double precision, and 64-bit integer indexing. The library routines performs 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. . SuperLU_DIST implements the algorithms for distributed memory, targetting highly parallel distributed memory hybrid systems. The numerical factorization routines are already implemented for hybrid systems with multiple GPUs. Further work will be needed to implement the other phases of the algorithms on the hybrid systems and to enhance strong scaling to extreme scale. . This package provides development files for building client applications against superlu-dist.
PackageMaintainer	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuperlu-dist-dev
PackageSection	libdevel
PackageVersion	6.1.1+dfsg1-1
SHA-1	1786C5D9F8DB3F7B675D75A3949854C6DBB3F86E
SHA-256	541A6C20BDFF99D48B2B30124563E1E6D2358ACA7ADBF22A62A1D36C8800F152

Key	Value
FileSize	248948
MD5	8FE8A98301F2D5A99F0ABDF3F0671D71
PackageDescription	Highly distributed solution of sparse linear equations SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations. The library is written in C and is callable from either C or Fortran program. It uses MPI, OpenMP and CUDA to support various forms of parallelism. It supports both real and complex datatypes, both single and double precision, and 64-bit integer indexing. The library routines performs 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. . SuperLU_DIST implements the algorithms for distributed memory, targetting highly parallel distributed memory hybrid systems. The numerical factorization routines are already implemented for hybrid systems with multiple GPUs. Further work will be needed to implement the other phases of the algorithms on the hybrid systems and to enhance strong scaling to extreme scale. . This package provides development files for building client applications against superlu-dist.
PackageMaintainer	Debian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageName	libsuperlu-dist-dev
PackageSection	libdevel
PackageVersion	6.1.1+dfsg1-1
SHA-1	19DC65BA7910C435D93C710B31D2F6EA45315CA6
SHA-256	FCBC142C02D75319054B013033F81C2FCE6C990B13940E8589AF9BEFF4B50B65

Key	Value
MD5	28054B53DA982418F1CFE28D8B0632BC
PackageArch	s390x
PackageDescription	Development files for superlu_dist-openmpi
PackageMaintainer	Fedora Project
PackageName	superlu_dist-openmpi-devel
PackageRelease	1.el8
PackageVersion	6.1.1
SHA-1	1EB29A4916B2E0F23255E52655C02F7AF1E8BD76
SHA-256	C60358D26E54A8DC64327E5DE8ABE88D8DA315F997386FBFE8EF9737CFBA0BA2

Key	Value
MD5	4421FF1337D7D18B35FF467ED439EE5C
PackageArch	aarch64
PackageDescription	Development files for superlu_dist-openmpi
PackageMaintainer	Fedora Project
PackageName	superlu_dist-openmpi-devel
PackageRelease	7.fc34
PackageVersion	6.1.1
SHA-1	25ED8DA7C567034C74D1809164CDAEBC579E8C6F
SHA-256	42259C02F11EC6D25659CA3F3BCE7BC408AD7EB8213A46CDC6077475B17E9818