-
Notifications
You must be signed in to change notification settings - Fork 3
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
Performance: Lowering vs. Laplacian #64
Comments
Actually even worse, for sufficiently large blocks, it fails completely. I guess this might be an issue with the current implementation for Semiclassical Jacobi..?
|
Try doing a profile? These things can be a bit tricky as we need to make sure we aren't hitting generic fallbacks that use |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
A question of performance (for code that I wrote). I have noticed that creating finite subsections of matrices can sometimes be slow:
versus
Even if I rewrite
Z \ wZ
usingBroadcastVector
, I get similar timings.. Any ideas @dlfivefifty?The text was updated successfully, but these errors were encountered: