What is numerical root finding?

Numerical root finding is an iterative process used to approximate the solutions of equations $f(x) = 0$ when algebraic solutions are difficult or impossible to find.

How does the Bisection Method work?

The Bisection Method repeatedly halves an interval $[a, b]$ where the function changes sign, narrowing down the location of the root.

What is the Intermediate Value Theorem?

A theorem stating that if a continuous function has opposite signs at the endpoints of an interval, it must cross zero at least once within that interval.

How does the Newton-Raphson Method work?

The Newton-Raphson Method starts with an initial guess and uses the function's value and derivative to find the x-intercept of the tangent line, which serves as the next guess: $x_{k+1} = x_k - f(x_k)/f'(x_k)$.

Why is the Bisection Method guaranteed to converge?

Because it is a bracketed method that maintains a sign change across a shrinking interval, ensuring it converges to a root of a continuous function.

When can the Newton-Raphson Method fail?

It can fail if the initial guess is close to a local extremum (where the derivative $f'(x)$ is zero, leading to division by zero) or if the iterations cycle or diverge away from the root.

What is linear convergence?

Linear convergence means the error decreases by a constant factor at each step (for Bisection, the error is halved at each step).

What is quadratic convergence?

Quadratic convergence means the error at step $k+1$ is proportional to the square of the error at step $k$, leading to rapid convergence near the root.

How do you choose between Bisection and Newton-Raphson?

Use Bisection when robustness is required and a sign-changing interval is known. Use Newton-Raphson when speed is important and a good initial guess is available.

What is the tolerance parameter in root finding?

The tolerance is a small number (like $10^{-6}$) representing the target accuracy. Iterations stop when the interval width or function value is smaller than this tolerance.

Can these methods find multiple roots?

Each run of these algorithms approximates a single root. To find multiple roots, you must run the algorithm with different starting intervals or initial guesses.

What is a double root or root of multiplicity?

A double root occurs where the function touches the x-axis but does not cross it (such as $f(x) = (x-r)^2$). Bisection cannot find these roots because there is no sign change.

math calculator

Bisection & Newton-Raphson Root Finder

Find roots of nonlinear equations using interval bisection and Newton-Raphson methods.

Formula Verified by Dr. Elena Rostova, PhD

Inputs

Root Equation Profile

Interval a

Interval b

Max Iterations

Results

Bisection Method Root

1.521240

Newton-Raphson Method Root1.521380

Equation curve & root

Plot of f(x) showing calculated root intersection

Bisection Method Iteration Log

Step	Bracket a	Bracket b	Midpoint c	f(c)	Width
1	1.0000	2.0000	1.500000	-1.25e-1	1.00e+0
2	1.5000	2.0000	1.750000	1.61e+0	5.00e-1
3	1.5000	1.7500	1.625000	6.66e-1	2.50e-1
4	1.5000	1.6250	1.562500	2.52e-1	1.25e-1
5	1.5000	1.5625	1.531250	5.91e-2	6.25e-2
6	1.5000	1.5313	1.515625	-3.41e-2	3.13e-2
7	1.5156	1.5313	1.523438	1.23e-2	1.56e-2
8	1.5156	1.5234	1.519531	-1.10e-2	7.81e-3
9	1.5195	1.5234	1.521484	6.22e-4	3.91e-3
10	1.5195	1.5215	1.520508	-5.18e-3	1.95e-3
11	1.5205	1.5215	1.520996	-2.28e-3	9.77e-4
12	1.5210	1.5215	1.521240	-8.29e-4	4.88e-4

Newton-Raphson Iteration Log

Step	Estimate x_k	f(x_k)	f'(x_k)	Next x_{k+1}	Difference
1	1.500000	-1.25e-1	5.7500	1.521739	2.17e-2
2	1.521739	2.14e-3	5.9471	1.521380	3.59e-4
3	1.521380	5.89e-7	5.9438	1.521380	9.92e-8
4	1.521380	4.53e-14	5.9438	1.521380	7.55e-15

Step-by-Step Numerical Analysis

Select root equation: $f(x) = x^3 - x - 2 = 0$

Intermediate value theorem check passed: $f(1) = -2.0000$ and $f(2) = 4.0000$ have opposite signs.

Formula

Numerical Root formulas

c = \frac{a+b}{2}, \quad x_{k+1} = x_k - \frac{f(x_k)}{f'(x_k)}

Bisection method continuously bisects interval brackets. Newton-Raphson uses tangent slope intercepts to converge quadratically.

Step by step

How the calculation works

1Select the function equation profile (Cubic, Exponential, Trigonometric).
2Set the initial interval brackets [a, b] where the function changes signs.
3Define the maximum iteration limit to observe and compare convergence speed.

Related guides

Learn more about this calculation

Guide

Scientific Notation Guide: Powers of Ten Made Practical

Learn how to convert, compare, and calculate with powers of ten using worked examples and the live DTC scientific calculator.

Site Guide

How to Use Do The Calculation Calculators: A Practical Step-by-Step Guide

Learn the fastest reliable workflow for using Do The Calculation calculators, reading results, checking formulas, and using save, print, share, and export actions correctly.

Scientific

Scientific Calculator

Evaluate transcendental functions.

Quadratic Solver

Evaluate exact algebraic polynomial roots.

math calculator

Bisection & Newton-Raphson Root Finder

Find roots of nonlinear equations using interval bisection and Newton-Raphson methods.

Formula Verified by Dr. Elena Rostova, PhD

Inputs

Root Equation Profile

Interval a

Interval b

Max Iterations

Results

Bisection Method Root

1.521240

Newton-Raphson Method Root1.521380

Equation curve & root

Plot of f(x) showing calculated root intersection

Bisection Method Iteration Log

Step	Bracket a	Bracket b	Midpoint c	f(c)	Width
1	1.0000	2.0000	1.500000	-1.25e-1	1.00e+0
2	1.5000	2.0000	1.750000	1.61e+0	5.00e-1
3	1.5000	1.7500	1.625000	6.66e-1	2.50e-1
4	1.5000	1.6250	1.562500	2.52e-1	1.25e-1
5	1.5000	1.5625	1.531250	5.91e-2	6.25e-2
6	1.5000	1.5313	1.515625	-3.41e-2	3.13e-2
7	1.5156	1.5313	1.523438	1.23e-2	1.56e-2
8	1.5156	1.5234	1.519531	-1.10e-2	7.81e-3
9	1.5195	1.5234	1.521484	6.22e-4	3.91e-3
10	1.5195	1.5215	1.520508	-5.18e-3	1.95e-3
11	1.5205	1.5215	1.520996	-2.28e-3	9.77e-4
12	1.5210	1.5215	1.521240	-8.29e-4	4.88e-4

Newton-Raphson Iteration Log

Step	Estimate x_k	f(x_k)	f'(x_k)	Next x_{k+1}	Difference
1	1.500000	-1.25e-1	5.7500	1.521739	2.17e-2
2	1.521739	2.14e-3	5.9471	1.521380	3.59e-4
3	1.521380	5.89e-7	5.9438	1.521380	9.92e-8
4	1.521380	4.53e-14	5.9438	1.521380	7.55e-15

Step-by-Step Numerical Analysis

Select root equation: $f(x) = x^3 - x - 2 = 0$

Intermediate value theorem check passed: $f(1) = -2.0000$ and $f(2) = 4.0000$ have opposite signs.

Formula

Numerical Root formulas

c = \frac{a+b}{2}, \quad x_{k+1} = x_k - \frac{f(x_k)}{f'(x_k)}

Bisection method continuously bisects interval brackets. Newton-Raphson uses tangent slope intercepts to converge quadratically.

Step by step

How the calculation works

1Select the function equation profile (Cubic, Exponential, Trigonometric).
2Set the initial interval brackets [a, b] where the function changes signs.
3Define the maximum iteration limit to observe and compare convergence speed.

Related guides

Learn more about this calculation

Guide

Evaluate exact algebraic polynomial roots.