Can I read Root-Finding Methods: Bisection vs. Newton-Raphson vs. Secant on EtoBox?

Root-Finding Methods: Bisection vs. Newton-Raphson vs. Secant by IOSRJEN : hard copy, certificates, Call for Papers 2013, publishing of journal is a document available to read on EtoBox.

What is Root-Finding Methods: Bisection vs. Newton-Raphson vs. Secant about?

The document compares the performance and rate of convergence of the bisection, Newton-Raphson, and secant methods for finding roots of functions. It uses the function f(x)=x-cos(x) on the interval [0,1]. The bisection method converges after 52 iterations, while Newton-Raphson and secant converge after 8 and 6 iterations respectively, finding the exact root of 0.739085. It is concluded that of the three methods, secant converges the fastest, requiring the fewest iterations to find the root.

Author

IOSRJEN : hard copy, certificates, Call for Papers 2013, publishing of journal

Language

EN