Example 4.  Use Brent's Method to find the three roots of the cubic polynomial  [Graphics:Images/BrentMethodMod_gr_219.gif].  

Solution 4.

Enter the function.  

[Graphics:../Images/BrentMethodMod_gr_220.gif]

[Graphics:../Images/BrentMethodMod_gr_221.gif]

Graph the function  [Graphics:../Images/BrentMethodMod_gr_222.gif].

[Graphics:../Images/BrentMethodMod_gr_223.gif]

[Graphics:../Images/BrentMethodMod_gr_224.gif]

[Graphics:../Images/BrentMethodMod_gr_225.gif]

Root (i).  Use Brent's Method to find the root that lies in the interval  [Graphics:../Images/BrentMethodMod_gr_226.gif]  with an accuracy of  [Graphics:../Images/BrentMethodMod_gr_227.gif].  

[Graphics:../Images/BrentMethodMod_gr_228.gif]

[Graphics:../Images/BrentMethodMod_gr_229.gif]

 

 

Compare with the Regula Falsi Method which is slower and takes about 36 iterations to achieve an accuracy of  [Graphics:../Images/BrentMethodMod_gr_230.gif].  

[Graphics:../Images/BrentMethodMod_gr_231.gif]

[Graphics:../Images/BrentMethodMod_gr_232.gif]

[Graphics:../Images/BrentMethodMod_gr_233.gif]

 

 

Compare with the Bisection Method which is slower and takes about 50 iterations to achieve an accuracy of  [Graphics:../Images/BrentMethodMod_gr_234.gif].  

[Graphics:../Images/BrentMethodMod_gr_235.gif]

[Graphics:../Images/BrentMethodMod_gr_236.gif]

[Graphics:../Images/BrentMethodMod_gr_237.gif]

[Graphics:../Images/BrentMethodMod_gr_238.gif]

 

 

Root (ii).  Use Brent's Method to find the root that lies in the interval  [Graphics:../Images/BrentMethodMod_gr_239.gif]  with an accuracy of  [Graphics:../Images/BrentMethodMod_gr_240.gif].  

[Graphics:../Images/BrentMethodMod_gr_241.gif]

[Graphics:../Images/BrentMethodMod_gr_242.gif]

 

 

Compare with the Regula Falsi Method which is slower and takes about 8 iterations to achieve an accuracy of  [Graphics:../Images/BrentMethodMod_gr_243.gif].  

[Graphics:../Images/BrentMethodMod_gr_244.gif]

[Graphics:../Images/BrentMethodMod_gr_245.gif]

 

 

Compare with the Bisection Method which is slower and takes about 47 iterations to achieve an accuracy of  [Graphics:../Images/BrentMethodMod_gr_246.gif].  

[Graphics:../Images/BrentMethodMod_gr_247.gif]

[Graphics:../Images/BrentMethodMod_gr_248.gif]

[Graphics:../Images/BrentMethodMod_gr_249.gif]

 

 

Root (iii).  Use Brent's Method to find the root that lies in the interval  [Graphics:../Images/BrentMethodMod_gr_250.gif]  with an accuracy of  [Graphics:../Images/BrentMethodMod_gr_251.gif].  

[Graphics:../Images/BrentMethodMod_gr_252.gif]

[Graphics:../Images/BrentMethodMod_gr_253.gif]

 

 

Compare with the Regula Falsi Method which is slower and takes about 50 iterations to achieve an accuracy of  [Graphics:../Images/BrentMethodMod_gr_254.gif].  

[Graphics:../Images/BrentMethodMod_gr_255.gif]

[Graphics:../Images/BrentMethodMod_gr_256.gif]

[Graphics:../Images/BrentMethodMod_gr_257.gif]

[Graphics:../Images/BrentMethodMod_gr_258.gif]

 

 

Compare with the Bisection Method which is slower and takes about 50 iterations to achieve an accuracy of  [Graphics:../Images/BrentMethodMod_gr_259.gif].  

[Graphics:../Images/BrentMethodMod_gr_260.gif]

[Graphics:../Images/BrentMethodMod_gr_261.gif]

[Graphics:../Images/BrentMethodMod_gr_262.gif]

[Graphics:../Images/BrentMethodMod_gr_263.gif]

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

(c) John H. Mathews 2005