__________________________________________________
#include
#include
double f(double x)
{
double ans;
ans=exp(x);
return ans;
}
void main()
{
double a=1,b=3,error=0.0001,t[20][20],h,c;
int i,j,k,m,n;
h=b-a;
t[0][0]=h*(f(a)+f(b))/2;
k=1;
while(1)
{
t[0][k]=0;
m=1;
for(j=0;j
m=m*2;
for(i=1;i<=m;i++)
t[0][k]=t[0][k]+h*f(a+(i-0.5)*h);
t[0][k]=(t[0][k]+t[0][k-1])/2;
for(j=1;j<=k;j++)
{ c=1;
for(n=0;n
c=c*4;
t[j][k-j]=(c*t[j-1][k-j+1]-t[j-1][k-j])/(c-1);
}
if(fabs(t[k][0]-t[k-1][0])
{ printf("\n 积分结果 I ≈ %lf\n",t[k][0]);
break;
}
else
{ h=h/2;
k++;
}
}
}
收集于网络,如有侵权请联系管理员删除
__________________________________________________
#include
#include
double f(double t)
{
double ans;
ans=pow(cos(t),1.0/3);
return ans;
}
void main()
{
double x=0,eslong=0.000001,x0;
int N=20,i;
printf("\n 近似初值 x0 = %lf\n",x);
for(i=0;i
{
x0=x;
x=f(x);
printf(" x%d = %lf\n",i+1,x);
if(fabs(x-x0)
break;
}
if(fabs(x-x0)
printf("得到近似结果为 x ≈ %lf\n\n",x,i);
else
printf("迭代失败\n");
}
收集于网络,如有侵权请联系管理员删除
__________________________________________________
#include
#include
double a=0,b=1,x,y=0,h=0.1,k1,k2,k3,k4;
int i,N;
double f(double t,doubl