How to Install and Uninstall libccolamd3 Package on Kali Linux
Last updated: November 13,2024
1. Install "libccolamd3" package
This guide covers the steps necessary to install libccolamd3 on Kali Linux
$
sudo apt update
Copied
$
sudo apt install
libccolamd3
Copied
2. Uninstall "libccolamd3" package
Please follow the instructions below to uninstall libccolamd3 on Kali Linux:
$
sudo apt remove
libccolamd3
Copied
$
sudo apt autoclean && sudo apt autoremove
Copied
3. Information about the libccolamd3 package on Kali Linux
Package: libccolamd3
Source: suitesparse
Version: 1:7.6.0+dfsg-1
Installed-Size: 91
Maintainer: Debian Science Team
Architecture: amd64
Depends: libc6 (>= 2.4), libsuitesparseconfig7 (>= 1:7.0.1)
Size: 37560
SHA256: 4da16d438945ed24cfa3f432b5298cc358283511a82d30b9c1279ed4a2fc08ef
SHA1: a16971d06be856a22a434fe5d5258a37ccaa9f36
MD5sum: eb7ffffc5a5ead99c0ffec432901c03e
Description: constrained column approximate library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The CCOLAMD library implements the "Constrained 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/libccolamd3_7.6.0+dfsg-1_amd64.deb
Source: suitesparse
Version: 1:7.6.0+dfsg-1
Installed-Size: 91
Maintainer: Debian Science Team
Architecture: amd64
Depends: libc6 (>= 2.4), libsuitesparseconfig7 (>= 1:7.0.1)
Size: 37560
SHA256: 4da16d438945ed24cfa3f432b5298cc358283511a82d30b9c1279ed4a2fc08ef
SHA1: a16971d06be856a22a434fe5d5258a37ccaa9f36
MD5sum: eb7ffffc5a5ead99c0ffec432901c03e
Description: constrained column approximate library for sparse matrices
Suitesparse is a collection of libraries for computations involving
sparse matrices.
.
The CCOLAMD library implements the "Constrained 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/libccolamd3_7.6.0+dfsg-1_amd64.deb