Lib.rs

› Science › Math
#ordering #matrix #approximate #sparse-matrix #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

#511 in Math

Download history 1700/week @ 2023-11-25 1024/week @ 2023-12-02 1517/week @ 2023-12-09 942/week @ 2023-12-16 509/week @ 2023-12-23 1354/week @ 2023-12-30 1536/week @ 2024-01-06 1541/week @ 2024-01-13 1620/week @ 2024-01-20 1844/week @ 2024-01-27 1641/week @ 2024-02-03 2036/week @ 2024-02-10 2803/week @ 2024-02-17 2472/week @ 2024-02-24 2500/week @ 2024-03-02 1363/week @ 2024-03-09

9,321 downloads per month
Used in 5 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