Laguerre's method is very efficient in solving polynomials. Test runs show that for a default absolute accuracy of 1E-6, it generally takes less than 5 iterations to find one root, provided solveAll() is not invoked, and 15 to 20 iterations to find all roots for quintic function.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|