Learning Objectives

At the end of this class you should be able to

• Write an m-file that uses an embedded function to find roots of $f(x)=0$
• Use bisect and fzero interchangeably to find the roots of $f(x)=0$
• Describe the differences in performance of bisect and fzero.
• Write an m-file function to find multiple roots of $f(x)$ function (that has multiple roots).

Reading

The textbook discusses root-finding in two separate contexts. Newton's method is used as an example of a computational algorithm Chapter 2, section 2.7.1 and then again in Chapter 7, section 7.1 through 7.3 as a practical means of discussing function m-files. Please review those sections.

Root-finding as a generic numerical method is discussed Chapter 14, section 14.1.

Download

• Download Lecture slides on root-finding and study these slides:
  • Slide 45 summarizing basic root-finding methods. Note, we did not cover Newton's method and the secant method, but you should be generally aware of these two methods.
  • Slides 46 - 50 on fzero