CBSE BOARD X, asked by seema02, 7 months ago

If root lies between (2,3), then according to bisection method first iteration will be ________.​

Answers

Answered by kulkarninishant346
18

Explanation:

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 by computing the midpoint c = (a+b) / 2 of the interval and the value of the function f(c) at that point. Unless c is itself a root (which is very unlikely, but possible) 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.[5] 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(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. (If f(c)=0 then c may be taken as the solution and the process stops.) In both cases, the new f(a) and f(b) have opposite signs, so the method is applicable to this smaller interval.[6]

Iteration tasks

The input for the method is a continuous function f, an interval [a, b], and the function values f(a) and f(b). The function values are of opposite sign (there is at least one zero crossing within the interval). Each iteration performs these steps:

Calculate c, the midpoint of the interval, c =

a + b

/

2

.

Calculate the function value at the midpoint, f(c).

If convergence is satisfactory (that is, c - a is sufficiently small, or |f(c)| is sufficiently small), return c and stop iterating.

Examine the sign of f(c) and replace either (a, f(a)) or (b, f(b)) with (c, f(c)) so that there is a zero crossing within the new interval.

When implementing the method on a computer, there can be problems with finite precision, so there are often additional convergence tests or limits to the number of iterations. Although f is continuous, finite precision may preclude a function value ever being zero. For example, consider f(x) = x − π; there will never be a finite representation of x that gives zero. Additionally, the difference between a and b is limited by the floating point precision; i.e., as the difference between a and b decreases, at some point the midpoint of [a, b] will be numerically identical to (within floating point precision of) either a or b..

Algorithm

The method may be written in pseudocode as follows:[7]

INPUT: Function f,

endpoint values a, b,

tolerance TOL,

maximum iterations NMAX

CONDITIONS: a < b,

either f(a) < 0 and f(b) > 0 or f(a) > 0 and f(b) < 0

OUTPUT: value which differs from a root of f(x) = 0 by less than TOL

N ← 1

while N ≤ NMAX do // limit iterations to prevent infinite loop

c ← (a + b)/2 // new midpoint

if f(c) = 0 or (b – a)/2 < TOL then // solution found

Output(c)

Stop

end if

N ← N + 1 // increment step counter

if sign(f(c)) = sign(f(a)) then a ← c else b ← c // new interval

end while

Output("Method failed.") // max number of steps exceeded

Example: Finding the root of a polynomial

Suppose that the bisection method is used to find a root of the polynomial

{\displaystyle f(x)=x^{3}-x-2\,.}f(x)=x^{3}-x-2\,.

Firs

Similar questions