No history yet

Introduction to Newton's Method

Finding Roots When Algebra Fails

Sometimes, finding the exact solution to an equation is incredibly difficult, or even impossible, using standard algebra. Consider the equation x3+x1=0x^3 + x - 1 = 0. There's no simple formula to find the value of xx that makes this true. We can see that when x=0x=0, the left side is 1-1, and when x=1x=1, it's 11. So, a solution, or a root, must exist somewhere between 0 and 1. But where, exactly?

This is where we need a way to approximate the answer. Newton's Method is a powerful technique for doing just that. It's an iterative process, meaning we start with a reasonable guess and repeat a simple calculation to get closer and closer to the actual root.

The Geometric Idea

The core idea behind Newton's Method is surprisingly visual. It uses tangent lines to guide us toward a root.

Here's the process:

  1. Start with an initial guess, let's call it x0x_0, that is reasonably close to the root.
  2. Find the point (x0,f(x0))(x_0, f(x_0)) on the curve of the function.
  3. Draw the tangent line to the curve at that point. A tangent line is a straight line that just touches the curve at a single point and has the same slope as the curve at that point.
  4. Follow that tangent line down until it crosses the x-axis. The point where it crosses is our new, improved guess, x1x_1.
  5. Repeat the process. Draw a new tangent line at (x1,f(x1))(x_1, f(x_1)), see where it crosses the x-axis to get x2x_2, and so on. Each step should bring you much closer to the actual root.

As you can see, each tangent line acts as a linear approximation of the function, and finding where this line hits the x-axis is much simpler than finding the root of the original curve.

The Formula

This geometric process can be captured in a single formula. The equation of the tangent line at a point (xn,f(xn))(x_n, f(x_n)) is given by yf(xn)=f(xn)(xxn)y - f(x_n) = f'(x_n)(x - x_n), where f(xn)f'(x_n) is the derivative of the function at xnx_n.

We want to find where this line crosses the x-axis, which is where y=0y=0. So we set y=0y=0 and solve for xx, which will be our next guess, xn+1x_{n+1}:

0f(xn)=f(xn)(xn+1xn)0 - f(x_n) = f'(x_n)(x_{n+1} - x_n)

Rearranging this to solve for xn+1x_{n+1} gives us the core formula for Newton's Method.

xn+1=xnf(xn)f(xn)x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)}

This general idea of estimating the zeroes of a function by guessing, drawing tangents, and finding a zero of the tangent, is called Newton’s method.

Putting It to Work

Let's use this formula to approximate the root of f(x)=x3+x1f(x) = x^3 + x - 1. First, we need the derivative, which is f(x)=3x2+1f'(x) = 3x^2 + 1.

Let's start with an initial guess of x0=1x_0 = 1. Now we apply the formula to find x1x_1.

Step 1: Find x1x_1

We plug x0=1x_0 = 1 into the formula: f(1)=13+11=1f(1) = 1^3 + 1 - 1 = 1 f(1)=3(1)2+1=4f'(1) = 3(1)^2 + 1 = 4

So, x1=114=0.75x_1 = 1 - \frac{1}{4} = 0.75.

Our first guess was 1, and our new, better guess is 0.75.

Step 2: Find x2x_2

Now we repeat the process using x1=0.75x_1 = 0.75: f(0.75)=(0.75)3+0.751=0.421875+0.751=0.171875f(0.75) = (0.75)^3 + 0.75 - 1 = 0.421875 + 0.75 - 1 = 0.171875 f(0.75)=3(0.75)2+1=3(0.5625)+1=1.6875+1=2.6875f'(0.75) = 3(0.75)^2 + 1 = 3(0.5625) + 1 = 1.6875 + 1 = 2.6875

So, x2=0.750.1718752.68750.750.0639=0.6861x_2 = 0.75 - \frac{0.171875}{2.6875} \approx 0.75 - 0.0639 = 0.6861.

With just two steps, we've gone from a guess of 1 to 0.6861. The actual root is approximately 0.6823. As you can see, the method converges on the correct answer very quickly.

You can continue this process for as many steps as needed to achieve the desired accuracy. For most practical purposes, just a few iterations are enough.

Ready to test your understanding?

Quiz Questions 1/4

What is the core geometric concept used in each step of Newton's Method to find a better approximation of a root?

Quiz Questions 2/4

Which formula correctly represents the iterative step in Newton's Method to find the next approximation, xn+1x_{n+1}?

Newton's method provides a fast, elegant way to find approximate solutions when direct algebraic methods are out of reach.