Zibibullayev Dilshodnibg Algoritmlarni loyihalash

Zibibullayev Dilshodnibg Algoritmlarni loyihalash
Labaratoriya ishi
1.1 Berilgan integral qiymatini to‘g‘ri to‘rtburchaklar, trapetsiyalar, Simpson usullarida ε>0 aniqlikda hisoblang. Aniqlikka erishganlik sharti sifatida |S_2n-S_n|<ε tengsizlikdan foydalaning (boshlang‘ich n=10 deb olish mumkin). Natijaga erishish uchun zarur bo‘lgan qadamlar soni va integral taqribiy qiymati chiqariladi. С++ dasturida natijani oling.
15-variant Tortburchak uslibida
# def funk(t):
# return pow(x**2+3*x+1,1/3)*pow(math.exp,-x**2)
# a=int(input("A: "))
# b=int(input("B: "))
# e=0.001
# c=0
# if(funk(a)*funk(b)<0):
# while((b-a)/2>e):
# c=(a+b)/2
# if(funk(a)*funk(c)<0):
# b=c
# else:
# a=c
# else:
# print("Yechom oraliqda emas")
# print(c)


1.2Simpson uslibida
def simpson(f, a, b, n):
h=(b-a)/n
k=0.0
x=a
for i in range(1,int(n/2)):
x += 2*h
k += 4*f(x)
if(i%10==0):
print(x,k,(h/3)*(f(a)+f(b)+k))
return (h/3)*(f(a)+f(b)+k)

def function(x): return pow(x**2+3*x+1,1/3)*pow(math.e,-x**2)*2

print( simpson(function, 1, 3, 100))




1.3Trapetsiya uslibida