Advanced Search
All Posts : MaplePrimes Commons General Technical Discussions

Hello all,

I have a polynomial having the form P(x) = a_n*x^n + ... + a_1*x + a_0; where all coefficients a_n have numerical values. I use the Maple's routine solve to find the polynomial roots (solve(P)). The obtained roots real and complex. The polynomial order n is between 6 and 20, depending on the specific implementation.

My question is: what method is used in the solve routine? Similar post are discussed in

http://www.mapleprimes.com/forum/method-for-polynomial-root-finding,

but I didn't find an answer for my specific case. From the link above, I concluded that Maple uses the Newton method, but I would like to get a confirmation. The obtained results seems to be OK, since I verified them with other softwares and methods (Matlab).

Is this documented somewhere?

Thanks for the help!

 

 

Please Wait...