Scribd
Upload
123 views4 pages

Bracketing Method Quiz

Finding the root of a non-linear equation system using numerical methods like regula-falsi requires two initial approximations a and b where f(a) and f(b) have opposite signs. Regula-falsi works by recursively selecting a new point between the two approximations where the function value is closer to zero until the solution is converged upon. The method requires that f(a) and f(b) have opposite signs to properly bracket the root between them.

Uploaded by

NOVIARYA SUKMANINGRUM
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
123 views4 pages

Bracketing Method Quiz

Finding the root of a non-linear equation system using numerical methods like regula-falsi requires two initial approximations a and b where f(a) and f(b) have opposite signs. Regula-falsi works by recursively selecting a new point between the two approximations where the function value is closer to zero until the solution is converged upon. The method requires that f(a) and f(b) have opposite signs to properly bracket the root between them.

Uploaded by

NOVIARYA SUKMANINGRUM
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

In a regula-false, Finding an approximation root of non-linear equation system use four variables;

a, b, f(a) and f(b)



True
True

False

The common problem in a Non-linear equation system is how to find x where f(x) is equal to zero.

True
True

False
The requirement of two initial approximation (a,b) in a bracketing method is that f(a).f(b) > 0.

True
True

False
The revision of regula-false is to modify the value of f in the stagnant position into a half (divided
by two)

True
True

False
The requirement of two initial approximation (a,b) in a bracketing method is that f(a) has different
opposite sign value with f(b), either f(a) positive f(b) negative or f(a) negative f(b) positive. 

True
True

False
Aresult of any numerical method can be either convergent or divergent. The convergent condition
is that the approximation value is getting closer to the exact value. And the divergent is vise vers
a. 

True
True

False
The convergence speed of regula-false method is always better than bisection method. 

True
True

Fals
The result of open method is always convergent.

True
True

False
The open method do not require two initial approximation to find a solution whcih make a bounda
ry to the exact solution

True
True

False
The idea of regula-false using f(a) and f(b) is that the logical thinking if f(a) is closer to zero than f
(b) then the root is also closer to x=a than x=b.

True
True

False
The bracketing method is called as a convergent method which the approximation value can suc
essfully to be closer to the exact value.

True
True

False
Stagnant condition is a condition of regula-false where a straight line (linear line) is always in loca
ted above the curve or below the curve.

True
True

False
Which are the following statements are NOT the stopping criteria of bracketing method

relative error
relative error

the approximation value of function
the approximation value of function

approximation relative error
approximation relative error

the width of new bracket
he result of bracketing method sometimes convergent and sometimes divergent. 

True
True

False
The common problem in a Non-linear equation system is how to find a root?

True
True

False
False
Which are the following statements are TRUE according to the graph!

The third iteration use C1C1and C2C2as a new bracket 
The third iteration use cap c sub 1and cap c sub 2as a new bracket 

C0C0 is the result of the first approximation


cap c sub 0 is the result of the first approximation

C2C2 is the result of the second approximation


 , cap c sub 2 is the result of the second approximation

The second iteration use a andC0C0 as a new bracket
The second iteration use a andcap c sub 0 as a new bracket
The bracketing method always use two approximation points as initial values to compute the next
new bracket.

True
True

False
False

You might also like