print("In Bisection Method")
print("Approximation Roots are 3,4")
import math
import time
def f(x):
return math.sin(x)
def bisection(a,b,n):
i=1
condition=True
start=time.time()
while condition:
x=(a+b)/2
if f(x)<0:
b=x
else:
a=x
print("iteration= ",i,"x= ",x,"f(x)= ",f(x),"time= ",time.time()-start)
if i==n:
condition=False
else:
condition=True
i=i+1
print("Required root is: ",x)
a=input("first approximation root:")
b=input("second approximation root:")
n=input("No.of iteration:")
a=float(a)
b=float(b)
n=int(n)
if f(a)*f(b)>0:
print("Given approximate root do not bracket the root.")
print("Try again with different values")
else:
bisection(a,b,n)
print(" ")
print("Regular Falsi Method")
print("Approximation Roots are 3,4")
def f(x):
return math.sin(x)
def regular(a,b,n):
i=1
condition=True
start=time.time()
while condition:
x=(a*f(b)-b*f(a))/(f(b)-f(a))
if f(x)*f(b)<0:
a=x
else:
b=x
print("iteration= ",i,"x= ",x,"f(x)= ",f(x),"time= ",time.time()-start)
if i==n:
condition=False
else:
condition=True
i=i+1
print("Required root is: ",x)
a=input("first approximation root:")
b=input("second approximation root:")
n=input("No.of iteration:")
a=float(a)
b=float(b)
n=int(n)
if f(a)*f(b)>0:
print("Given approximate root do not bracket the root.")
print("Try again with different values")
else:
regular(a,b,n)
print(" ")
print("Newton-Raphson Method:")
x=float(input("Enter approx root:"))
i=1
n=100
start=time.time()
while(i<=n):
x=x-math.tan(x)
i=i+1
print("iteration=",i," ",x,"time= ",time.time()-start)
