Scribd Logo
Upload

Welcome to Scribd!

  • 320 views

    Multiple-Choice Test False-Position Method of Solving A Nonlinear Equation

    Uploaded by

    Jet Gamez
    The document is a multiple choice test on the false-position method for solving nonlinear equations. It contains 6 multiple choice questions that test understanding of key aspects of the false-position method, including: 1) that it is a bracketing method, 2) how the predicted root is calculated, 3) applying it to solve a sample equation given initial guesses and tolerance, 4) determining the accuracy of the converged root, 5) determining the number of significant digits that can be trusted, and 6) identifying when it may have difficulty converging.

    Copyright:

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

    Multiple-Choice Test False-Position Method of Solving A Nonlinear Equation

    Uploaded by

    Jet Gamez
    320 views4 pages
    The document is a multiple choice test on the false-position method for solving nonlinear equations. It contains 6 multiple choice questions that test understanding of key aspects of the false-position method, including: 1) that it is a bracketing method, 2) how the predicted root is calculated, 3) applying it to solve a sample equation given initial guesses and tolerance, 4) determining the accuracy of the converged root, 5) determining the number of significant digits that can be trusted, and 6) identifying when it may have difficulty converging.

    Original Title

    quiz_03nle_falseposition

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document is a multiple choice test on the false-position method for solving nonlinear equations. It contains 6 multiple choice questions that test understanding of key aspects of the false-position method, including: 1) that it is a bracketing method, 2) how the predicted root is calculated, 3) applying it to solve a sample equation given initial guesses and tolerance, 4) determining the accuracy of the converged root, 5) determining the number of significant digits that can be trusted, and 6) identifying when it may have difficulty converging.

    Copyright:

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

    Multiple-Choice Test False-Position Method of Solving A Nonlinear Equation

    Uploaded by

    Jet Gamez
    The document is a multiple choice test on the false-position method for solving nonlinear equations. It contains 6 multiple choice questions that test understanding of key aspects of the false-position method, including: 1) that it is a bracketing method, 2) how the predicted root is calculated, 3) applying it to solve a sample equation given initial guesses and tolerance, 4) determining the accuracy of the converged root, 5) determining the number of significant digits that can be trusted, and 6) identifying when it may have difficulty converging.

    Copyright:

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

    Multiple-Choice Test

    Chapter 03.06
    False-Position Method of Solving a Nonlinear
    Equation
    1. The false-position method for finding roots of nonlinear equations belongs to a class
    of a (an) ____________ method.
    (A) open
    (B) bracketing
    (C) random
    (D) graphical

    2. The newly predicted root for false-position and secant method can be respectively
    given as
    f ( xU ){xU − x L }
    x r = xU −
    f ( xU ) − f (x L )
    and
    f ( xi ){xi − xi −1 }
    xi +1 = xi − ,
    f ( xi ) − f ( xi −1 )
    While the appearance of the above 2 equations look essentially identical, and both
    methods require two initial guesses, the major difference between the above two
    formulas is
    (A) false-position method is not guaranteed to converge.
    (B) secant method is guaranteed to converge
    (C) secant method requires the 2 initial guesses xi −1 and xi to satisfy
    f ( xi −1 ) × f ( xi ) < 0
    (D) false-position method requires the 2 initial guesses x L and xU to satisfy
    f ( x L ) × f ( xU ) < 0

    03.06.1
    03.06.2 Chapter 03.06

    3. Given are the following nonlinear equation


    e −2 x + 4 x 2 − 36 = 0
    two initial guesses, x L = 1 and xU = 4 , and a pre-specified relative error tolerance of
    0.1%. Using the false-position method, which of the following tables is correct ( x r =
    predicted root)?
    (A)
    Iteration xL xU xr
    1 1 4 ?
    2 ? ? 2.939
    (B)
    Iteration xL xU xr
    1 1 4 ?
    2 ? ? 2.500

    (C)
    Iteration xL xU xr
    1 1 4 ?
    2 ? ? 1.500

    (D)
    Iteration xL xU xr
    1 1 4 ?
    2 ? ? 2.784

    03.06.2
    03.06.3 Chapter 03.06

    4. Given are the following nonlinear equation


    e −2 x + 4 x 2 − 36 = 0
    two initial guesses, x L = 1 and xU = 4 , and a pre-specified relative error tolerance of
    0.1%. Using the false-position method, which of the following tables is correct ( x r =
    predicted root, |∈a | = percentage absolute relative approximate error).
    (A)
    Iteration x L xU xr | ∈a | %
    1 1 4 ? ?
    2 ? ? ? 11.63

    (B)
    IterationxL xU xr | ∈a | %
    1 1 4 ? ?
    2 ? ? ? 6.11

    (C)
    Iteration xL xU xr | ∈a | %
    1 1 4 ? ?
    2 ? ? ? 5.14

    (D)
    Iteration xL xU xr | ∈a | %
    1 1 4 ? ?
    2 ? ? ? 4.15

    The root of ( x − 4 ) ( x + 2 ) = 0 was found using false-position method with initial


    2
    5.
    guesses of x L = −2.5 and xU = −1.0 , and a pre-specified relative error tolerance of
    10 −6 %. The final converged root was found as x r == −1.9999997 , and the
    corresponding percentage absolute relative approximate error was found as
    |∈a |= 8.7610979 × 10 −5 % . Based on the given information, the number of significant
    digits of the converged root xr that can be trusted at least are
    (A) 3
    (B) 4
    (C) 5
    (D) 6
    03.06.4 Chapter 03.06

    6. The false-position method may have difficulty in finding the root of


    f ( x ) = x 2 − 7.4 x + 13.69 = 0 because
    (A) f ( x ) is a quadratic polynomial
    (B) f ′(x ) a straight line
    (C) one cannot find initial guesses x L and xU that satisfy f ( x L ) f ( xU ) < 0
    (D) the equation has two identical roots.

    03.06.2

    You might also like