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

#608 in Math

Download history 2114/week @ 2024-10-14 2594/week @ 2024-10-21 1950/week @ 2024-10-28 2451/week @ 2024-11-04 2425/week @ 2024-11-11 2090/week @ 2024-11-18 1576/week @ 2024-11-25 2133/week @ 2024-12-02 2506/week @ 2024-12-09 2479/week @ 2024-12-16 1045/week @ 2024-12-23 2216/week @ 2024-12-30 3899/week @ 2025-01-06 3586/week @ 2025-01-13 2853/week @ 2025-01-20 2910/week @ 2025-01-27

13,481 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