0
$\begingroup$

I've been working on a program that finds the roots of a variable polynomial.

So far, I've been using the rational zero theorem, but I've only been able to find integer roots using it. So is there an algorithm to find all real zeros of a polynomial?

In searching similar threads, I've found the Jenkins-Traub algorithm. If I understand correctly, it's a popular algorithm for industry standard softwares, but I haven't a clue how to implement it.

$\endgroup$
  • $\begingroup$ I hear Newton's algorithm works decently well for some polynomials. $\endgroup$ – Simply Beautiful Art Feb 18 '17 at 16:17
  • $\begingroup$ Implementing a robust root finding algorithm is bound to be a lot of work. use well tested code instead. $\endgroup$ – lhf Feb 18 '17 at 16:28
0
$\begingroup$

You don't need to implement it: https://de.mathworks.com/matlabcentral/fileexchange/50462-polynomial-roots-with-jenkins-traub-algorithm?requestedDomain=www.mathworks.com

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.