Result for 404F41615EBC99E3831CD4AB3E334C4045F7B01E

Query result

Key Value
FileName./usr/share/doc/packages/suitesparse-5.2.0/CSPARSE_README.txt
FileSize18703
MD527942AACB3536C4167F5C7491A789E0B
SHA-1404F41615EBC99E3831CD4AB3E334C4045F7B01E
SHA-25661FF4DD44EECBB9482A703F8CF8DA148755D405A1E9D874F3EEABBAF696497A9
SSDEEP192:kdGQwl+qv8v0rLHLYPVOkijf1FpSFFLWuIz3IP9kUS5lJZ:7DlHv8srrLU0bjf1+Az3ISUSP
TLSHT1C382648D9F45126181E1E236DEDD6405E728E45994030DA6BB0C847C7B4BABAC2FF399
hashlookup:parent-total50
hashlookup:trust100

Network graph view

Parents (Total: 50)

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

Key Value
MD54BC5D48359632FAFECDF9B9F3BA18ED2
PackageArchx86_64
PackageDescriptionCSparse is a small yet feature-rich sparse matrix package written specifically for a book. The purpose of the package is to demonstrate a wide range of sparse matrix algorithms in as concise a code as possible. CSparse is about 2,200 lines long (excluding its MATLAB interface, demo codes, and test codes), yet it contains algorithms (either asympotical optimal or fast in practice) for all of the following functions described below. A MATLAB interface is included. Note that the LU and Cholesky factorization algorithms are not as fast as UMFPACK or CHOLMOD. Other functions have comparable performance as their MATLAB equivalents (some are faster). Documentation is very terse in the code; it is fully documented in the book. Some indication of how to call the C functions in CSparse is given by the CSparse/MATLAB/*.m help files. CSparse is part of the SuiteSparse sparse matrix suite.
PackageNamelibcsparse3
PackageRelease59.1
PackageVersion3.2.0
SHA-100ABD18BC68E92199312293D256F4BF01E292473
SHA-2568115FC6C4C9569E53D2BA0950AD79ABFD92C89079923EB53FD2D53BB13116873
Key Value
MD5D2F1D74A535177BD72F8F1B765C0CCD7
PackageArchx86_64
PackageDescriptionCSparse is a small yet feature-rich sparse matrix package written specifically for a book. The purpose of the package is to demonstrate a wide range of sparse matrix algorithms in as concise a code as possible. CSparse is about 2,200 lines long (excluding its MATLAB interface, demo codes, and test codes), yet it contains algorithms (either asympotical optimal or fast in practice) for all of the following functions described below. A MATLAB interface is included. Note that the LU and Cholesky factorization algorithms are not as fast as UMFPACK or CHOLMOD. Other functions have comparable performance as their MATLAB equivalents (some are faster). Documentation is very terse in the code; it is fully documented in the book. Some indication of how to call the C functions in CSparse is given by the CSparse/MATLAB/*.m help files. CSparse is part of the SuiteSparse sparse matrix suite.
PackageNamelibcsparse3
PackageRelease85.70
PackageVersion3.2.0
SHA-107CAC346EB474090F0BD84DDA1A3BDFDA1772FDB
SHA-2566F78A2398D4577FA8A5558EA311B0B9B5E1D73ABFA4773FC73E8A623FCE49A02
Key Value
MD5F58F877D79510DC021B5A344C7330AFE
PackageArchx86_64
PackageDescriptionCSparse is a small yet feature-rich sparse matrix package written specifically for a book. The purpose of the package is to demonstrate a wide range of sparse matrix algorithms in as concise a code as possible. CSparse is about 2,200 lines long (excluding its MATLAB interface, demo codes, and test codes), yet it contains algorithms (either asympotical optimal or fast in practice) for all of the following functions described below. A MATLAB interface is included. Note that the LU and Cholesky factorization algorithms are not as fast as UMFPACK or CHOLMOD. Other functions have comparable performance as their MATLAB equivalents (some are faster). Documentation is very terse in the code; it is fully documented in the book. Some indication of how to call the C functions in CSparse is given by the CSparse/MATLAB/*.m help files. CSparse is part of the SuiteSparse sparse matrix suite.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamelibcsparse3
PackageReleaselp152.5.10
PackageVersion3.2.0
SHA-10BE051E5FC2FA324DA7CB9C2F07194FFAE467A6F
SHA-256D3E79D49CFB1EB5BD24B2DE96A0561EE2B5BA34D46C1268E2DE38CC6E37EB204
Key Value
MD573C19146F2C7FC12937AEE531FC0219B
PackageArchx86_64
PackageDescriptionsuitesparse is a collection of libraries for computations involving sparse matrices. The suitesparse-devel package contains files needed for developing applications which use the suitesparse libraries.
PackageNamesuitesparse-devel
PackageReleaselp150.59.1
PackageVersion5.6.0
SHA-10C2EA1399A89DC2C8AB384F02CB3E1341CA1341D
SHA-2564EB1F2F097E3C2F1E0DF480CC64DA54C68F8F1C60F338252DCC27FB6B191865D
Key Value
MD5291C84914D12D33F11B3ACE6A05EDB0C
PackageArchi586
PackageDescriptionCSparse is a small yet feature-rich sparse matrix package written specifically for a book. The purpose of the package is to demonstrate a wide range of sparse matrix algorithms in as concise a code as possible. CSparse is about 2,200 lines long (excluding its MATLAB interface, demo codes, and test codes), yet it contains algorithms (either asympotical optimal or fast in practice) for all of the following functions described below. A MATLAB interface is included. Note that the LU and Cholesky factorization algorithms are not as fast as UMFPACK or CHOLMOD. Other functions have comparable performance as their MATLAB equivalents (some are faster). Documentation is very terse in the code; it is fully documented in the book. Some indication of how to call the C functions in CSparse is given by the CSparse/MATLAB/*.m help files. CSparse is part of the SuiteSparse sparse matrix suite.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamelibcsparse3
PackageRelease43.6
PackageVersion3.2.0
SHA-111B4EFD582EA5410DAEA4A9898FE518606CE4EB8
SHA-2561EB8856A68175DD31E1D3B7555A1E6601A71DCE4A1A6B536FAF9D2A63DD48799
Key Value
MD59CFDE77EF234ABC4BE6AFA535B134410
PackageArchx86_64
PackageDescriptionCSparse is a small yet feature-rich sparse matrix package written specifically for a book. The purpose of the package is to demonstrate a wide range of sparse matrix algorithms in as concise a code as possible. CSparse is about 2,200 lines long (excluding its MATLAB interface, demo codes, and test codes), yet it contains algorithms (either asympotical optimal or fast in practice) for all of the following functions described below. A MATLAB interface is included. Note that the LU and Cholesky factorization algorithms are not as fast as UMFPACK or CHOLMOD. Other functions have comparable performance as their MATLAB equivalents (some are faster). Documentation is very terse in the code; it is fully documented in the book. Some indication of how to call the C functions in CSparse is given by the CSparse/MATLAB/*.m help files. CSparse is part of the SuiteSparse sparse matrix suite.
PackageMaintainerhttps://www.suse.com/
PackageNamelibcsparse3
PackageRelease150100.9.2.3
PackageVersion3.2.0
SHA-11676EC26E57C8510CF30E1DD180B60497F35BA9B
SHA-256CA792CD8366259B669CE0403F83D3074309F26ADCDEE04B202BB351229C9AD16
Key Value
MD599336F50913B627DB503D5AD95ECE847
PackageArchi586
PackageDescriptionsuitesparse is a collection of libraries for computations involving sparse matrices. The suitesparse-devel package contains files needed for developing applications which use the suitesparse libraries.
PackageNamesuitesparse-devel
PackageRelease45.3
PackageVersion5.10.1
SHA-116F1FC834FBD37AA78AEF3C22FA40BD85719A89D
SHA-25673A24FDFF8845141213F516CE6EBEF01FFEA127471FFE8985553E1A2B89ECABF
Key Value
MD55DBE3458EC44E98CBCC9D06B27CB6AD7
PackageArchx86_64
PackageDescriptionsuitesparse is a collection of libraries for computations involving sparse matrices. The suitesparse-devel package contains files needed for developing applications which use the suitesparse libraries.
PackageMaintainerhttps://bugs.opensuse.org
PackageNamesuitesparse-devel
PackageReleaselp151.4.1
PackageVersion5.2.0
SHA-11DCF5C386A380469F28BE5CFE98AFB588336A1C4
SHA-256861664EB78F613B6EB78FC134CC1EC0D66AD0DB34AB8185A869469AC1F0B6703
Key Value
MD5C10750D178068E2A59E526D304E963F8
PackageArchx86_64
PackageDescriptionsuitesparse is a collection of libraries for computations involving sparse matrices. The suitesparse-devel package contains files needed for developing applications which use the suitesparse libraries.
PackageNamesuitesparse-devel
PackageRelease85.70
PackageVersion5.10.1
SHA-12391DBF2D4A849E2C00A8E4111477510748C3EC3
SHA-256AA9DB1CE2025D4813F147D5EE18874A988C240181AA3AD3C0A34A9255F9946C7
Key Value
MD5BA282F62CD11FC7FEE9993686766E1E0
PackageArchs390x
PackageDescriptionCSparse is a small yet feature-rich sparse matrix package written specifically for a book. The purpose of the package is to demonstrate a wide range of sparse matrix algorithms in as concise a code as possible. CSparse is about 2,200 lines long (excluding its MATLAB interface, demo codes, and test codes), yet it contains algorithms (either asympotical optimal or fast in practice) for all of the following functions described below. A MATLAB interface is included. Note that the LU and Cholesky factorization algorithms are not as fast as UMFPACK or CHOLMOD. Other functions have comparable performance as their MATLAB equivalents (some are faster). Documentation is very terse in the code; it is fully documented in the book. Some indication of how to call the C functions in CSparse is given by the CSparse/MATLAB/*.m help files. CSparse is part of the SuiteSparse sparse matrix suite.
PackageMaintainerhttps://www.suse.com/
PackageNamelibcsparse3
PackageRelease7.9
PackageVersion3.2.0
SHA-12747FAB57B4BE56BA259A2D69DD4A5F5AA85F62D
SHA-25661AD65F014425325E63E843BC06594E306F2A793CA35AFDF07DCC777B3489027