一维黄金分割法程序.docVIP

#includestdio.h#includemath.h#define f(t) (8*pow(t,3)-2*pow(t,2)-7*t+3)#define eps pow(10,-6) void sb(double *a,double *b){double t0,t1,t,h,alpha,f0,f1;int k=0;printf(请输入初始点t0=);scanf(%lf,t0);printf(\n请输入初始 步长h=);scanf(%lf,h);printf(\n请输入加步系数alpha(需大于1)=);scanf(%lf,alpha);f0=f(t0);t1=t0+h;f1=f(t1);while(1){?? printf(\nf1=%lf,f2=%lf,t0=%lf,t=%lf,h=%lf,k=%d,f0,f1,t0,t1,h,k);?? if(f1f0)?? {??? h=alpha*h;??? t=t0;??? t0=t1;??? f0=f1;??? k++;?? }?? else?? {??? if(k==0)??? {h=-h;t=t1;}??? else??? {?? ???? *a=tt1?t:t1;???? *b=tt1?t:t1;???? break;??? }?? }?? t1=t0+h;?? f1=f(t1);}} double hjfg(){double beta,t1,t2,t;double f1,f2;double a=0,b=0;double *c,*d;int k=0;c=a,d=b;sb(c,d);printf(\n[a,b]=[%lf,%lf],a,b);beta=(sqrt(5)-1.0)/2;t2=a+beta*(b-a);f2=f(t2);t1=a+b-t2;f1=f(t1);while(1){?? printf(\n第%d次迭代的过程如下:,k+1);?? printf(\n[t1,t2]=[%lf,%lf],t1,t2);?? if(fabs(t1-t2)eps)?? break;?? else ?? {??? if(f1f2)??? {???? t=(t1+t2)/2;???? b=t2;?????? t2=t1;?????? f2=f1;?????? t1=a+b-t2;???????????? f1=f(t1); ??? }????? else????? {????? a=t1;?????? t1=t2;?????? f1=f2;?????? t2=a+beta*(b-a);?????? f2=f(t2);????? }?? }?? k++;}t=(t1+t2)/2;printf(\nt=%lf,t);return t;} main(){double t; t=hjfg();printf(\n 函数的最优值为f(%lf)=%lf,t,f(t));} 运行结果如下： 请输入初始点t0=0 请 输入初始步长h=1 请输入加步系数alpha(需大于1)=2 f1=3.000000,f2=2.000000,t0=0.000000,t=1.000000,h=1.000000,k=0f1=2.000000,f2=180.000000,t0=1.000000,t=3.000000,h=2.000000,k=1[a,b]=[0.000000,3.000000]第 1次迭代的过程如下:[t1,t2]=[1.145898,1.854102]第2次迭代的过程如下:[t1,t2]=[0.708204,1.145898]第 3次迭代的过程如下:[t1,t2]=[0.437694,0.708204]第4次迭代的过程如下:[t1,t2]=[0.708204,0.875388]第 5次迭代的过程如下:[t1,t2]=[0.604878,0.708204]第6次迭代的过程如下:[t1,t2]=[0.541020,0.604878]第 7次迭代的过程如下:[t1,t2]=[0.604878,0.644345]第8次迭代的过程如下:[t1,t2]=[0.644345,0.668737]第 9次迭代的过程如下:[t1,t2]=[0.629270,0.644345]第10次迭代的过程如下:[t1,t2]=[0.619953,0.629270]第 11次迭代的过程如下:[t1,t2]=[0.629270,0.635028]第12次迭代的过程如下:[t1,t2]=[0.62