How to Install and Uninstall libcolamd3 Package on openSuSE Tumbleweed
Last updated: December 27,2024
1. Install "libcolamd3" package
In this section, we are going to explain the necessary steps to install libcolamd3 on openSuSE Tumbleweed
$
sudo zypper refresh
Copied
$
sudo zypper install
libcolamd3
Copied
2. Uninstall "libcolamd3" package
Please follow the steps below to uninstall libcolamd3 on openSuSE Tumbleweed:
$
sudo zypper remove
libcolamd3
Copied
3. Information about the libcolamd3 package on openSuSE Tumbleweed
Information for package libcolamd3:
-----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : libcolamd3
Version : 7.5.1-50.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 43.3 KiB
Installed : No
Status : not installed
Source package : suitesparse-7.5.1-50.1.src
Upstream URL : https://people.engr.tamu.edu/davis/suitesparse.html
Summary : Column Approximate Minimum Degree
Description :
The COLAMD column approximate minimum degree ordering algorithm
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. SYMAMD is a symmetric minimum degree ordering
method based on COLAMD, available as a MATLAB-callable function. It
constructs a matrix M such that M'*M has the same pattern as A, and
then uses COLAMD to compute a column ordering of M. Colamd and symamd
tend to be faster and generate better orderings than their MATLAB
counterparts, colmmd and symmmd.
COLAMD is part of the SuiteSparse sparse matrix suite.
-----------------------------------
Repository : openSUSE-Tumbleweed-Oss
Name : libcolamd3
Version : 7.5.1-50.1
Arch : x86_64
Vendor : openSUSE
Installed Size : 43.3 KiB
Installed : No
Status : not installed
Source package : suitesparse-7.5.1-50.1.src
Upstream URL : https://people.engr.tamu.edu/davis/suitesparse.html
Summary : Column Approximate Minimum Degree
Description :
The COLAMD column approximate minimum degree ordering algorithm
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. SYMAMD is a symmetric minimum degree ordering
method based on COLAMD, available as a MATLAB-callable function. It
constructs a matrix M such that M'*M has the same pattern as A, and
then uses COLAMD to compute a column ordering of M. Colamd and symamd
tend to be faster and generate better orderings than their MATLAB
counterparts, colmmd and symmmd.
COLAMD is part of the SuiteSparse sparse matrix suite.