22,073 views
1 votes
1 votes

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

1 Answer

Best answer
1 votes
1 votes

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.

Refhttp://en.wikipedia.org/wiki/Bisection_method#Analysis

edited by
Answer:

Related questions

7 votes
7 votes
1 answer
1
Arjun asked Sep 25, 2014
3,920 views
The bisection method is applied to compute a zero of the function $f(x) =x ^{4} – x ^{3} – x ^{2} – 4$ in the interval [1,9]. The method converges to a solution aft...
0 votes
0 votes
3 answers
2
Kathleen asked Oct 4, 2014
11,582 views
Match the following items(i) Newton-Raphson(a) Integration(ii) Runge-Kutta(b) Root finding(iii) Gauss-Seidel(c) Ordinary Differential Equations(iv) Simpson's Rule(d) Solu...
1 votes
1 votes
1 answer
3
Kathleen asked Sep 13, 2014
5,088 views
Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree$1$$2$$3$$4$
0 votes
0 votes
0 answers
4