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

Pairwise reductions? #21

Closed
simonster opened this issue Oct 29, 2013 · 2 comments
Closed

Pairwise reductions? #21

simonster opened this issue Oct 29, 2013 · 2 comments

Comments

@simonster
Copy link
Contributor

In Base, the sum function divides the array to be processed in half recursively and sums those halves, and then combines the sums. Per JuliaLang/julia#4039, this greatly increases accuracy with negligible performance cost. Assuming this can be generalized to arbitrary reductions across arbitrary dimensions without a massive performance hit, it would be nice to implement in NumericExtensions as well.

@lindahua
Copy link
Owner

I am working on a major revision of the package: see #18.

Will take this idea into account in the next major release.

@lindahua
Copy link
Owner

Implemented in latest version v0.3.

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

No branches or pull requests

2 participants