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

#565 in Math

Download history 1738/week @ 2024-08-16 1847/week @ 2024-08-23 1569/week @ 2024-08-30 2152/week @ 2024-09-06 2106/week @ 2024-09-13 2302/week @ 2024-09-20 1962/week @ 2024-09-27 2631/week @ 2024-10-04 2138/week @ 2024-10-11 2651/week @ 2024-10-18 2009/week @ 2024-10-25 2344/week @ 2024-11-01 2264/week @ 2024-11-08 2265/week @ 2024-11-15 1775/week @ 2024-11-22 2016/week @ 2024-11-29

8,840 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