Summary Report: Fundamental Numerical Methods
A concise, academic overview of root-finding and numerical approximation techniques
Author: Student
Date: 2026-01-24
This document provides a structured summary of commonly taught numerical methods, with emphasis on
assumptions, convergence behavior, and practical considerations for implementation.
Abstract
Numerical methods are essential when analytic solutions are unavailable or impractical. This report
reviews two classical root-finding methods—bisection and Newton–Raphson—and outlines their
theoretical guarantees, convergence rates, and typical failure modes. A short section on error metrics and
stopping criteria is included to support practical use.
Contents
1. Introduction
1
2. Preliminaries: Errors and Stopping Criteria
1
3. Bisection Method
2
4. Newton–Raphson Method
3
5. Practical Notes and Recommendations
4
6. Conclusion
4
References
5
1. Introduction
Many scientific and engineering tasks reduce to solving equations of the form f(x)=0, integrating functions,
or approximating solutions to differential equations. In practice, these problems are often handled with
iterative numerical algorithms that trade closed-form expressions for controlled approximation and
computational efficiency.
This report focuses on root-finding because it illustrates several key themes in numerical analysis:
bracketing versus open methods, convergence rates, stability, and the importance of appropriate stopping
criteria.
2. Preliminaries: Errors and Stopping Criteria
Given an approximation x_k to an (unknown) exact solution x*, two common error measures are:
• Absolute error: |x_k − x*|
• Relative error: |x_k − x*| / max(1, |x*|)
Because x* is typically unknown, implementations often use surrogate criteria based on changes in
iterates or on the residual |f(x_k)|. A typical stopping rule is to terminate when both |x_{k+1} − x_k| ≤ ε_x
and |f(x_k)| ≤ ε_f, where ε_x and ε_f are user-defined tolerances.
When comparing methods, it is also useful to describe convergence. If |x_{k+1} − x*| ≈ C|x_k − x*|^p near
the solution, then p is the order of convergence (p=1: linear, p=2: quadratic).
3. Bisection Method
The bisection method is a bracketing root-finding technique. Assume f is continuous on [a,b] and f(a)·f(b)
< 0. By the Intermediate Value Theorem, a root exists in (a,b). Bisection repeatedly halves the interval,
preserving a sign change.
Algorithm (Bisection)
1) Choose a and b such that f(a)·f(b) < 0.
2) For k = 0,1,2,... compute m = (a+b)/2.
3) If f(a)·f(m) < 0, set b = m; else set a = m.
4) Stop when (b−a)/2 ≤ ε_x or |f(m)| ≤ ε_f.
Convergence and properties
Bisection converges linearly. After k iterations the interval length is (b−a)/2^k, so the midpoint error is
bounded by (b−a)/2^{k+1}. Its key strength is robustness: it will converge as long as the initial bracket is
valid and f is continuous on the interval.
Limitations
Bisection is slower than higher-order methods and does not exploit derivative information. It also requires
an initial bracket with a sign change, which may be nontrivial to find for some problems.
4. Newton–Raphson Method
Newton–Raphson is an open method that uses first-order Taylor approximation. Assuming f is
differentiable and f'(x_k) ≠ 0, Newton's update is:
x_{k+1} = x_k − f(x_k) / f'(x_k)
Algorithm (Newton–Raphson)
1) Choose an initial guess x_0.
2) For k = 0,1,2,... compute x_{k+1} = x_k − f(x_k)/f'(x_k).
3) Stop when |x_{k+1} − x_k| ≤ ε_x and |f(x_k)| ≤ ε_f.
Convergence and properties
If f is sufficiently smooth and x_0 is close to a simple root (where f'(x*) ≠ 0), Newton's method exhibits
quadratic convergence, meaning the number of correct digits roughly doubles each iteration.
Failure modes and safeguards
Newton's method can fail if the derivative is near zero, if the initial guess is far from the root, or if f is poorly
scaled. Common safeguards include step damping (x_{k+1} = x_k − λ f/f', 0<λ≤1), switching to a
bracketing method when divergence is detected, or using a hybrid method (e.g., bisection + Newton).
5. Practical Notes and Recommendations
Method selection: Use bisection when reliability is critical and a bracket is available. Use
Newton–Raphson when derivatives are available and good initial guesses can be provided.
Scaling: Poorly scaled problems can lead to loss of significance and slow convergence. Rescaling
variables or reformulating f(x) can substantially improve performance.
Diagnostics: Track iteration counts, residual norms, and step sizes. Log warnings when |f'(x_k)| becomes
small or when the residual increases repeatedly.
6. Conclusion
Bisection and Newton–Raphson represent two complementary philosophies in numerical computation:
robust bracketing versus fast local convergence. In practice, hybrid strategies that combine the stability of
bisection with the speed of Newton-like updates are often preferred.
References
• Burden, R. L., & Faires, J. D. Numerical Analysis. Cengage Learning.
• Atkinson, K. E. An Introduction to Numerical Analysis. Wiley.
• Stoer, J., & Bulirsch, R. Introduction to Numerical Analysis. Springer.