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

Question about using #555

Closed
lesobrod opened this issue Jan 5, 2024 · 2 comments
Closed

Question about using #555

lesobrod opened this issue Jan 5, 2024 · 2 comments

Comments

@lesobrod
Copy link

lesobrod commented Jan 5, 2024

Hello! I need to find roots of s.c. 0,1 - polynomials with high degrees many times.
More exactly I need just number of real roots, see detailed here.
Which package is the most suitable for it?

@jverzani
Copy link
Member

jverzani commented Jan 5, 2024

So, Polynomial.roots will not be suitable for degrees above 50 or so, if even. The AMRVW package can do much better, but for your problem a specialized algorithm is likely the way to go. The RealPolynomialRoots package is intended to this, but doesn't scale to large polynomials well, as it doesn't have some more asymptotically efficient algorithms implemented (just naive ones). So... I'd suggest trying Nemo (https://nemocas.github.io/Nemo.jl/v0.13/polynomial.html#Root-finding-1) which uses the arb library under the hood and has the isolating algorithms you likely need.

@lesobrod
Copy link
Author

lesobrod commented Jan 5, 2024

Aha, thank you very much!

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