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

#562 in Math

Download history 2051/week @ 2024-07-20 1886/week @ 2024-07-27 2432/week @ 2024-08-03 1843/week @ 2024-08-10 1686/week @ 2024-08-17 1875/week @ 2024-08-24 1596/week @ 2024-08-31 2226/week @ 2024-09-07 2101/week @ 2024-09-14 2223/week @ 2024-09-21 2043/week @ 2024-09-28 2728/week @ 2024-10-05 1988/week @ 2024-10-12 2725/week @ 2024-10-19 1918/week @ 2024-10-26 2382/week @ 2024-11-02

9,448 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