Lib.rs

› Science › Math
#sparse-matrix #order #approximate #degree #minimum #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

#448 in Math

Download history 2347/week @ 2024-05-16 2123/week @ 2024-05-23 2835/week @ 2024-05-30 2217/week @ 2024-06-06 1945/week @ 2024-06-13 2869/week @ 2024-06-20 2558/week @ 2024-06-27 2245/week @ 2024-07-04 2008/week @ 2024-07-11 1949/week @ 2024-07-18 1964/week @ 2024-07-25 2354/week @ 2024-08-01 1948/week @ 2024-08-08 1673/week @ 2024-08-15 1950/week @ 2024-08-22 1545/week @ 2024-08-29

7,650 downloads per month
Used in 13 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