Bisection method

This article is about searching zeros of continuous functions. For searching a finite sorted array, see binary search algorithm. For the method of determining what software change caused a change in behavior, see Bisection (software engineering).

A few steps of the bisection method applied over the starting range [a₁;b₁]. The bigger red dot is the root of the function.

In mathematics, the bisection method is a root-finding method that applies to any continuous function for which one knows two values with opposite signs. The method consists of repeatedly bisecting the interval defined by these values and then selecting the subinterval in which the function changes sign, and therefore must contain a root. It is a very simple and robust method, but it is also relatively slow. Because of this, it is often used to obtain a rough approximation to a solution which is then used as a starting point for more rapidly converging methods. The method is also called the interval halving method, the binary search method, or the dichotomy method.

For polynomials, more elaborate methods exist for testing the existence of a root in an interval (Descartes' rule of signs, Sturm's theorem, Budan's theorem). They allow extending the bisection method into efficient algorithms for finding all real roots of a polynomial; see Real-root isolation.

The method

The method is applicable for numerically solving the equation $f(x)=0$ for the real variable $x$, where $f$ is a continuous function defined on an interval $[a,b]$ and where $f(a)$ and $f(b)$ have opposite signs. In this case $a$ and $b$ are said to bracket a root since, by the intermediate value theorem, the continuous function $f$ must have at least one root in the interval $(a,b)$.

At each step the method divides the interval in two parts/halves by computing the midpoint $c=(a+b)/2$ of the interval and the value of the function $f(c)$ at that point. If $c$ itself is a root then the process has succeeded and stops. Otherwise, there are now only two possibilities: either $f(a)$ and $f(c)$ have opposite signs and bracket a root, or $f(c)$ and $f(b)$ have opposite signs and bracket a root. The method selects the subinterval that is guaranteed to be a bracket as the new interval to be used in the next step. In this way an interval that contains a zero of $f$ is reduced in width by 50% at each step. The process is continued until the interval is sufficiently small.

Explicitly, if $f(c)=0$ then $c$ may be taken as the solution and the process stops. Otherwise, if $f(a)$ and $f(c)$ have opposite signs, then the method sets $c$ as the new value for $b$, and if $f(b)$ and $f(c)$ have opposite signs then the method sets $c$ as the new $a$. In both cases, the new $f(a)$ and $f(b)$ have opposite signs, so the method is applicable to this smaller interval.

IEEE Standard-754 for Computer Arithmetic

If the algorithm is being used in the real number system, it is possible to continue the bisection until the relative error produces the desired approximation.

If the algorithm is used with computer arithmetic, a further problem arises.

In order to improve reliably and portably, the Institute of Electrical and Electronics Engineers (IEEE) produced a standard for floating point arithmetic in 1985 and has revised it in 2008 and 2019; see IEEE 754. The IEEE Standard 754 representation is the standard used in most micro-computers. It is, for example, the basis of the PC floating point processor.

Double-precision numbers occupy 64 bits which are divided into a sign bit (+/-), an exponent of 10 bits, and a fractional part of 53 bits.

In order to allow for fractions (negative exponents), the exponent is biased to make the effective number of bits for the exponent 9. The effective values of the exponent with 0 < e ≤ 1023 would be $(2^{-511},2^{512})$ making the double precision numbers take the form

$(-1)^{s}2^{e-511}0.f$

The extreme range for a positive DP number would then be

$(1.492\times 10^{-154},1.341\times 10^{154})$

Because the fraction would normally have a non-zero leading digit (a 1 for binary) that bit does not need to be stored as the processor will supply it. As a result, the 53 bit fraction can be stored in 52 bits so the other bit can be used in the exponent to give an actual range of 0 < e ≤ 2047.

The range can be further extended by putting the assumed 1 before the binary point.

If both the exponent and fraction are 0, then the number is 0 (with a sign).

In order to deal with 3 other extreme situations, an exponent of 2047 is reserved for NaN (Not a Number - such as division by 0) and the infinities.

A number is thus stored in the following form:

.
s	e											f
63	52											0

The following are examples of some double precision numbers:

Double Precision

Decimal 3
0	100	0000	0000	1000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000
4		0	0	8	0	0	0	0	0	0	0	0	0	0	0	0
Positive infinity $(+\infty )$
0	111	1111	1111	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000
7		F	F	0	0	0	0	0	0	0	0	0	0	0	0	0
Max. double 1.7976931348623157 × $10^{308}$
0	111	1111	1110	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111
7		F	E	F	F	F	F	F	F	F	F	F	F	F	F	F
Min. normal 2.2250738585072014 × 1$10^{-308}$
0	000	0000	0001	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000
0		0	1	0	0	0	0	0	0	0	0	0	0	0	0	0
Max. subnormal 2.2250738585072009 × $10^{-308}$
0	000	0000	0000	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111	1111
0		0	0	F	F	F	F	F	F	F	F	F	F	F	F	F
Min. subnormal 4.9406564584124654 × $10^{-324}$
0	000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0001
0		0	0	0	0	0	0	0	0	0	0	0	0	0	0	1
NaN
0	111	1111	1111	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0000	0001
7		F	F	0	0	0	0	0	0	0	0	0	0	0	0	1

• The first one (decimal 3) illustrates that 3 (binary 11) has a single one In the fraction part - the other 1 is assumed.
• The second one Is an example for which the exponent is 2047 $(+\infty )$.

• The third one gives the largest number which can be represented in double precision arithmetic. Note that 1.7976931348623157e+308 + 0.0000000000000001e+308 = inf

• The next one, the minimum normal, represents the smallest number that can be used with full double precision.

• The maximum subnormal and the minimum subnormal represent a range of numbers that have less than full double precision.

It is the minimum subnormal, that is crucial for the bisection algorithm.

If

$b-a<9.8813129168249309\times 10^{-324}$

(2 X the min.subnormal) the interval can not be divided and the process must stop.

Algorithm

import numpy as np
import math


def bisect(f, a, b, tol, bound=9.8813129168249309e-324):
    ############################################################################E
    # input: Function f,
    #        endpoint values a, b,
    #        tolerance tol, (if tol = 5e-t and bound = 9.0e-324 the function 
    #                        returns t significant digits for a root between the 
    #                        minimum normal and the maximum normal),
    #         bound (if bound=9.8813129168249309e-324, the algorithm continues  
    #                until the interval cannot be further divided, a larger value 
    #                may result in termination before t digits are found).
    # conditions: f is a continuous function in the interval [a, b],
    #             a < b,
    #             and f(a)*f(b) < 0.
    # output:    [root, iterations, convergence, termination condition]    
    #############################################################################N
    if b <= a:
        return [float("NAN"), 0, "No convergence", "b < a"]
    fa = f(a)
    fb = f(b)
    if np.sign(fa) == np.sign(fb):
        return [float("NAN"), 0, "No convergence", "f(a)*f(b) > 0"]
    en = 0
    while en < 2200:
        en += 1
        if np.sign(a) == np.sign(b):  # avoid overflow
            c = a + (b - a)/2
        else:
            c = (a + b)/2
        fc = f(c)
        if b - a <= bound:
            return [bound, en, "No convergence", "Bound reached"]
        if fc == 0:
            return [c, en, "Converged", "f(c) = 0"]
        if b - a <= abs(c) * tol:
            return [c, en, "Converged", "Tolerance"]
        if np.sign(fa) == np.sign(fc):
            a = c
            fa = fc
        else:
            b = c

    return [float("NAN"), en, "No convergence", "Bad function"]

The first 2 examples test for incorrect input values:

 1 bisect(lambda x: x -                  1, 5, 1, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root =                nan 
No convergence after 0 iterations with termination b < a
Final interval [               nan,                nan]

 2 bisect(lambda x: x -                  1, 5, 7, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root =                nan 
No convergence after 0 iterations with termination f(a)*f(b) > 0
Final interval [               nan,                nan]

Large roots:

 3 bisect(lambda x: x -  12345678901.23456, 0, 1.23457e+14, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root =  12345678901.23454 
Converged after 62 iterations with termination Tolerance
Final interval [1.2345678901234526e+10, 1.2345678901234552e+10]

 4 bisect(lambda x: x - 1.23456789012456e+100, 0, 2e+100, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root = 1.234567890124561e+100 
Converged after 50 iterations with termination Tolerance
Final interval [1.2345678901245599e+100, 1.2345678901245619e+100]

The final interval is computed as [c - w/2, c + w/2] where $w={\frac {b-a}{2^{n}}}$. This can give good measure as to the accuracy of the approximation

Root near maximum:

 5 bisect(lambda x: x - 1.234567890123456e+307, 0, 1e+308, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root = 1.234567890123454e+307 
Converged after 52 iterations with termination Tolerance
Final interval [1.2345678901234535e+307, 1.2345678901234555e+307]

Small roots:

 6 bisect(lambda x: x - 1.234567890123456e-05, 0, 1, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root = 1.234567890123455e-05 
Converged after 65 iterations with termination Tolerance
Final interval [1.2345678901234537e-05, 1.2345678901234564e-05]

 7 bisect(lambda x: x - 1.234567890123456e-100, 0, 1, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root = 1.234567890123454e-100 
Converged after 381 iterations with termination Tolerance
Final interval [1.2345678901234532e-100, 1.2345678901234552e-100]

Ex. 8 is beyond the minimum normal but gives a fairly good result because the approximation has a small interval. Calculations for values in the subnormal range can produce unexpected results.

 8 bisect(lambda x: x - 1.234567890123457e-310, 0, 1, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root = 1.234567890123457e-310 
Converged after 1071 iterations with termination f(c) = 0
Final interval [1.2345678901232595e-310, 1.2345678901236548e-310]

If the return state is '$f(c)=0$', then the desired tolerance may not have been achieved. This can be checked by lowering the tolerance until a return state of 'Tolerance' is achieved.

8a bisect(lambda x: x - 1.234567890123457e-310, 0, 1, 5.000000e-13)
         Approx. root = 1.234567890123457e-310 
Converged after 1071 iterations with termination f(c) = 0
Final interval [1.2345678901232595e-310, 1.2345678901236548e-310]

8b bisect(lambda x: x - 1.234567890123457e-310, 0, 1, 5.000000e-12)
         Approx. root = 1.234567890124643e-310 
Converged after 1069 iterations with termination Tolerance
Final interval [1.2345678901238524e-310, 1.2345678901254334e-310]

8b shows that the result has 12 digits.

Even though the root is outside the 'normal' range, it may still be possible to achieve results with good tolerance.

 9 bisect(lambda x: x - 1.234567891003685e-315, 0, 1, 5.000000e-03, 9.8813129168249309e-324)
         Approx. root = 1.23558592808891e-315 
Converged after 1055 iterations with termination Tolerance
Final interval [1.2342907646422757e-315, 1.2368810915355439e-315]
1.2368810915355439e-315]

Ex. 10 shows the maximum number of iterations that should be expected:

10 bisect(lambda x: x - 1.234567891003685e-315, -1e+307, 1e+307, 5.000000e-15, 9.8813129168249309e-324)
         Approx. root = 1.234567891003685e-315 
Converged after 2093 iterations with termination f(c) = 0
Final interval [1.2345678910036845e-315, 1.2345678910036845e-315]

There may be situations in which a 'good' approximation is not required. This can be achieved by changing the 'Bound':

11 bisect(lambda x: x - 1.234567890123457e-100, 0, 1, 5.000000e-15, 4.9999999999999997e-12)
         Approx. root =              5e-12 
No convergence after 39 iterations with termination Bound reached
Final interval [4.0905052982270715e-12, 5.9094947017729279e-12]

Evaluation of the final interval may assist in determining accuracy.

The following show the behavior of subnormal numbers And shows how the significant digits are lost:

print(1.234567890123456e-310)
1.23456789012346e-310
print(1.234567890123456e-312)
1.234567890124e-312
print(1.234567890123456e-315)
1.23456789e-315
print(1.234567890123456e-317)
1.234568e-317
print(1.234567890123456e-319)
1.23457e-319
print(1.234567890123456e-321)
1.235e-321
print(1.234567890123456e-323)
1e-323
print(1.234567890123456e-324)
0.0

These examples show that this method gives 15 digit accuracy for functions of the form $f(x)=(x-r)g(x)$ for all $r$ in the range of normal numbers.

Higher order roots

Further problems can arise from the use of computer arithmetic for higher order roots.

To help in considering how to detect and correct inaccurate results consider the following:

bisect(lambda x: (x - 1.23456789012345e-100), 0, 1, 5e-15)
Approx. root = 1.23456789012345e-100 Converged after 381 iterations with termination f(c) = 0
Final interval [1.2345678901234491e-100, 1.2345678901234511e-100]

The final interval [1.2345678901234491e-100, 1.2345678901234511e-100] indicates fairly good accuracy. The bisection method has a distinct advantage over other root finding techniques in that the final interval can be used to determine the accuracy of the final solution. This information will be useful in assessing the accuracy of some following examples.

Next consider what happens for a root of order 3:

bisect(lambda x: (x - 1.23456789012345e-100)**3, 0, 1, 5e-15)
Approx. root = 1.234567898094279e-100 Converged after 357 iterations with termination f(c) = 0
Final interval [1.2345678810624394e-100, 1.2345679151261181e-100]

The final interval [1.2345678810624394e-100, 1.2345679151261181e-100] indicates that 15 digits have not been returned.

The relative error

(1.234567898094279e-100 - 1.23456789012345e-100)/1.23456789012345e-100 
= 6.456371473106003e-09

shows that only 8 digits are correct and again $f(c)=0$. This occurs because

$${\begin{aligned}f(approx.root)&=f(1.234567898094279*10^{-100})\\&=(1.234567898094279*10^{-100}-1.23456789012345*10^{-100})^{3}\\&=(7.970828885817127*10^{-109})^{3}\\&=5.064195*10^{2}*10^{-327}\\&=5.064195*10^{-325}\end{aligned}}$$

Because this is less than the minimum subnormal, it returns a value of 0.

This can occur in any root finding technique, not just the bisection method, and it is only the fact that the return conditions include the information about what stopping criteria was achieved that the problem can be diagnosed.

The use of the relative error as a stopping condition allows us to determine how accurate a solution can be obtained.

Consider what happens on trying to achieve 8 significant figures:

bisect(lambda x: (x - 1.23456789012345e-100)**3, 0, 1, 5e-8)
[1.2345678980942788e-100, 357, 'Converged', 'f(c) = 0']

$f(c)=0$ Indicates that eight digits of accuracy have not been achieved, so try

bisect(lambda x: (x - 1.23456789012345e-100)**3, 0, 1, 5e-4)
[1.2347947281308757e-100, 344, 'Converged', 'Tolerance']

At least four digits have been achieved and

bisect(lambda x: (x - 1.23456789012345e-100)**3, 0, 1, 5e-6)
[1.2345658202098768e-100, 351, 'Converged', 'Tolerance']

6 digit convergence

bisect(lambda x: (x - 1.23456789012345e-100)**3, 0, 1, 5e-7)
[1.2345677277758852e-100, 354, 'Converged', 'Tolerance']

7 digit convergence

A similar problem can arise if there are two small roots close together:

bisect(lambda x: (x - 1.23456789012345e-23)*x, 1e-300, 1, 5e-15)
[1.2345678901234481e-23, 125, 'Converged', 'Tolerance']

15 digit convergence

bisect(lambda x: (x - 1.23456789012345e-24)*x, 1e-300, 1e-20, 5e-1)
[1.5509016039626554e-300, 931, 'Converged', 'f(c) = 0']

Final interval [1.2754508019813276e-300, 1.8263524059439830e-300]
relative error = 3.5521376891678086e-1 -- 1 digit convergence

bisect(lambda x: (x - 1.23456789012345e-23)*x, 1e-300, 1, 5e-1)
[1.1580528575742387e-23, 79, 'Converged', 'Tolerance']

Final interval [1.0753347963189360e-23, 1.2407709188295415e-23]
relative error = 1.4285714285714285e-1 -- 1 digit convergence

(The following has not been changed.)

Generalization to higher dimensions

The bisection method has been generalized to multi-dimensional functions. Such methods are called generalized bisection methods.

Methods based on degree computation

Some of these methods are based on computing the topological degree, which for a bounded region $\Omega \subseteq \mathbb {R} ^{n}$ and a differentiable function $f:\mathbb {R} ^{n}\rightarrow \mathbb {R} ^{n}$ is defined as a sum over its roots:

$\deg(f,\Omega ):=\sum _{y\in f^{-1}(\mathbf {0} )}\operatorname {sgn} \det(Df(y))$,

where $Df(y)$ is the Jacobian matrix, $\mathbf {0} =(0,0,...,0)^{T}$, and

$\operatorname {sgn}(x)={\begin{cases}1,&x>0\\0,&x=0\\-1,&x<0\\\end{cases}}$

is the sign function. In order for a root to exist, it is sufficient that $\deg(f,\Omega )\neq 0$, and this can be verified using a surface integral over the boundary of $\Omega$.

Characteristic bisection method

The characteristic bisection method uses only the signs of a function in different points. Lef f be a function from R^d to R^d, for some integer d ≥ 2. A characteristic polyhedron (also called an admissible polygon) of f is a polytope in R^d, having 2^d vertices, such that in each vertex v, the combination of signs of f(v) is unique and the topological degree of f on its interior is not zero (a necessary criterion to ensure the existence of a root). For example, for d=2, a characteristic polyhedron of f is a quadrilateral with vertices (say) A,B,C,D, such that:

• ⁠$\operatorname {sgn} f(A)=(-,-)$⁠, that is, f₁(A)<0, f₂(A)<0.
• ⁠$\operatorname {sgn} f(B)=(-,+)$⁠, that is, f₁(B)<0, f₂(B)>0.
• ⁠$\operatorname {sgn} f(C)=(+,-)$⁠, that is, f₁(C)>0, f₂(C)<0.
• ⁠$\operatorname {sgn} f(D)=(+,+)$⁠, that is, f₁(D)>0, f₂(D)>0.

A proper edge of a characteristic polygon is a edge between a pair of vertices, such that the sign vector differs by only a single sign. In the above example, the proper edges of the characteristic quadrilateral are AB, AC, BD and CD. A diagonal is a pair of vertices, such that the sign vector differs by all d signs. In the above example, the diagonals are AD and BC.

At each iteration, the algorithm picks a proper edge of the polyhedron (say, A—B), and computes the signs of f in its mid-point (say, M). Then it proceeds as follows:

• If ⁠$\operatorname {sgn} f(M)=\operatorname {sgn}(A)$⁠, then A is replaced by M, and we get a smaller characteristic polyhedron.
• If ⁠$\operatorname {sgn} f(M)=\operatorname {sgn}(B)$⁠, then B is replaced by M, and we get a smaller characteristic polyhedron.
• Else, we pick a new proper edge and try again.

Suppose the diameter (= length of longest proper edge) of the original characteristic polyhedron is D. Then, at least $\log _{2}(D/\varepsilon )$ bisections of edges are required so that the diameter of the remaining polygon will be at most ε. If the topological degree of the initial polyhedron is not zero, then there is a procedure that can choose an edge such that the next polyhedron also has nonzero degree.

See also

• Binary search algorithm
• Lehmer–Schur algorithm, generalization of the bisection method in the complex plane
• Nested intervals

References

• Burden, Richard L.; Faires, J. Douglas (2014). "2.1 The Bisection Algorithm". Numerical Analysis (10th ed.). Cengage Learning. ISBN 978-0-87150-857-7.

Further reading

• Corliss, George (1977). "Which root does the bisection algorithm find?". SIAM Review. 19 (2): 325–327. doi:10.1137/1019044. ISSN 1095-7200.
• Kaw, Autar; Kalu, Egwu (2008). Numerical Methods with Applications (1st ed.). Archived from the original on 2009-04-13.

External links

• Weisstein, Eric W. "Bisection". MathWorld.
• Bisection Method Notes, PPT, Mathcad, Maple, Matlab, Mathematica from Holistic Numerical Methods Institute