[Numpy-discussion] roots and high-order polynomial
Fri Jul 3 04:52:05 CDT 2009
On Fri, 03 Jul 2009 11:48:45 +0200
Fabrice Silva <firstname.lastname@example.org> wrote:
> Has anyone looked at the behaviour of the (polynomial)
> for high-order polynomials ? I have an application which
> searches for the roots of a polynomial. It works nicely
>for order less
> than 20, and then has an erratic behaviour for upper
You will need multiprecision arithmetic in that case.
It's an ill-conditioned problem.
> 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
> using sparse solvers?
More information about the NumPy-Discussion