The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+1 vote
605 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

asked in Numerical Methods by Veteran (59.7k points) | 605 views

1 Answer

+1 vote
Best answer

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

answered by Active (2.4k points)
selected by
Answer:

Related questions



Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

44,383 questions
49,872 answers
164,897 comments
65,881 users