Is there a faster way to find the roots of a polynomial using Horners method?

[theakdad]

I have given polynomial: $$x^3-8x^2+19x-12$$

I know how to find the roots with Horners method,i am just wondering if there is an easier and quicker way to find them? Thank you!

 

[mathbalarka]

I know how to find the roots with Horners method

You don't have to go that far. Try proving that this factors over integers completely by applying rational root theorem (integral root theorem for monic polynomials).

 

[theakdad]

You don't have to go that far. Try proving that this factors over integers completely by applying rational root theorem (integral root theorem for monic polynomials).

I don't know how to do it...

 

[chisigma]

I have given polynomial: $$x^3-8x^2+19x-12$$

I know how to find the roots with Horners method,i am just wondering if there is an easier and quicker way to find them? Thank you!

The polynomial has degree 3, so that it exists at least one real root that can be found with the Newton-Raphson method...

 

[mathbalarka]

I don't know how to do it...

Rational root theorem - Wikipedia, the free encyclopedia

 

[theakdad]

Rational root theorem - Wikipedia, the free encyclopedia

I will try it,but i can't see that this method can be shorter...again you have to test it it with Horners method. Or can you show me how to do it with my example?

 

[alyafey22]

Find the divisors of $$12$$ then divide that by the divisors of the leading term $$1$$ so we have $$\pm 1 , \pm 3 , \pm 4 , \pm 6 \pm 12$$ as possible roots.

$$P(3) = 3^3-8(9)+19\times 3-12 = 27-72+57-12=0 $$

Hence $$x=3$$ is a solution . The next step divide the cubic by $$(x-3)$$ to get a polynomial of degree $2$.

 

[theakdad]

Seems that's not the easier and faster method as Horners...or i can't see it! :D

 

[chisigma]

Seems that's not the easier and faster method as Horners...or i can't see it! :D

... not only neither easier nor faster... if the polynomial doesn't have rational roots [... the most probable case...] it fails!(Tmi)...

Kind regards

$\chi$ $\sigma$

 

[theakdad]

... not only neither easier nor faster... if the polynomial doesn't have rational roots [... the most probable case...] it fails!(Tmi)...

Kind regards

$\chi$ $\sigma$

My question was about rational roots...how to find them fast. (Mmm)

 

[mathbalarka]

neither easier nor faster

Horner's method has computational complexity $\mathcal{O}(n)$, whereas RRT exceeds that quite less often, as far as I can tell.

 

[theakdad]

Horner's method has computational complexity $\mathcal{O}(n)$, whereas RRT exceeds that quite less often, as far as I can tell.

So i think the answer is: Deal with it as you can?

 

[mathbalarka]

Nope. I believe RRT is much faster at several cases than Horner, and that's what I answered above using computational complexity theory.