Lib.rs

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

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

#505 in Math

Download history 939/week @ 2023-12-17 571/week @ 2023-12-24 1307/week @ 2023-12-31 1584/week @ 2024-01-07 1532/week @ 2024-01-14 1590/week @ 2024-01-21 1846/week @ 2024-01-28 1638/week @ 2024-02-04 2232/week @ 2024-02-11 2635/week @ 2024-02-18 2776/week @ 2024-02-25 2242/week @ 2024-03-03 1778/week @ 2024-03-10 1793/week @ 2024-03-17 1885/week @ 2024-03-24 2597/week @ 2024-03-31

8,205 downloads per month
Used in 6 crates (4 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

~155KB