https://github.com/rwl/colamd_rs

COLAMD column approximate minimum degree ordering algorithm
https://github.com/rwl/colamd_rs

rust sparse-linear-systems

Last synced: about 3 hours ago
JSON representation

COLAMD column approximate minimum degree ordering algorithm

• Host: GitHub
• URL: https://github.com/rwl/colamd_rs
• Owner: rwl
• License: other
• Created: 2022-09-24T09:56:47.000Z (almost 3 years ago)
• Default Branch: master
• Last Pushed: 2022-10-01T18:15:15.000Z (over 2 years ago)
• Last Synced: 2025-06-18T09:53:02.337Z (12 days ago)
• Topics: rust, sparse-linear-systems
• Language: Rust
• Homepage: https://crates.io/crates/colamd
• Size: 107 KB
• Stars: 4
• Watchers: 2
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: License.txt

Awesome Lists containing this project

README

        
# 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](http://suitesparse.com) library by Stefan I. Larimore

and Timothy A. Davis was translated from C to [Rust](https://www.rust-lang.org/)

by Richard W. Lincoln.

Use of this source code is governed by the BSD 3-clause license

([License.txt](License.txt) or https://opensource.org/licenses/BSD-3-Clause).