迭代法.cpp

不动点迭代——方程根的求解

#include<iostream.h>
#include "math.h"
//解方程x*x-x-1=0
double fy(double x)
{return sqrt(x+1);}

void main()
{double x;int k=0;
 cin>>x;
 //cout<<x<<' '<<fy(x)<<endl;
 double t=x-fy(x);//>0?x-fy(x):fy(x)-x;
 while(x-fy(x)>0.0001||x-fy(x)<-0.0001)
 {x=fy(x);k++;}
 cout<<x<<' '<<k<<endl;
 cout<<x-fy(x)<<endl;
}