18,467 views

Which of the following statements applies to the bisection method used for finding roots of functions:

1. converges within a few iterations

2. guaranteed to work for all continuous functions

3. is faster than the Newton-Raphson method

4. requires that there be no error in determining the sign of the function

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.

by

### 1 comment

is this in syllabus?

1
3,216 views