1
Let \(f(x) = x^3-x-1\text{.}\) Perform two Newton steps for \(f\) from \(x_0=2\) by hand.
Beyond the first problem, this set of exercises will be mostly experimental. So, fire up your favorite computational environment. This text will include examples using both Python and Mathematica.
Let \(f(x) = x^3-x-1\text{.}\) Perform two Newton steps for \(f\) from \(x_0=2\) by hand.
Continuing with the example of \(f(x)=x^2-2\) explored in Example 1.2.3, compute ten Newton iterations for several values of \(x_0\text{.}\) Be sure to choose both positive and negative values and values that are both large and small in magnitude.
In the previous exercise, what happens when \(x_0=0\text{?}\) Draw a graph to illustrate the situation.
Let \(f\) be a quadractic function that has two, distinct, real roots but that is otherwise arbitrary. Using a geometrical understanding of the real Newton's method, show why an initial seed \(x_0\) always leads to a sequence that converges to the closer of the two roots of \(f\text{.}\)
Let's modify Newton's original example just a little bit to consider
Figure 1.3.1 shows the graph of the function
The green dots represent points on the graph with \(x\)-coordinates that we might consider as initial seeds for Newton's method.
Launch the interactive tool for generating the basins of attraction of Newton's method for polynomials here: https://marksmath.org/visualization/complex_newton/
.
Now, use the tool to generate images for the following polynomials and answer any additional questions that are asked.