Newton–Raphson Method
A Numerical Technique for Solving Nonlinear Equations
Course: Numerical Algorithms
Department of Computer Science
Student Name: ____________________
Instructor Name: ____________________
Date: ____________________
Table of Contents
1. Introduction
2. Mathematical Foundations
3. Algorithm
4. Convergence Analysis
5. Error Analysis
6. Numerical Example
7. Applications
8. Advantages and Limitations
9. Comparison with Other Methods
10. Conclusion
11. References
1. Introduction
Solving nonlinear equations is a fundamental problem in numerical analysis. Many
scientific and engineering problems lead to equations that cannot be solved analytically.
In such cases, numerical methods are required to approximate the roots. The Newton–
Raphson Method is one of the most powerful iterative techniques due to its fast
convergence when appropriate conditions are satisfied.
2. Mathematical Foundations
Given a nonlinear function f(x) = 0, the goal is to determine a value x such that f(x)
equals zero. The Newton–Raphson method is based on linear approximation using the
tangent line at a given point.
Iterative Formula:
x(n+1) = x(n) - f(x(n)) / f'(x(n))
3. Algorithm
Step 1: Choose an initial approximation x0.
Step 2: Apply the iterative formula.
Step 3: Repeat until the absolute error is less than a predefined tolerance.
4. Convergence Analysis
The method converges quadratically when the function is differentiable near the root and
the derivative at the root is non-zero. Poor initial guesses may cause divergence.
5. Error Analysis
Absolute Error: |x(n+1) - x(n)|
Relative Error: |x(n+1) - x(n)| / |x(n+1)|
Common stopping criteria include reaching a tolerance or maximum iterations.
6. Numerical Example
Consider f(x) = x^2 - 2.
Derivative: f'(x) = 2x.
Using x0 = 1.5, repeated iterations produce an approximation of sqrt(2) ≈ 1.41421356.
7. Applications
Applications include engineering analysis, physics equations, optimization problems, and
numerical simulations in computer science.
8. Advantages and Limitations
Advantages: Fast convergence and high accuracy.
Limitations: Requires derivative calculation and is sensitive to initial guesses.
9. Comparison with Other Methods
Compared to Bisection (linear convergence) and Secant (superlinear convergence),
Newton–Raphson offers quadratic convergence but lacks guaranteed convergence in all
cases.
10. Conclusion
The Newton–Raphson Method is an efficient and widely used numerical technique for
solving nonlinear equations. When applied under suitable conditions, it significantly
outperforms simpler root-finding methods.
11. References
Burden, R. L., & Faires, J. D. Numerical Analysis.
Chapra, S. C., & Canale, R. P. Numerical Methods for Engineers.
Kreyszig, E. Advanced Engineering Mathematics.
Atkinson, K. An Introduction to Numerical Analysis.
Conte, S. D., & de Boor, C. Elementary Numerical Analysis.