SIE 270 3 Methods Flashcards
1
Q
Simplest root finding algorithm.
A
Bisection Method
2
Q
It works when f is a continuous function.
A
Bisection Method
3
Q
Need a and b, such that f(a) and f(b) have opposite signs.
A
Bisection Method
4
Q
Converges slowly.
A
Bisection Method
5
Q
This method does not require the existence / computation of a derivative.
A
Secant Method
6
Q
Slower convergence compared with Newton’s method but faster than Bisection.
A
Secant Method
7
Q
May not converge if started too far away from a root.
A
Secant Method and Newton’s Method
8
Q
Requires that the function f has a continuous derivative.
A
Newton’s Method
9
Q
When it converges, faster than Bisection and Secant Methods.
A
Newton’s Method
