search

sarah-quinones / faer-rs

Linear algebra foundation for the Rust programming language
https://faer-rs.github.io
MIT License
1.88k stars 62 forks source link

benchmarks for sparse decompositions #138

Open martinjrobins opened 5 months ago

martinjrobins commented 5 months ago

Thanks for all the work on this excellent crate. I'm using faer's sparse LU decomposition in an ode solver and trying to interpret some of my own benchmarks. I'd like to quantify the impact of faer's LU decomposition, so I was wondering if there was any benchmarks available for this, similar to the dense benchmarks you have already published?

Specificly I'm interested in benchmarks for faer's LU sparse solver against the KLU sparse solver in suitesparse, but any benchmarks would be appreciated. Thanks!

sarah-quinones commented 5 months ago

i ran some comparisons on my desktop a while ago and performance was comparable to suitesparse. benchmarking it regularly is a bit difficult since i'd need to set up the bindings for suite sparse, and also write code to download the sparse matrices since they're too large to fit in github

martinjrobins commented 5 months ago

thanks for the info @sarah-ek. I would like to make a sys crate for suitesparse when I have time (I'm not aware of an existing one) which might help with the first.