budongdian.txt

数值分析中不动点迭代的算法

#include <stdio.h>
#include <math.h>

main ()
{
double x0=1.5,b,n;
n=(double)1/3;
int k=1;
printf("k        x0\n");
while(1)
{b=pow(x0+1,n);
 if(fabs(x0-b)<0.000001)
 break;
 else
{x0=b;
printf("%d     %lf\n",k,b);
k++;
}
}}