Skip to content
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

Faster erf #370

Merged
merged 2 commits into from Dec 16, 2020
Merged

Faster erf #370

merged 2 commits into from Dec 16, 2020

Conversation

shibatch
Copy link
Owner

This patch revises the algorithm for computing the error function.
It uses the approximation method by Abramowitz and Stegun.
The new method chooses the fast path if the argument is less than 2.5.
The fast path utilizes the Estrin method for fast evaluation of the polynomials, and does not require computing the exponential function.

@shibatch shibatch merged commit c831a39 into master Dec 16, 2020
6 checks passed
@shibatch shibatch deleted the faster_erf branch December 16, 2020 09:33
burrbull added a commit to burrbull/sleef-rs that referenced this pull request Aug 2, 2022
burrbull added a commit to burrbull/sleef-rs that referenced this pull request Aug 2, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

1 participant