Muhammad al-Xorazmiy nomidagi Toshkent Axbarot texnalogiyalari universiteti "Kompyuter injiringi"

2.Masala

To’g’ri to’rtburchaklar, trapetsiya va Simpson usullarida hisoblang. N bo’lish soni, E=0.001.

[0;1]

10

1.Tortburchaklar usulida:

#include
#include
using namespace std;
int main () {
double a, b, N, sum=0, x, h, e=2.75;
cout << "a= "; cin >>a;
cout << "b= "; cin >>b;
cout << "N= "; cin >>N;
h=(b-a)/N;
for (int i=1; i<=N; i++) {
x = a + i*h;
sum +=pow((x*x*x+2*x+1),0.5)*cos(x*x)*h;
}
cout<<"To'rtburchaklar usulida': "<}

2.Trapetsiya usuli:
#include
#include
using namespace std;
int main () {
double a , b , N , sum1 = 0, sum2 = 0, h, x, e=2.75;
cout << "a= "; cin >>a;
cout << "b= "; cin >>b;
cout << "N= "; cin >>N;
h = (b - a) / N;
for(int i = 1; i <= N - 1; i++)
{
x = a + (i * h);
sum1 += 2*pow((x*x*x+2*x+1),0.5)*cos(x);
}
sum2 = h/2 * (sum1 + (pow(e,(-a*a)))*sin(a*a+1) + (pow(e,(-b*b)))*sin(b*b+1));
cout << "Trapitsiya usulida yechim: " << sum2;
}

3.Simpson usuli
#include
#include
using namespace std;
int main () {
double a , b , N , sum1 = 0, sum2 = 0, sum, h, x, e=2.75,m;
cout << "a= "; cin >>a;
cout << "b= "; cin >>b;
cout << "N= "; cin >>N;
h = (b - a) / N;
m=N/2;
for(int i = 1; i <= 2*m-1; i+=2)
{
x = a + (i * h);
sum1 += pow((x*x*x+2*x+1),0.5)*cos(x*x);
}
for(int i=2; i<=2*m-2; i+=2) {
x = a + (i * h);
sum2 += pow((x*x*x+2*x+1),0.5)*cos(x*x);
}
sum=h/3*((pow(e,(-a*a)))*sin(a*a+1)+(pow(e,(-b*b)))*sin(b*b+1)+4*sum1+2*sum2);
cout << "Simson usulida yechim: " << sum;

}