Regarding other ways to solve polynomials, I've found that the Aberth
method is fast and accurate, and it can be implemented with array
operations since it works on all roots at once. For example roots from a
random 20-coefficient polynomial takes about 1ms. Bini's "Numerical
Computation of Polynom
Good find & fix. (i>>3)&8 was an attempt to fix earlier similar
problems, and it did fix the ones that were reported! The 8 was a
blunder, I meant 7. You are right that i&7 suffices.
Henry Rich
On 2/4/2023 11:07 PM, Elijah Stone wrote:
I think the j implementation does exactly the same thin
