///
/加速迭代法:埃特肯Aitken加速方法
/原理:f(x)=0改写成x=g(x),x_(k+1)=g(x_k),具体如下:
/校正:x1_(k+1)=g(x_k),再校正:x2_(k+1)=g(x1_(k+1))
/改进:x_(k+1)=x2_(k+1)-[x2_(k+1)-x1_(k+1)]^2/[x2_(k+1)-2*x1_(k+1)+x_k]
///
#include
#include
#include
using namespace std;
//
double fun(double x);
void AitkenIterative(double(*pf)(double x));
//
//
int main()
{
AitkenIterative(fun);
return 0;
}
//
//
double fun(double x)
{
return pow(x+1,1/3.);///f(x)=x^3-x-1转化成x^3=x+1
}
/
void AitkenIterative(double(*pf)(double x))
{
double x,x0;
int maxflag,k=1;
double err;
double temp1,temp2;
cout<>maxflag;
cout<>err;
cout<>x;
cout< do
{
x0=x;
temp1=pf(x0);
temp2=pf(temp1);
x=temp2-(temp2-temp1)*(temp2-temp1)/(temp2-2*temp1+x0);
cout< ++k;
}while(fabs(x-x0)>err&&k if(k>=maxflag)
cout< else
{
cout< cout< cout< }
}
/
/
来自 “ ITPUB博客 ” ,链接:http://blog.itpub.net/11355887/viewspace-974948/,如需转载,请注明出处,否则将追究法律责任。
转载于:http://blog.itpub.net/11355887/viewspace-974948/