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

Evaluate whether CHOLMOD is faster than SuperLU #14

Open
williamhunter opened this issue Jun 5, 2016 · 0 comments
Open

Evaluate whether CHOLMOD is faster than SuperLU #14

williamhunter opened this issue Jun 5, 2016 · 0 comments

Comments

@williamhunter
Copy link
Owner

williamhunter commented Jun 5, 2016

SuperLU is via Pysparse, CHOLMOD is via CVXOPT. Both are direct sparse solvers, from what I've read it seems as though CHOLMOD might be faster, since it is specifically for positive definite matrices that result from FEA problems. If it's only marginally faster (<10%), it won't be worth it since number of dependant 3rd party packages will remain the same.

@williamhunter williamhunter changed the title Evaluate whether CHOMOD is faster than SuperLU Evaluate whether CHOLMOD is faster than SuperLU Jun 13, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

1 participant