-
-
Notifications
You must be signed in to change notification settings - Fork 18
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
Speed of tridiagonal_solve() #7
Comments
So I frequently use this on relatively long sequences. Linear scaling in time is good for peace of mind, and linear scaling in memory might be a necessity to have it work in memory. That's just theoretically speaking, though. I've not run time or memory benchmarks against |
Hi. As you warn in the code,
tridiagonal_solve()
is quite slow. I've compared to plaintorch.solve()
, which is much faster, so I'll be using that in my application, but I was wondering if you are interested in a patch, or perhaps you had other reasons to use the Thomas algorithm.The text was updated successfully, but these errors were encountered: