Result for 8C700703E4F2559BFAE9420D0C54E94686E4D853

Search result
Graph view
Parent (182)

Query result

Key Value
FileNamecopyright
FileSize13827
MD5CC9E8B967D3AE6463804E1FDCBA44B5C
RDS:package_id294729
SHA-18C700703E4F2559BFAE9420D0C54E94686E4D853
SHA-256E3CB1CA2B791194E0B1889E56DB673378017567D5C62A505B4316BAAF1614FA8
SSDEEP384:2uG5SrkVbWMWrs6rs/P3YTPThyfrsYrsUPExM3pfl3P6YGAXV4q:2OgWtc3YpyfHhExM3Fl3SYXXCq
TLSHT1F952D94E1A4087F75AD023D13D46DFDAF12AAAEA322B5509384DC2099F2792F15F32E5
insert-timestamp1696432821.328546
sourcedb.sqlite
hashlookup:parent-total182
hashlookup:trust100

Network graph view

Parents (Total: 182)

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

Key Value
FileSize31192
MD51524F44ED5708876B08754B4A6B174E4
PackageDescriptioncolumn approximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The COLAMD library implements the "COLumn Approximate Minimum Degree ordering" algorithm. It computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcolamd2
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-1010F0876F8CDAC7DAF98D91236EB8A07372FCA98
SHA-256A0E58BDDB4DE677BEF38A028C1B0E0C131F920A650AFCFC82BB441C25356DF8E
Key Value
FileSize60712
MD5A6D0E595F206F7106EC9F51E48CC51EA
PackageDescriptionconcise sparse matrix library Suitesparse is a collection of libraries for computations involving sparse matrices. . The CXSparse library provides several matrix algorithms. The focus is on direct methods; iterative methods and solvers for eigenvalue problems are beyond the scope of this package. . The performance of the sparse factorization methods in CXSparse will not be competitive with UMFPACK or CHOLMOD, but the codes are much more concise and easy to understand. Other methods are competitive.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcxsparse3
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-101A394CF892B5264EC2F92734D198FEBA1AEB86E
SHA-25636D2EA73FF2669F5F546304B756758B40F393FFFFA54A6CA912125B048E2BB81
Key Value
FileSize27316
MD5358662380EE5D56F5A678DE9475F98CF
PackageDescriptioncolumn approximate minimum degree ordering library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The COLAMD library implements the "COLumn Approximate Minimum Degree ordering" algorithm. It computes a permutation vector P such that the LU factorization of A (:,P) tends to be sparser than that of A. The Cholesky factorization of (A (:,P))'*(A (:,P)) will also tend to be sparser than that of A'*A.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibcolamd2
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-101AED205E03151F28666D5399CE2C63402F49C24
SHA-2566FD88E54812D59962E9C57A4453A8028B303ADD5A575B778C96DA8845C701756
Key Value
FileSize31444
MD510C9F1C8B3E92A756FD28A4B071BD2F0
PackageDescriptiongraph partitioning tool that can quickly compute edge cuts (shared library) Suitesparse is a collection of libraries for computations involving sparse matrices. . Mongoose is a graph partitioning library that can quickly compute edge cuts in arbitrary graph. Given a graph with a vertex set and edge set, an edge cut is a partitioning of the graph into two subgraphs that are balanced (contain the same number of vertices) and the connectivity between the subgraphs is minimized (few edges are in the cut). . This package contains the shared C++ library.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibmongoose2
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-101D9D48D5128FEB862BBFC71A4665292D4BBE97F
SHA-256AC973346E9CA6E2DBD1088D67758E6B11BE577A09F6ACF9C3D8B6D6797EBC264
Key Value
FileSize81216
MD5037F3FA1A1ACE7BCEDD09899BBF8C5E9
PackageDescriptioncircuit simulation sparse LU factorization library Suitesparse is a collection of libraries for computations involving sparse matrices. . The KLU library provides routines for LU factorization, primarily for circuit simulation.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibklu1
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-10288AF3E7983C60EDFF7C6724E1D2774E410F963
SHA-256C43812B0B2E5E9DFF7BD807F23C893771F053AE898F2FB13E678921161B54FC0
Key Value
FileSize33472
MD53CE34CC2B37D3DF6FA7AA98A756A4FD7
PackageDescriptionread/write sparse matrices in Rutherford/Boeing format Suitesparse is a collection of libraries for computations involving sparse matrices. . RBio is a library for reading/writing sparse matrices in the Rutherford/Boeing format.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibrbio2
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-10379DDB73000C4C23CF78DF61CE898B8676CBA9C
SHA-256B51FC5D5F6ADB0637E15E37036B37C7E71298814AA1E5875E34C577A4B8275F5
Key Value
FileSize6444024
MD5368D0976E3C54C2E3252AA6A3F0D0994
PackageDescriptionlibraries for sparse matrices computations (development files) Suitesparse is a collection of libraries for computations involving sparse matrices. This package includes the following libraries: . AMD approximate minimum degree ordering . CAMD symmetric approximate minimum degree . BTF permutation to block triangular form (beta) . COLAMD column approximate minimum degree ordering . CCOLAMD constrained column approximate minimum degree ordering . CHOLMOD sparse Cholesky factorization . CXSparse a concise sparse matrix package . KLU sparse LU factorization, primarily for circuit simulation . LDL a simple LDL' factorization . UMFPACK sparse LU factorization . RBio read/write sparse matrices in Rutherford/Boeing format . SPQR sparse QR factorization . GraphBLAS graph algorithms via sparse matrix operations on semirings . Mongoose graph partitioning library that can quickly compute edge cuts . SLIP_LU solves sparse linear systems in exact arithmetic . SuiteSparse_config configuration routines for all the above packages. . This package contains the static libraries and header files.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibsuitesparse-dev
PackageSectionlibdevel
PackageVersion1:5.8.1+dfsg-2
SHA-106D28B27613B1E5423339D7A4CE52B67BB04D7FA
SHA-25649A8630EBF0A6F340E99FBD9E0025CC693492270B767CC06B2326B438FFF550A
Key Value
FileSize62332
MD58C33996C8C752D9DFA210816BFDB2663
PackageDescriptioncircuit simulation sparse LU factorization library Suitesparse is a collection of libraries for computations involving sparse matrices. . The KLU library provides routines for LU factorization, primarily for circuit simulation.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibklu1
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-1081F2302235EBC546E0CC60E2BEF8F50BA36A127
SHA-256C383A34AAE5DFD536AC44A503CAAAE82773F2498CB88D345A963F4CB183285DB
Key Value
FileSize24416
MD5E92BF01FF89FA07E6BC70F1480D65402
PackageDescriptionsimple LDL' factorization library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The LDL library provides routines for sparse LDL' factorization and solving. These routines are not terrifically fast (they do not use dense matrix kernels), but the code is very short and concise. The purpose is to illustrate the algorithms in a very concise and readable manner, primarily for educational purposes.
PackageMaintainerDebian Science Team <debian-science-maintainers@lists.alioth.debian.org>
PackageNamelibldl2
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-10B26AACCCB9C6C65EABA763655E24E616362FC89
SHA-2565212D8FF82FC35D5089FBA2D86C56A9892D577B867311D2E23F73777F31DA558
Key Value
FileSize11460
MD53587061C7D8DD8EF72838D91AA350293
PackageDescriptionsimple LDL' factorization library for sparse matrices Suitesparse is a collection of libraries for computations involving sparse matrices. . The LDL library provides routines for sparse LDL' factorization and solving. These routines are not terrifically fast (they do not use dense matrix kernels), but the code is very short and concise. The purpose is to illustrate the algorithms in a very concise and readable manner, primarily for educational purposes.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibldl2
PackageSectionlibs
PackageVersion1:5.8.1+dfsg-2
SHA-10BBBFD93DC798425A733CF7DE961B27180F483C6
SHA-2569D850462F5326FB624D7258B6EBFA8112EBF1B089E0FBFA65B89AA65989E6672





metalookup is a service from miwakeru.com