Scribd Logo
Upload

Welcome to Scribd!

  • Bisection Method

    Uploaded by

    xand
    161 views4 pages
    The bisection method is a root-finding algorithm that uses binary search to locate a root within a bracketed interval. It works by repeatedly bisecting the interval and narrowing in on the root. At each step, it evaluates the function at the midpoint of the interval and replaces either the lower or upper boundary depending on the sign of the function. It guarantees convergence but may be slow. The number of iterations needed to obtain a given error is related to the log of the initial interval width over the required error. An example Excel worksheet demonstrates using the bisection method to find the four roots of the function f(x) = x^4 - 2x^3 - 13x^2 + 14x + 24.

    Original Description:

    Numerical Methods

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The bisection method is a root-finding algorithm that uses binary search to locate a root within a bracketed interval. It works by repeatedly bisecting the interval and narrowing in on the root. At each step, it evaluates the function at the midpoint of the interval and replaces either the lower or upper boundary depending on the sign of the function. It guarantees convergence but may be slow. The number of iterations needed to obtain a given error is related to the log of the initial interval width over the required error. An example Excel worksheet demonstrates using the bisection method to find the four roots of the function f(x) = x^4 - 2x^3 - 13x^2 + 14x + 24.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    161 views4 pages

    Bisection Method

    Uploaded by

    xand
    The bisection method is a root-finding algorithm that uses binary search to locate a root within a bracketed interval. It works by repeatedly bisecting the interval and narrowing in on the root. At each step, it evaluates the function at the midpoint of the interval and replaces either the lower or upper boundary depending on the sign of the function. It guarantees convergence but may be slow. The number of iterations needed to obtain a given error is related to the log of the initial interval width over the required error. An example Excel worksheet demonstrates using the bisection method to find the four roots of the function f(x) = x^4 - 2x^3 - 13x^2 + 14x + 24.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 4

    Franz Loui Rosario Numerical Methods GEM 602

    Bisection Method

    It is one of the root-finding methods available. It is simple and guaranteed to converge, but may be slow
    in finding a root. Other names of the method are internal halving method, binary search, and dichotomy
    method.

    The method starts with choosing a boundary [a,b] wherein the function is defined over the interval and
    f(a) and f(b) are opposite in sign. The condition guarantees that there must be at least one root between
    the set boundary. Then, the difference between the boundaries is decreased until an acceptable
    difference is met. The decrease in difference of interval is achieved by halving the previous difference.
    For example, let c = (a+b)/2 and then replacing one of the boundaries (a or b) with c. To determine
    which boundary is to be replaced, f(c) should have opposite sign with f(a or b). If f(c) = 0 then, c is a root
    and the process stops. In the figure above, c will replace a and the halving of the interval continues. The
    algorithm, presented in a flowchart, is found in the latter pages.

    Number of Iterations Needed

    Let be the actual root


    1
    1 < (1 1 )
    2
    1 1
    2 < [ (1 1 )]
    2 2
    1
    3 < 3 (1 1 )
    2
    It can be seen that the error (difference from the actual value) decreases by half in each iteration.
    Therefore,
    1
    < ( 1 )
    2 1
    This expression allows one to solve for the number of iterations needed to obtain a required error.

    log ( )

    >
    log 2
    Franz Loui Rosario Numerical Methods GEM 602

    Algorithm

    Start

    Define f(x)=Ax5+Bx4+Cx3+Dx2+Ex+F
    +
    =
    2 A

    Is (bk Yes
    Input ak = , bk =
    ak )< root= ck
    Set

    No B

    Obtain f(ak) and f(bk)


    root= bk B

    No

    Is
    Yes Is Yes
    f(ak)f(bk)=0 root= ak
    f(ak)=0

    No B End

    No
    Yes Is Obtain ck and
    f(ak)f(bk)>0 f(ck)

    No Is
    A aK = ck; bk = bk f(ak)f(ck)<0

    Yes

    A aK = ak; bk = ck
    Franz Loui Rosario Numerical Methods GEM 602

    Example

    A macro-enabled excel root-finding through bisection method worksheet was made. This worksheet can
    find roots for the f(x)=Ax5+Bx4+Cx3+Dx2+Ex+F=0.

    Below are screenclips of the worksheet finding roots for the f(x) = x4-2x3-13x2+14x+24. The roots are -3,-
    1,2 and 4.
    Franz Loui Rosario Numerical Methods GEM 602

    You might also like