Scribd Logo
Upload

Welcome to Scribd!

  • 35 views

    Bisection Method

    Uploaded by

    Malibu Barbie
    The bisection method is used to find the roots of polynomial equations by repeatedly bisecting intervals and narrowing in on the root. It works by choosing a starting interval that brackets the root, computing the midpoint of that interval, and then restricting the interval to the half that still brackets the root. This process is repeated with smaller intervals until the interval size is within a specified tolerance of the root. Two examples demonstrate applying the bisection method to find roots of equations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Bisection Method

    Uploaded by

    Malibu Barbie
    35 views20 pages
    The bisection method is used to find the roots of polynomial equations by repeatedly bisecting intervals and narrowing in on the root. It works by choosing a starting interval that brackets the root, computing the midpoint of that interval, and then restricting the interval to the half that still brackets the root. This process is repeated with smaller intervals until the interval size is within a specified tolerance of the root. Two examples demonstrate applying the bisection method to find roots of equations.

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The bisection method is used to find the roots of polynomial equations by repeatedly bisecting intervals and narrowing in on the root. It works by choosing a starting interval that brackets the root, computing the midpoint of that interval, and then restricting the interval to the half that still brackets the root. This process is repeated with smaller intervals until the interval size is within a specified tolerance of the root. Two examples demonstrate applying the bisection method to find roots of equations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    35 views20 pages

    Bisection Method

    Uploaded by

    Malibu Barbie
    The bisection method is used to find the roots of polynomial equations by repeatedly bisecting intervals and narrowing in on the root. It works by choosing a starting interval that brackets the root, computing the midpoint of that interval, and then restricting the interval to the half that still brackets the root. This process is repeated with smaller intervals until the interval size is within a specified tolerance of the root. Two examples demonstrate applying the bisection method to find roots of equations.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 20

    Bisection

    Method
    Definition

    The bisection method is used to find


    the roots of a polynomial equation. It
    separates the interval and subdivides
    the interval in which the root of the
    equation lies.
    Definition

    Polynomial Equations
    These are equations formed with
    variables, exponents, and coefficients.
    Definition

    Polynomial Equations
    𝑓 𝑥 = 3𝑥 2 + 5𝑥 + 19
    𝑓 𝑥 = 5𝑥 3 + 12𝑥 2 − 0.4𝑥 + 19
    Definition

    Bisection Method
    The principle behind this method is the
    intermediate theorem for continuous
    functions. It works by narrowing the
    gap between the positive and negative
    intervals of the function until it closes
    in on the correct answer.
    Definition

    Bisection Method
    • It is applicable to equations of the form 𝑓(𝑥) = 0.
    • We find limiting values 𝑥𝑎 and 𝑥𝑏 . Then the limiting values
    therefore brackets the root.
    • The bisection method is also known as interval halving method
    since the strategy is to bisect or halve the interval from values 𝑥𝑎
    and 𝑥𝑏 , then to retain the half interval whose ends still brackets
    the root.
    Definition Bisection Method
    Definition

    Bisection Method
    • This method will divide the interval until the resulting interval is
    found.
    • The bisection method is also known as root-finding method, binary
    search method or dichotomy method.
    • It is a simple method, and it is relatively slow.
    Procedures

    1. Choose limiting values 𝑥𝑏 and 𝑥𝑎 (𝑥𝑏 > 𝑥𝑎 );


    2. Compute either 𝑓(𝑥𝑏 ) and 𝑓(𝑥𝑎 );
    𝑥𝑎 +𝑥𝑏
    3. Compute the interval mid-point 𝑥𝑚 = and 𝑓(𝑥𝑚 );
    2
    4. Use either 𝑓(𝑥𝑎 ) or 𝑓(𝑥𝑏 ) depending on which is
    available in step 2;
    If: 𝑓(𝑥𝑎 ) ∙ 𝑓(𝑥𝑚 ) > 0 reset 𝑥𝑎 to 𝑥𝑚
    If: 𝑓(𝑥𝑎 ) ∙ 𝑓(𝑥𝑚 ) < 0 reset 𝑥𝑏 to 𝑥𝑚
    If: 𝑓(𝑥𝑏 ) ∙ 𝑓(𝑥𝑚 ) > 0 reset 𝑥𝑏 to 𝑥𝑚
    If: 𝑓(𝑥𝑏 ) ∙ 𝑓(𝑥𝑚 ) < 0 reset 𝑥𝑎 to 𝑥𝑚
    Procedures

    5. If (𝑥𝑏 −𝑥𝑎 ) is sufficiently small, i.e., less than or equal


    to some small, prescribed quantity ∈, proceed to step
    6, otherwise return to step 3;
    6. Use linear interpolation to estimate the root 𝑥 from
    either of:
    𝑥𝑏 − 𝑥𝑎 𝑓(𝑥𝑎 )
    𝑥 = 𝑥𝑎 −
    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )

    𝑥𝑏 − 𝑥𝑎 𝑓(𝑥𝑏 )
    𝑥 = 𝑥𝑏 −
    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    Procedures
    (𝑥 − 𝑥𝑎 ) (𝑥𝑏 − 𝑥𝑎 )
    =
    0 − 𝑓(𝑥𝑎 ) 𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    −𝑓(𝑥𝑎 )(𝑥𝑏 − 𝑥𝑎 )
    (𝑥 − 𝑥𝑎 ) =
    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    𝑓(𝑥𝑎 )(𝑥𝑏 − 𝑥𝑎 ) 𝑓(𝑥𝑏 ) − 0
    𝑥 = 𝑥𝑎 −
    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )

    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    (𝑥𝑏 − 𝑥)

    0 − 𝑓(𝑥𝑎 ) (𝑥𝑏 − 𝑥) (𝑥𝑏 − 𝑥𝑎 )


    =
    (𝑥 − 𝑥𝑎 ) 𝑓(𝑥𝑏 ) − 0 𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    (𝑥𝑏 − 𝑥𝑎 ) 𝑓(𝑥𝑏 )(𝑥𝑏 − 𝑥𝑎 )
    −(𝑥 − 𝑥𝑏 ) =
    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    −𝑓(𝑥𝑏 )(𝑥𝑏 − 𝑥𝑎 )
    (𝑥 − 𝑥𝑏 ) =
    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    𝑓(𝑥𝑏 )(𝑥𝑏 − 𝑥𝑎 )
    𝑥 = 𝑥𝑏 −
    𝑓 𝑥𝑏 − 𝑓(𝑥𝑎 )
    Examples Problem 1
    Determine the root of the given equation 𝑥 2 − 3 = 0. Use ∈= 0.01
    1. Choose limiting values 𝑥𝑏 and 𝑥𝑎 (𝑥𝑏 > 𝑥𝑎 );
    𝑥𝑏 = 2 and 𝑥𝑎 = 1
    2. Compute either 𝑓(𝑥𝑏 ) and 𝑓(𝑥𝑎 );
    𝑓(𝑥𝑏 ) = 1 and 𝑓(𝑥𝑎 ) = −2
    𝑥𝑎 +𝑥𝑏
    3. Compute the interval mid-point 𝑥𝑚 = and 𝑓(𝑥𝑚 );
    2
    𝑥𝑎 +𝑥𝑏
    𝑥𝑚 = = 1.5 and 𝑓(𝑥𝑚 ) = −0.75;
    2
    Examples Problem 1
    Determine the root of the given equation 𝑥 2 − 3 = 0. Use ∈= 0.01
    4. Use either 𝑓(𝑥𝑎 ) or 𝑓(𝑥𝑏 ) depending on which is
    available in step 2;
    𝑥𝑎 𝑥𝑏 𝑥𝑚 𝑓(𝑥𝑚 )
    1.0 2.0 1.50 -0.750
    1.5 2.0 1.75 0.063 If: 𝑓(𝑥𝑎 ) ∙ 𝑓(𝑥𝑚 ) > 0 reset 𝑥𝑎 to 𝑥𝑚
    1.50 1.75 1.625 -0.359 If: 𝑓(𝑥𝑎 ) ∙ 𝑓(𝑥𝑚 ) < 0 reset 𝑥𝑏 to 𝑥𝑚
    1.625 1.75 1.688 -0.152 If: 𝑓(𝑥𝑏 ) ∙ 𝑓(𝑥𝑚 ) > 0 reset 𝑥𝑏 to 𝑥𝑚
    1.688 1.75 1.719 -0.046
    1.719 1.75 1.735 0.008 If: 𝑓(𝑥𝑏 ) ∙ 𝑓(𝑥𝑚 ) < 0 reset 𝑥𝑎 to 𝑥𝑚
    1.719 1.735 1.727 -0.017
    1.727 1.735 1.731 -0.004
    Examples Problem 1
    Determine the root of the given equation 𝑥 2 − 3 = 0. Use ∈= 0.01
    5. If (𝑥𝑏 −𝑥𝑎 ) is sufficiently small, i.e., less than or equal to some
    small, prescribed quantity ∈, proceed to step 6, otherwise return
    to step 3;
    𝑥𝑎 𝑥𝑏 𝑥𝑚 𝑓(𝑥𝑚 )
    1.0 2.0 1.50 -0.750
    1.5 2.0 1.75 0.063
    1.50 1.75 1.625 -0.359
    1.625 1.75 1.688 -0.152
    1.688 1.75 1.719 -0.046
    1.719 1.75 1.735 0.008 Since (𝑥𝑏 −𝑥𝑎 ) = 0.008 < ∈= 0.01
    1.719
    1.727
    1.735
    1.735
    1.727
    1.731
    -0.017
    -0.004
    Therefore, accept the intervals
    𝑥𝑏 = 1.735 & 𝑥𝑎 = 1.727
    Examples Problem 1
    Determine the root of the given equation 𝑥 2 − 3 = 0. Use ∈= 0.01
    6. Use linear interpolation to estimate the root 𝑥 from either of:
    The intervals are 𝑥𝑏 = 1.735 & 𝑥𝑎 = 1.727
    𝑥𝑏 − 𝑥𝑎 𝑓 𝑥𝑎 0.008(−0.017)
    𝑥 = 𝑥𝑎 − = 1.727 −
    𝑓 𝑥𝑏 − 𝑓 𝑥𝑎 0.008 − (−0.017)
    𝒙 = 𝟏. 𝟕𝟑𝟐
    Examples Problem 2
    Determine the root of the given equation 𝑥 4 − 4𝑥 3 + 6𝑥 2 − 2.25 = 0.
    Use ∈= 0.01
    1. Choose limiting values 𝑥𝑏 and 𝑥𝑎 (𝑥𝑏 > 𝑥𝑎 );
    𝑥𝑏 = 1 and 𝑥𝑎 = 0
    2. Compute either 𝑓(𝑥𝑏 ) and 𝑓(𝑥𝑎 );
    𝑓(𝑥𝑏 ) = 0.75 and 𝑓(𝑥𝑎 ) = −2.25
    𝑥𝑎 +𝑥𝑏
    3. Compute the interval mid-point 𝑥𝑚 = and 𝑓(𝑥𝑚 );
    2
    𝑥𝑎 +𝑥𝑏
    𝑥𝑚 = = 0.5 and 𝑓(𝑥𝑚 ) = −1.188;
    2
    Examples Problem 2
    Determine the root of the given equation 𝑥 4 − 4𝑥 3 + 6𝑥 2 − 2.25 = 0.
    Use ∈= 0.01
    4. Use either 𝑓(𝑥𝑎 ) or 𝑓(𝑥𝑏 ) depending on which is
    available in step 2;

    𝑥𝑎 𝑥𝑏 𝑥𝑚 𝑓(𝑥𝑚 ) If: 𝑓(𝑥𝑎 ) ∙ 𝑓(𝑥𝑚 ) > 0 reset 𝑥𝑎 to 𝑥𝑚


    0.0 1.0 0.50 -1.188 If: 𝑓(𝑥𝑎 ) ∙ 𝑓(𝑥𝑚 ) < 0 reset 𝑥𝑏 to 𝑥𝑚
    0.5 1.0 0.75 -0.246 If: 𝑓(𝑥𝑏 ) ∙ 𝑓(𝑥𝑚 ) > 0 reset 𝑥𝑏 to 𝑥𝑚
    0.75 1.00 0.875 0.250
    0.75 0.875 0.813 0.001
    If: 𝑓(𝑥𝑏 ) ∙ 𝑓(𝑥𝑚 ) < 0 reset 𝑥𝑎 to 𝑥𝑚
    0.75 0.813 0.782 -0.122
    0.782 0.813 0.798 -0.058
    0.798 0.813 0.806 -0.027
    0.806 0.813 0.810 -0.011
    Examples Problem 2
    Determine the root of the given equation 𝑥 4 − 4𝑥 3 + 6𝑥 2 − 2.25 = 0.
    Use ∈= 0.01
    5. If (𝑥𝑏 −𝑥𝑎 ) is sufficiently small, i.e., less than or equal to some
    small, prescribed quantity ∈, proceed to step 6, otherwise return
    to step 3;
    𝑥𝑎 𝑥𝑏 𝑥𝑚 𝑓(𝑥𝑚 )
    0.0 1.0 0.50 -1.188
    0.5 1.0 0.75 -0.246
    0.75 1.00 0.875 0.250
    0.75 0.875 0.813 0.001 Since (𝑥𝑏 −𝑥𝑎 ) = 0.007 < ∈= 0.01
    0.75 0.813 0.782 -0.122
    0.782 0.813 0.798 -0.058
    Therefore, accept the intervals
    0.798 0.813 0.806 -0.027 𝑥𝑏 = 0.813 & 𝑥𝑎 = 0.806
    0.806 0.813 0.810 -0.011
    Examples Problem 2
    Determine the root of the given equation 𝑥 4 − 4𝑥 3 + 6𝑥 2 − 2.25 = 0.
    Use ∈= 0.01
    6. Use linear interpolation to estimate the root 𝑥 from either of:
    The intervals are 𝑥𝑏 = 0.813 & 𝑥𝑎 = 0.806
    𝑥𝑏 − 𝑥𝑎 𝑓 𝑥𝑎 0.007(−0.027)
    𝑥 = 𝑥𝑎 − = 0.806 −
    𝑓 𝑥𝑏 − 𝑓 𝑥𝑎 0.001 − (−0.027)

    𝒙 = 𝟎. 𝟖𝟏𝟑
    Bisection
    Method
    END OF
    PRESENTATION

    You might also like