Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

benchmarks for sparse decompositions #138

Open
martinjrobins opened this issue Jun 24, 2024 · 2 comments
Open

benchmarks for sparse decompositions #138

martinjrobins opened this issue Jun 24, 2024 · 2 comments
Labels
enhancement New feature or request

Comments

@martinjrobins
Copy link

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!

@martinjrobins martinjrobins added the enhancement New feature or request label Jun 24, 2024
@sarah-quinones
Copy link
Owner

sarah-quinones commented Jun 24, 2024

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
Copy link
Author

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.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request
Projects
None yet
Development

No branches or pull requests

2 participants