Newton’s Method and Comparing Root-Finding Algorithms

$\newcommand{\N}{\mathbb N} \newcommand{\Z}{\mathbb Z} \newcommand{\Q}{\mathbb Q} \newcommand{\R}{\mathbb R} \newcommand{\lt}{<} \newcommand{\gt}{>} \newcommand{\amp}{&} \definecolor{fillinmathshade}{gray}{0.9} \newcommand{\fillinmath}[1]{\mathchoice{\colorbox{fillinmathshade}{$\displaystyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\textstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptstyle \phantom{\,#1\,}$}}{\colorbox{fillinmathshade}{$\scriptscriptstyle\phantom{\,#1\,}$}}} $

Chapter 31 Newton’s Method and Comparing Root-Finding Algorithms

We want to write a program that finds the solution to equations $f(x) = 0\text{,}$ but this time using Newton’s method instead of bisection. Newton’s method is very widely used in scientific computing, and provides a powerful (and often much faster) way to solve equations of this form. Here’s what we’ll cover:

Deriving Newton’s method
Building a reusable root-finding library
Comparing Newton’s method to bisection

Prev Top Next