2 2 votes Which of the following statements applies to the bisection method used for finding roots of functions: converges within a few iterations guaranteed to work for all continuous functions is faster than the Newton-Raphson method requires that there be no error in determining the sign of the function Numerical Methods gate1998 numerical-methods bisection-method easy out-of-gatecse-syllabus + – Kathleen 25.0k views answer comment Share Follow Print See 1 comment 1 1 comment reply P0535_Yedidyah_Sagar commented Oct 7, 2025 reply Follow flag Out of cse syllabus 0 0 replyShare Please log in or register to add a comment.
Best answer 1 1 vote The answer is B. The method is guaranteed to converge to a root of $f$ if $f$ is a continuous function on the interval $[a, b]$ and $f(a)$ and $f(b)$ have opposite signs. The absolute error is halved at each step so the method converges linearly, which is comparatively slow. Ref: http://en.wikipedia.org/wiki/Bisection_method#Analysis mdrwt answered Nov 13, 2014 • edited May 31, 2021 by Lakshman Bhaiya mdrwt comment Share Follow See 1 comment 1 1 comment reply Abhineet Singh commented Jan 5, 2021 reply Follow flag is this in syllabus? 0 0 replyShare Please log in or register to add a comment.
