Simpson公式:
∫
l
r
f
(
x
)
d
x
≈
(
r
−
l
)
(
f
(
l
)
+
f
(
r
)
+
4
f
(
l
+
r
2
)
)
6
\int^{r}_{l}f(x)dx\approx\frac{(r-l)(f(l)+f(r)+4f(\frac{l+r}{2}))}{6}
∫lrf(x)dx≈6(r−l)(f(l)+f(r)+4f(2l+r))
inline double simpson(double l, double r) {
double mid = (l + r) / 2.0;
return (r - l) * (f(l) + f(r) + 4.0 * f(mid)) / 6.0;
}
自适应Simpson法:
二分枚举精度,就可以了鸭!
以一道洛谷模板题为例LuoGu4525_自适应辛普森法1
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
double a, b, c, d, l, r;
inline double f(double x) {
return (c * x + d) / (a * x + b);
}
inline double simpson(double l, double r) {
double mid = (l + r) / 2.0;
return (r - l) * (f(l) + f(r) + 4.0 * f(mid)) / 6.0;
}
double asr(double l, double r, double eps, double ans) {
double mid = (l + r) / 2;
double l_ans = simpson(l, mid), r_ans = simpson(mid, r);
if (fabs(l_ans + r_ans - ans) <= eps * 15) return l_ans + r_ans + (l_ans + r_ans - ans) / 15;
return asr(l, mid, eps / 2, l_ans) + asr(mid, r, eps / 2, r_ans);
}
inline double asr(double l, double r, double eps) {
return asr(l, r, eps, simpson(l, r));
}
int main() {
scanf("%lf%lf%lf%lf%lf%lf", &a, &b, &c, &d, &l, &r);
printf("%.6lf", asr(l, r, 1e-6));
return 0;
}