Newton’s method is one of the most well-known numerical approaches to solving nonlinear equations. Why is it so important? Because many equations in mathematics, physics, engineering, and economics do not have convenient analytical solutions. Formulas for higher powers or equations with trigonometric functions are often too bulky or entirely inaccessible. That’s when we need a tool that provides accurate approximations—and does it quickly. The key idea behind this method is the use of tangents. The main challenge is selecting a good initial approximation and working with functions that have derivatives of the required order.
Newton’s Method: Concept and Geometric Interpretation
Consider the equation f(x)=0. Assume that on the interval [a,b], the function is continuous and has continuous first and second derivatives. What do we do? At a point x0, draw the tangent line to the graph of f(x) and find where it intersects the x-axis. That intersection becomes the new approximation. Then repeat the process for x1, then for x2; the sequence converges to the root of f(x)=0.
It is crucial to choose the initial point wisely. A practical rule is to start at a point x0 where f(x0)⋅f”(x0)>0. In that case, the tangent points toward the root, and the sequence of approximations behaves more stably. Geometrically, you can imagine the process as gradually “adjusting” the tangent to the curve so that its intersection with the x-axis moves closer to the desired root at each step.
Step by Step: Iterative Formula and Stopping the Calculations
The reasoning is straightforward. The tangent line at x0 has the equation
We find its intersection with the x-axis (our next approximation) by setting y=0:
Solving for x1 gives:
Repeating the same approach at x1 yields an even better approximation x2. In general, at the i-th step:
This is the working formula of Newton’s method. Each step uses both the function value and its derivative at the current point. That’s why it’s important that f'(xi)≠0 near the root. If the derivative is too small, the step f(xi)/f'(xi) becomes too large: the new approximation may jump away from the solution, and the process can lose stability.
When to stop? It’s convenient to monitor the difference between successive approximations: if
where ε is a predefined tolerance, we stop. Sometimes an additional check |f(xk+1)|<ε is used to ensure the function value is close to zero. In short: pick a good x0; ensure f(x) is continuous with continuous derivatives in the working region (i.e., “smooth”); iterate using the formula and watch convergence. This way, even equations without exact analytical solutions yield to a few careful steps.
Newton’s Method in Practice: Accuracy in Just a Few Iterations
Now that we’ve covered the basics, let’s see how the method works on a concrete example. Theory matters, but practice shows its effectiveness and accuracy best. We’ll walk through a problem from start to finish to see how the method delivers a real result.
Example 1: Find the solution to the nonlinear equation f(x)=x3+x-5=0 with precision ε=0.01 on the interval [-2,2]
First derivatives:
Check the convergence condition at the interval endpoints:
Since the condition holds at both ends of [-2,2], choose the left endpoint as the initial guess: x0=-2.
Not converged yet, so proceed:
Since the stopping condition is not met yet, we move on to the second step:
Continue:
At the fifth step, the stopping criterion is satisfied, so we accept x≈1.516 as the approximate root. As you can see, Newton’s method quickly pulls the solution to the required accuracy—in just a few iterations.
Expanding Your Knowledge: Three Topics for Further Exploration
If you enjoyed this method and want to continue studying numerical techniques for solving nonlinear equations, here are three directions to go deeper and sharpen your skills:
- Secant Method: Linear Approximation for Roots – Uses a secant line through two points of the graph instead of a tangent to approximate the root.
- Combined Secant and Tangent Method: A Path to Stable Solutions – Blends the simplicity of the secant method with the efficiency of Newton’s Method for faster, more stable convergence.
- Simple Iteration Method: Simple Yet Effective Approximations – Builds a sequence where each new approximation depends only on the previous one; applicable to certain classes of equations.
Final Step: Newton’s Method in Action (Flowchart)
If you enjoy programming, turn the flowchart below into code and test it on your own examples. Choose any language—Python, JavaScript, Java, C++, or another—and translate the block logic into clear step-by-step instructions. It’s exciting to see a mathematical idea come to life in your program and produce accurate results.
