How to Install and Uninstall libcolamd3 Package on Kali Linux
Last updated: November 26,2024
1. Install "libcolamd3" package
This tutorial shows how to install libcolamd3 on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libcolamd3
Copied
2. Uninstall "libcolamd3" package
This guide let you learn how to uninstall libcolamd3 on Kali Linux:
$
sudo apt remove
libcolamd3
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libcolamd3 package on Kali Linux
Package: libcolamd3
Source: suitesparse
Version: 1:7.6.0+dfsg-1
Installed-Size: 74
Maintainer: Debian Science Team
Architecture: amd64
Depends: libc6 (>= 2.4), libsuitesparseconfig7 (>= 1:7.0.1)
Size: 30996
SHA256: 217507adc15b163d26d074248931c5365101f3f847bd33abeb8aa7335ab15149
SHA1: 0e62e459cf2f3bed135e8a360c555432f96127e3
MD5sum: 02df32f8ac209b5f86670a74a113b9c2
Description: column 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.
Description-md5:
Multi-Arch: same
Homepage: http://suitesparse.com
Section: libs
Priority: optional
Filename: pool/main/s/suitesparse/libcolamd3_7.6.0+dfsg-1_amd64.deb
Source: suitesparse
Version: 1:7.6.0+dfsg-1
Installed-Size: 74
Maintainer: Debian Science Team
Architecture: amd64
Depends: libc6 (>= 2.4), libsuitesparseconfig7 (>= 1:7.0.1)
Size: 30996
SHA256: 217507adc15b163d26d074248931c5365101f3f847bd33abeb8aa7335ab15149
SHA1: 0e62e459cf2f3bed135e8a360c555432f96127e3
MD5sum: 02df32f8ac209b5f86670a74a113b9c2
Description: column 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.
Description-md5:
Multi-Arch: same
Homepage: http://suitesparse.com
Section: libs
Priority: optional
Filename: pool/main/s/suitesparse/libcolamd3_7.6.0+dfsg-1_amd64.deb