Bisection Method Equation Solver
Solve f(x)=0 with the bisection method. Enter a function and an interval to get the approximate root, f(root), the iteration count, and the error, plus a per-step table of intervals and midpoints and a function graph.
Input
Use + - * / for arithmetic, ^ for powers, and functions such as sin/cos/exp/log/sqrt. Constants: pi, e. Variable: x.
Stop once half the interval width drops to this value or below
Result
Approximate root x
1.4142135605
Converged within the tolerance
Value of f(root)
-5.237e-9
Iterations
28
Estimated error
7.451e-9
Graph of y = f(x) and the computed root
Iteration log
| Step | a | b | Midpoint c | f(c) |
|---|---|---|---|---|
| 1 | 0 | 2 | 1 | -1.000e+0 |
| 2 | 1 | 2 | 1.5 | 2.500e-1 |
| 3 | 1 | 1.5 | 1.25 | -4.375e-1 |
| 4 | 1.25 | 1.5 | 1.375 | -1.094e-1 |
| 5 | 1.375 | 1.5 | 1.4375 | 6.641e-2 |
| 6 | 1.375 | 1.4375 | 1.40625 | -2.246e-2 |
| 7 | 1.40625 | 1.4375 | 1.421875 | 2.173e-2 |
| 8 | 1.40625 | 1.421875 | 1.4140625 | -4.272e-4 |
| 9 | 1.4140625 | 1.421875 | 1.41796875 | 1.064e-2 |
| 10 | 1.4140625 | 1.41796875 | 1.41601563 | 5.100e-3 |
| 11 | 1.4140625 | 1.41601563 | 1.41503906 | 2.336e-3 |
| 12 | 1.4140625 | 1.41503906 | 1.41455078 | 9.539e-4 |
| 13 | 1.4140625 | 1.41455078 | 1.41430664 | 2.633e-4 |
| 14 | 1.4140625 | 1.41430664 | 1.41418457 | -8.200e-5 |
| 15 | 1.41418457 | 1.41430664 | 1.41424561 | 9.063e-5 |
| 16 | 1.41418457 | 1.41424561 | 1.41421509 | 4.315e-6 |
| 17 | 1.41418457 | 1.41421509 | 1.41419983 | -3.884e-5 |
| 18 | 1.41419983 | 1.41421509 | 1.41420746 | -1.726e-5 |
| 19 | 1.41420746 | 1.41421509 | 1.41421127 | -6.475e-6 |
| 20 | 1.41421127 | 1.41421509 | 1.41421318 | -1.080e-6 |
| 21 | 1.41421318 | 1.41421509 | 1.41421413 | 1.617e-6 |
| 22 | 1.41421318 | 1.41421413 | 1.41421366 | 2.687e-7 |
| 23 | 1.41421318 | 1.41421366 | 1.41421342 | -4.056e-7 |
| 24 | 1.41421342 | 1.41421366 | 1.41421354 | -6.846e-8 |
| 25 | 1.41421354 | 1.41421366 | 1.4142136 | 1.001e-7 |
| 26 | 1.41421354 | 1.4142136 | 1.41421357 | 1.584e-8 |
| 27 | 1.41421354 | 1.41421357 | 1.41421355 | -2.631e-8 |
| 28 | 1.41421355 | 1.41421357 | 1.41421356 | -5.237e-9 |
How it works
- The bisection method exploits the fact that when f(a) and f(b) have opposite signs (f(a)·f(b) < 0), a root must lie between them, repeatedly halving the interval to close in on it.
- The function f(x) may use arithmetic operators, the power operator ^, parentheses, and a unary minus, plus functions such as sin, cos, tan, exp, log (natural log), log10, sqrt, and abs, and the constants pi and e. Use x for the variable.
- Choose the left endpoint a and right endpoint b so that the function changes sign between them. The method cannot be applied on an interval where the sign stays the same, and an error is shown.
- The tolerance is the stopping criterion: convergence is declared once half the interval width drops to this value or below. A smaller value increases accuracy but requires more iterations.
- The maximum iteration count is a safety limit. If convergence is not reached within that many steps, the current approximation is reported as not converged.
- Because the interval is halved exactly each step, convergence is stable and reliable, though slower than methods such as Newton's. When several roots exist, the one you find depends on how the interval is chosen.
Reviews
Tell us what you think of this calculator.
Write a review
Found an incorrect result or a problem? Turn this on to report it.
- Home
Bisection Method Equation Solver