-2

I have univariate polynomial of degree d,it may have n real roots n<=d. We can bound possible solution interval(smallest root and largest root) using Rouches theorem. Now I am interested to divide this interval to sub-interval such that each sub-interval contain exactly one root.

Suggest me algorithmic procedure to find the same.

Thanks

flag
See also en.wikipedia.org/wiki/Root-finding_algorithm The first section is for generic functions, but all the rest of the article is specific to real polynomials. – Thierry Zell Feb 9 2011 at 13:51

closed as too localized by Harry Gindi, Bill Johnson, Gerry Myerson, Franz Lemmermeyer, Andrew Stacey Feb 9 2011 at 13:10

Browse other questions tagged or ask your own question.