-
Notifications
You must be signed in to change notification settings - Fork 22
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 Improvement of erfint #237
base: master
Are you sure you want to change the base?
Conversation
This looks very promising. Thank you @tblanke. I will open an issue so that we can clean up the commits and quantify the impact on accuracy and computational time. I have one question to start : How was the choice of a value of 4 decided? I believe the scipy implementation of
|
Hi @MassimoCimmino , Thanks. |
I replicated the changes in a clean branch : issue239_approximateErfint. It seems the performance improvement is not always positive. Cases in the |
That is peculiar. I might have some time this weekend, if not resolved by then.
This is a neat idea, @tblanke. Hoping it works out. |
…into MassimoCimmino-master
Massimo cimmino master
Hi @MassimoCimmino ,
I have implemented a new erfint function which differ between values below 4 and above. To avoid calculating to often the erf and exponential function because above 4 these values are linear depending on the absolute input. This has improved the segment-to-segment response factor calculation time by up to 50 % (see pictures), at least on my machine.
I hope you find this helpful.
With best regards