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.

Sign up for GitHub

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

QR is slow and greedy #315

Open

Magalame opened this issue Jan 24, 2020 · 0 comments

Magalame commented Jan 24, 2020

I should have opened this issue some time ago. I wrote some benchmarks and it seems that QR factorization is exceptionally slow and greedy.

For a 100*100 matrix, it takes 60.3 ms and has a footprint of 67 MB. While a pure haskell library finishes in 1.7 ms, and 160kB.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment