colamd
| Crates.io | colamd |
| lib.rs | colamd |
| version | 0.1.0 |
| source | src |
| created_at | 2022-10-01 18:19:44.355057 |
| updated_at | 2022-10-01 18:19:44.355057 |
| description | Column approximate minimum degree ordering algorithm |
| homepage | |
| repository | https://github.com/rwl/colamd_rs/ |
| max_upload_size | |
| id | 677942 |
| size | 105,474 |
Richard Lincoln (rwl)
documentation
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 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).