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

devectorise 'poly' for better performance #17

Merged
merged 2 commits into from Jan 1, 2016
Merged

devectorise 'poly' for better performance #17

merged 2 commits into from Jan 1, 2016

Conversation

ghost
Copy link

@ghost ghost commented Jan 9, 2015

I devectorised the single vectorised line. This provides a substantial reduction in both execution time and memory usage. For specifying 5 roots, the reduction is already about a factor of 2 for time and 8 for memory. The reduction grows substantially for an increasing number of specified roots.

Carlos Baptista added 2 commits January 9, 2015 01:29
I devectorised the single vectorised line. This provides a substantial reduction in both execution time and memory usage. For specifying 5 roots, the reduction is already about a factor of 2 for time and 8 for memory. The reduction grows substantially for an increasing number of specified roots.
I made a mistake. The loop range should be reversed for correct output
@jverzani jverzani mentioned this pull request Jan 1, 2016
jverzani added a commit that referenced this pull request Jan 1, 2016
devectorise 'poly' for better performance
@jverzani jverzani merged commit 636fd7a into JuliaMath:master Jan 1, 2016
@jverzani
Copy link
Member

jverzani commented Jan 1, 2016

Thanks,

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