Result for 1EFBE7143FF23907D16A6B790017997198E50350

Query result

Key Value
FileName./usr/lib/x86_64-linux-gnu/superlu-dist/tests/EXAMPLE/README
FileSize2210
MD5D4B87D9C807A7CC502D615025014FD9A
SHA-11EFBE7143FF23907D16A6B790017997198E50350
SHA-256C324EF681D000A9E10EEDD70E878B3C72B9B5D0F5E38419898CE849B429ECD2A
SSDEEP24:GgERheEEMbMSxdjnZiI7ZlI2FoTL3TxCtF5ndUdtFKtTYlXEjeQoH6sxv/4O94g1:YRQE9dHi2GHtCJuo6XEU6sll1vARZ4v
TLSHT133411506934D8E30C332925AF28F058B6AEA542A539B4E707CECC17C2F1275D55B2BD2
hashlookup:parent-total24
hashlookup:trust100

Network graph view

Parents (Total: 24)

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

Key Value
FileSize248932
MD58CD77955775F8308509AA0938310C2A3
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.2.0+dfsg1-3
SHA-106EF6C80081ADB401970D82263ECAE1C3DF9ED48
SHA-256F3FCDEE23F6198997440700DEC6C6FD2300C5E397CC7ED18DD5D388B307DCFA3
Key Value
FileSize248444
MD5860E79FBD8392652D144104CA7BF1033
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.2.0+dfsg1-3
SHA-10DAC01441CC956491FE12EE5851A56549C9330C3
SHA-256AA405BD196DC7F7257B049756CAA90D9E00387EA0D3B00C7994862224DD33479
Key Value
MD5B50FF47360C459C45733C34632602EA7
PackageArchnoarch
PackageDescriptionDocumentation for superlu_dist
PackageMaintainerFedora Project
PackageNamesuperlu_dist-doc
PackageRelease7.fc34
PackageVersion6.1.1
SHA-116D886FCCCFFBCC1D3DABE4491E729624A3A0202
SHA-256009247AC45B2BE891C8294DBA7C881C70DA07A77E577B5EC63AABA85667B1762
Key Value
FileSize245864
MD5208C924DAEB4BCF68CD05E2159937759
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.1.1+dfsg1-1
SHA-11786C5D9F8DB3F7B675D75A3949854C6DBB3F86E
SHA-256541A6C20BDFF99D48B2B30124563E1E6D2358ACA7ADBF22A62A1D36C8800F152
Key Value
FileSize248948
MD58FE8A98301F2D5A99F0ABDF3F0671D71
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.1.1+dfsg1-1
SHA-119DC65BA7910C435D93C710B31D2F6EA45315CA6
SHA-256FCBC142C02D75319054B013033F81C2FCE6C990B13940E8589AF9BEFF4B50B65
Key Value
FileSize246704
MD5DD02D3603F145F30EFF89DE8E5873C00
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.2.0+dfsg1-3
SHA-14ED79FE76A48F9C9494F8ED20060259933545A73
SHA-2563D5119DB9E6DA14FF06D578653C8DA57A178C636B19BA6B19CC7BBA3D1C31707
Key Value
FileSize246680
MD52824382A66B28A9103D8E803C12BD240
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.2.0+dfsg1-3
SHA-15AED5A7E70DF9EE1FA3013D64E636943ED9A01FE
SHA-25642C5FAE0485D9C5F4047DAD8350BEBE9AB663A60E1A08F05D558C06D1E12BF40
Key Value
FileSize248164
MD5AD3C16271C530F438785EFE065243014
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.2.0+dfsg1-3
SHA-15BA5A8ABBF7D8214027DE7CBAD083BA3E667C4BE
SHA-25667782E4CB1B5570426E040750E902D27AEE409AF58571C7FF9D4B51FA6AC286B
Key Value
FileSize252744
MD59E1E8BC41E239624EF2E405F33B6A0E6
PackageDescriptionHighly 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.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.1.1+dfsg1-1
SHA-15E1FD06D9C138065456BD7EFD34404002EBBA804
SHA-2565D37CFEB93D1A37C71F7EA33F757FDD62EFD28003B7D589E5617B5D72CB10861
Key Value
FileSize249968
MD5FDFF68EC9B49DC02591709245CD81600
PackageDescriptionHighly 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibsuperlu-dist-dev
PackageSectionlibdevel
PackageVersion6.2.0+dfsg1-3build1
SHA-16479DD656738C66882E7DAF788276CA6EBBB1485
SHA-256A5AEB77DB755BC59215D059D8681288F56A8FC7B2813ADDAD0046B46A32E2635