SIE 270 3 Methods

Question 1

Simplest root finding algorithm.

Answer 1

Bisection Method

Question 2

It works when f is a continuous function.

Answer 2

Bisection Method

Question 3

Need a and b, such that f(a) and f(b) have opposite signs.

Answer 3

Bisection Method

Question 4

Converges slowly.

Answer 4

Bisection Method

Question 5

This method does not require the existence / computation of a derivative.

Answer 5

Secant Method

Question 6

Slower convergence compared with Newton’s method but faster than Bisection.

Answer 6

Secant Method

Question 7

May not converge if started too far away from a root.

Answer 7

Secant Method and Newton’s Method

Question 8

Requires that the function f has a continuous derivative.

Answer 8

Newton’s Method

Question 9

When it converges, faster than Bisection and Secant Methods.

Answer 9

Newton’s Method