-
Notifications
You must be signed in to change notification settings - Fork 10
Use of FastAnonymous.jl for ODE solvers. #37
base: master
Are you sure you want to change the base?
Conversation
ffbf7ed
to
d65032f
Compare
Benchmarks : Without Using Fast Anon : https://github.com/amitjamadagni/Notes-Notebooks/blob/master/Notebooks/ODE%20Solvers%20without%20Fast%20Anon.ipynb Though there is a speed up with respect to @acroy any thoughts on this would be helpful ! Thanks ! |
src/propodesolvers.jl
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
You can try to do scale!(coeffs(op)*y, -im)
, which should save one copy and some multiplications.
The speed up is nice, but mainly due to |
@acroy I have re run the benchmarks with a branch check (using
For smaller systems use of |
Thanks! For smaller systems ( |
Here are the results without seems like the original implementation is faster without |
It becomes much slower than the old version, which seems to be strange. Anyways, it is not clear what one should do now. We certainly don't want to spoil performance for small systems. Maybe we should leave this open until we understand the side-effects better? |
yup ! I guess we need a better understanding of the individual additions i.e., |
This aims at speeding up the current implementation of ODE solvers using FastAnonymous.jl.
WIP : Perform benchmarks, Add documentation, Update dependencies in README.