colamd 0.1.0

Column approximate minimum degree ordering algorithm
Documentation
  • Coverage
  • 53.57%
    15 out of 28 items documented1 out of 1 items with examples
  • Size
  • Source code size: 105 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 3.24 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • rwl/colamd_rs
    5 0 1
  • crates.io
  • Dependencies
    • —
  • Versions
  • Owners
  • rwl

COLAMD

Column approximate minimum degree ordering algorithm.

About

colamd implements approximate minimum degree column ordering algorithms for LU, Cholesky and QR factorization, least squares, interior point methods for linear programming, and other related problems.

License and Copyright

Copyright (C) 1998-2016 Stefan I. Larimore and Timothy A. Davis.
Copyright (C) 2011-2022 Richard W. Lincoln.

The authors of the original C code are Stefan I. Larimore and Timothy A. Davis (davis at cise.ufl.edu), University of Florida. The algorithm was developed in collaboration with John Gilbert, Xerox PARC, and Esmond Ng, Oak Ridge National Laboratory.

This work was supported by the National Science Foundation, under grants DMS-9504974 and DMS-9803599.

The original COLAMD library by Stefan I. Larimore and Timothy A. Davis was translated from C to Rust by Richard W. Lincoln.

Use of this source code is governed by the BSD 3-clause license (License.txt or https://opensource.org/licenses/BSD-3-Clause).