3 Jul
2009
3 Jul
'09
2:48 a.m.
Hello Has anyone looked at the behaviour of the (polynomial) roots function for high-order polynomials ? I have an application which internally searches for the roots of a polynomial. It works nicely for order less than 20, and then has an erratic behaviour for upper values... I looked into the source and I wondered that roots is based on the eigenvalues of the companion matrix. For high-order, this latter is rather sparse. Would it improve anything to compute the eigenvalues using sparse solvers? -- Fabrice Silva Laboratory of Mechanics and Acoustics - CNRS 31 chemin Joseph Aiguier, 13402 Marseille, France.
5380
Age (days ago)
5383
Last active (days ago)
16 comments
5 participants
participants (5)
-
Charles R Harris
-
Dag Sverre Seljebotn
-
Fabrice Silva
-
Nils Wagner
-
Pauli Virtanen