How to Install and Uninstall libccolamd2.9.1 Package on Ubuntu 16.04 LTS (Xenial Xerus)

Last updated: May 18,2024

1. Install "libccolamd2.9.1" package

Please follow the guidance below to install libccolamd2.9.1 on Ubuntu 16.04 LTS (Xenial Xerus)


    
        
            $
        

        
            
                sudo apt update
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt install
            
                        
                libccolamd2.9.1
            
                    
    
    Copied

2. Uninstall "libccolamd2.9.1" package

Please follow the step by step instructions below to uninstall libccolamd2.9.1 on Ubuntu 16.04 LTS (Xenial Xerus):


    
        
            $
        

        
            
                sudo apt remove
            
                        
                libccolamd2.9.1
            
                    
    
    Copied


    
        
            $
        

        
            
                sudo apt autoclean && sudo apt autoremove
            
                    
    
    Copied

3. Information about the libccolamd2.9.1 package on Ubuntu 16.04 LTS (Xenial Xerus)

Package: libccolamd2.9.1
Priority: optional
Section: libs
Installed-Size: 73
Maintainer: Ubuntu Developers
Original-Maintainer: Debian Science Team
Architecture: amd64
Source: suitesparse
Version: 1:4.4.6-1
Depends: libc6 (>= 2.4), libsuitesparseconfig4.4.6
Filename: pool/main/s/suitesparse/libccolamd2.9.1_4.4.6-1_amd64.deb
Size: 21472
MD5sum: f521def0ae2576f8bb3036cffa73dd89
SHA1: 28504b3caab7be13861d3595c2229023cbbad17b
SHA256: fb0eb5c84ea99aa3daa0911f7f2726a1aa591673ca2c1e93ddbdf6d4eeb77be8
Description-en: 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: 7837a1290ee0cf3371ba8acb52f1427a
Multi-Arch: same
Homepage: http://www.suitesparse.com
Bugs: https://bugs.launchpad.net/ubuntu/+filebug
Origin: Ubuntu
Supported: 3y
Task: edubuntu-desktop-gnome, ubuntustudio-publishing, ubuntustudio-photography, ubuntustudio-graphics, ubuntu-gnome-desktop