#include <iostream>
#include <cmath>
#include <stdio.h>
using namespace std;
double f(double x)
{
return log(4-x)/2;
}
int main()
{
double x=1,x1,x2,y;
int count=1;
do
{
x1=f(x);
x2=f(x1);
y=(x*x2-x1*x1)/(x-2*x1+x2);
printf("%-3d: ",count++);
printf("%-10lf ",y);
cout<<endl;
if(abs(x-y)<10e-5)
break;
x=y;
}while(1);
return 0;
}
求解方程根的近似解:埃特金加速迭代法
最新推荐文章于 2021-12-15 08:09:14 发布