Bisection in Python

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).

Author: ashishworkspace

Random Python Programs/bisection.py

@@ -0,0 +1,21 @@
+def equation(x):
+    return (x**3 - 4*x - 9)
+
+a = float(input("Enter the inital range value: ")) 
+b = float(input("Enter the final range value: "))  
+
+iteration = int(input("Enter the number of Iteration: "))
+
+if(equation(a)*equation(b) > 0):
+    print("Wrong Input! Root does not exits")
+else:
+    while(iteration != 0):
+        x = (a+b)/2
+        if(equation(x)<0):
+            a = x
+        elif(equation(x)>0):
+            b = x
+        else:
+            print("Root is Zero")
+        print("Root : "+str(x))
+        iteration -= 1