Timeline for Finding all roots of a polynomial
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 24, 2018 at 11:41 | comment | added | J. M. isn't a mathematician | @Ryan, it has been a while since I last investigated this, but I do recall simultaneous iterations tending to bog down on root clusters unless suitably modified. I recall Dario Bini has a modification of Aberth's method to tackle clusters, which you might want to look at. | |
| Aug 13, 2018 at 1:15 | comment | added | Ryan Budney | Durand-Kerner is quite a lovely method. As far as I know there isn't much known about its dynamics (a thread you know): math.stackexchange.com/questions/1661140/… I find the method bogs down on large degree polynomials -- it seems to have a particularly hard time when a large number (hundreds) of roots cluster close together. But as far as conceptual purity and practical effectiveness for "everyday applications", it's amazing. | |
| Jul 28, 2010 at 1:19 | history | answered | J. M. isn't a mathematician | CC BY-SA 2.5 |