Lib.rs

› Science › Math
#sparse-matrix #order #degree #minimum #approximate #factorization #cholesky

bin lib amd

Approximate Minimum Degree ordering

by Richard Lincoln

4 releases

0.2.2 Sep 7, 2022
0.2.1 May 16, 2022
0.2.0 May 16, 2022
0.1.0 Jan 21, 2022

#558 in Math

Download history 2251/week @ 2024-09-11 2056/week @ 2024-09-18 2308/week @ 2024-09-25 2238/week @ 2024-10-02 2503/week @ 2024-10-09 2218/week @ 2024-10-16 2204/week @ 2024-10-23 2301/week @ 2024-10-30 2238/week @ 2024-11-06 2458/week @ 2024-11-13 2057/week @ 2024-11-20 1478/week @ 2024-11-27 2338/week @ 2024-12-04 2520/week @ 2024-12-11 2011/week @ 2024-12-18 1095/week @ 2024-12-25

8,354 downloads per month
Used in 15 crates (5 directly)

BSD-3-Clause

96KB
2K SLoC

AMD

Approximate Minimum Degree ordering algorithm.

About

Crate amd provides a set of routines for ordering a sparse matrix prior to Cholesky factorization. The original AMD library by Timothy A. Davis was translated from C to Rust by Richard W. Lincoln.

License

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

Dependencies

~150KB