Result for F455530B59B5A3BAB605788B3462CC13D7C3B33F

Query result

Key Value
FileName./usr/share/doc/libsuperlu-dist5/copyright
FileSize2081
MD5C0E2BBE2BD0F953DF0BF7339F0E637CE
SHA-1F455530B59B5A3BAB605788B3462CC13D7C3B33F
SHA-256F3C4953FD1073BD65495C51D4875EE8EF03FDDA45BA9653AD00C827DAA2DC465
SSDEEP48:Sbg+4AelWJOlJGJzFAZZ37P9vs432sr32scMEtu33tYTHv:SbTlXclJGJziZxRX3/3jp2P
TLSHT1AE41D79352841FE656F22782947A76C4B10DD01D3BB7BE01BCADF1D52B7B82DC872451
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
FileSize26520
MD5BCD74421BDBDDD38991F52E02ADF1C5E
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
PackageVersion5.3.0+dfsg1-1
SHA-1132ABB810FE5AE32DA07C72EF458FC991BC8F8DD
SHA-2568DC028D739D74F128A75722E70F80820FCDFB1AECE78B9954B439C15FA8B6FD3
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
FileSize330816
MD5B9E107EB466857CCF5B1BD997BEF41D4
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 the superlu-dist shared library.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist6
PackageSectionlibs
PackageVersion6.1.1+dfsg1-1
SHA-12C642A3A1C8EEC2A3DBF92E816A73C84F3E52050
SHA-2560A049F43230A38A9F2D813B47BEB3E65F0900AF5246ADAAC4FA49DFE335AFDBD
Key Value
FileSize205592
MD505B913B3973783A6BE4DF20A8EEED5A2
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 the superlu-dist shared library.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibsuperlu-dist5
PackageSectionlibs
PackageVersion5.3.0+dfsg1-1
SHA-1380559A4A4E5B0FAAD84467981A7C021106A0F92
SHA-2569EA3E71155FD6478009F5D52CE303F959493DFF9E9A2471CA42623F66D58479B
Key Value
FileSize332152
MD5BA4F2E4462D3CA822F77CE34A13AAECB
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 the superlu-dist shared library.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist6
PackageSectionlibs
PackageVersion6.1.1+dfsg1-1
SHA-15A56BF7EC7000F5C1827F31AC18B63BF61504FE9
SHA-256FE2E24B7A45C6B8202763018730CE71902E8C86951C2C2B3F545E5FD3F2669A0
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
FileSize404920
MD577712A07E81AB81027F06707059AEBE7
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 the superlu-dist shared library.
PackageMaintainerDebian Science Maintainers <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuperlu-dist6
PackageSectionlibs
PackageVersion6.1.1+dfsg1-1
SHA-15E46968E0E9C6317843B4B25D9E040DA10F26CD5
SHA-256D4A59EB6CBBBAD07D0FD881A0ECF9F032DE9ECBDB762609D85A21C233E23AF93
Key Value
FileSize212688
MD5DE3A3F76B8F20426F94AA6BF3F9F2525
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 the superlu-dist shared library.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibsuperlu-dist5
PackageSectionlibs
PackageVersion5.3.0+dfsg1-1
SHA-16002E39EF40D4A10F619945BCAC41893C57234D1
SHA-256469159AF98F897B61CFC9C42103995868FD442A25375E83AD4E7952CEEF8DD1C
Key Value
FileSize26512
MD58D6F24173AEC79D8FEC67057CCEA2B40
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
PackageVersion5.3.0+dfsg1-1
SHA-17099D7D6626AF900FEEE49BD25A6F960B69AA1C5
SHA-256CE081A3E522BBF5639B504BE56B816C8FFA61AED682724F170BFFCCAC74A3F06