Suitesparse-ccolamd

Jul 20, 2023

Constrained column approximate minimum degree ordering

This port installs the module CCOLAMD of SuiteSparse.

The CCOLAMD 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. CSYMAMD is a symmetric minimum degree ordering method based on CCOLAMD, also available as a MATLAB-callable function. It constructs a matrix M such that M’*M has the same pattern as A, and then uses CCOLAMD to compute a column ordering of M.



Checkout these related ports:
  • Zn_poly - C library for polynomial arithmetic
  • Zimpl - Language to translate the LP models into .lp or .mps
  • Zegrapher - Software for plotting mathematical objects
  • Zarray - Dynamically typed N-D expression system based on xtensor
  • Z3 - Z3 Theorem Prover
  • Yices - SMT solver
  • Yacas - Yet Another Computer Algebra System
  • Xtensor - Multi-dimensional arrays with broadcasting and lazy computing
  • Xtensor-python - Python bindings for xtensor
  • Xtensor-io - Xtensor plugin to read/write images, audio files, numpy npz and HDF5
  • Xtensor-blas - BLAS extension to xtensor
  • Xspread - Spreadsheet program for X and terminals
  • Xppaut - Graphical tool for solving differential equations, etc
  • Xplot - X11 plotting package
  • Xlife++ - XLiFE++ eXtended Library of Finite Elements in C++