[数值算法]求根算法系列小结

[数值算法]求根算法系列小结

1二分求根法:

       二分求根法主要用的思想是不断调整并缩小搜索区间的大小，当搜索区间的大小已小于搜索精度要求时，则可说明已找到满足条件的近拟根.

       当然，在这之前，首先是要准确的估计出根所处的区间，否则，是找不到根的。

Type binaryPationMethod(Type x1,Type x2,Type e,Type (*arguF)(Type),FILE* outputFile)

{

       Type x;/*The return answer*/

       Type mid;

       Type down,up;

       int iteratorNum=0;

 

 

       down=x1;

       up=x2;

      

       assertF(x1<=x2,"in twoPation x1>=x2");

       assertF(arguF!=NULL,"in twoPation arguF is NULL");

       assertF(outputFile!=NULL,"in twoPation outputFile is NULL");

       assertF((*arguF)(x1)*(*arguF)(x2)<=0,"in twoPation,f(x1)*f(x2)>0");

      

       fprintf(outputFile,"down/t/tup/t/t/r/n");

       /*two pation is a method that is surely to find root for a formula*/

       while(fabs(up-down)>(float)1/(float)2*e)

       {

              mid=(down+up)/2;

              if ((*arguF)(mid)==0)

                     break;

              else if(((*arguF)(down))*((*arguF)(mid))>0)

                     down=mid;

              else

                     up=mid;

             

              fprintf(outputFile,"% -12f% -12f/r/n",down,up);

              iteratorNum++;

       }

       /*get the answer*/

       x=mid;

      

       /*Output Answer*/

       fprintf(outputFile,"total iterator time is:%d/r/n",iteratorNum);           

       fprintf(outputFile,"a root of equation is :%f/r/n",x);

      

       return x;

}

       测试1：用二分法求:

f(x)=x^3-x^2-2*x+1=0在(0,1)附近的根.

精度:0.001.

Output:

down             up          

0.000000    0.500000   

0.250000    0.500000   

0.375000    0.500000