//复化梯形公式求定积分
//将[down,up]分成n等份(积分区间),子区间长度为h=(b-a)/n
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
double up, down, a, b, c, n = 100; //积分区间被分为n等份
cout << "依次输入积分上限up、积分下限down和函数参数a、b、c的值:" << endl;
cin >> up >> down >> a >> b >> c;
cout << endl;
double h = (up - down) / n; //子区间长度,即迭代步长
double result, fx=0, fa, fb; //result积分最终结果
double x = 0;
for (int i = 1; i <= n - 1;i++)
{
fx += c / (1 + a*pow(x, b)*sqrt(x));
x += (up - down) / n;
}
fa = c / (1 + a*pow(a, b)*sqrt(a));
fb = c / (1 + a*pow(b, b)*sqrt(b));
result = (h / 2)*(fa+2*fx+fb);
cout << "步长h:" << h << endl;
cout << "f(a):" << fa << endl;
cout << "f(b):" << fb << endl;
cout <<"result:"<< result << endl;
return 0;
}
//复化梯形公式求定积分
//将[down,up]分成n等份(积分区间),子区间长度为h=(b-a)/n
#include<iostream>
#include<cmath>
using namespace std;
int main()
{
double up, down, a, b, c, n = 100; //积分区间被分为n等份
cout << "依次输入积分上限up、积分下限down和函数参数a、b、c的值:" << endl;
cin >> up >> down >> a >> b >> c;
cout << endl;
double h = (up - down) / n; //子区间长度,即迭代步长
double result, fx=0, fa, fb; //result积分最终结果
double x = 0;
for (int i = 1; i <= n - 1;i++)
{
fx += c / (1 + a*pow(x, b)*sqrt(x));
x += (up - down) / n;
}
fa = c / (1 + a*pow(a, b)*sqrt(a));
fb = c / (1 + a*pow(b, b)*sqrt(b));
result = (h / 2)*(fa+2*fx+fb);
cout << "步长h:" << h << endl;
cout << "f(a):" << fa << endl;
cout << "f(b):" << fb << endl;
cout <<"result:"<< result << endl;
return 0;
}
积分上下限up和down、另外还有函数f(x)中的三个参数a、b和c可以根据需要设置。我只是随便选了个函数而已,大家可以根据自己的需要自己设置,只要保证算法正确的使用肯定是可以得出正确的结果的。
复化梯形公式是《数值分析原理》中的内容,不了解的可以百度一下。
本例函数f(x):
f(x)=c/[(1+ax^b)*x^(1/2)]