第2章 机械优化设计外推法 黄金分割法 二次插值法 随机方向法 坐标轮换法 四杆机构.doc

《机械优化设计》上机源程序与结果 4 程序一：外推法 #includestdio.h #includemath.h #define B 0.001 double fun(double x) { double min; min=x*x-10*x+36; return min; } void main() { double h0=B,y1,y2,y3,x1,x2,x3,h; x1=0;h=h0;x2=h; y1=fun(x1);y2=fun(x2); if(y2y1) {h=-h; x3=x1; x1=x2; x2=x3; y3=y1; y1=y2; y2=y3; } x3=x2+h;y3=fun(x3); while(y3y2) {h*=1.5; x1=x2; x2=x3; x3=x2+h; y1=y2; y2=y3; y3=fun(x3); } printf(fun(%f)=%f,\nfun(%f)=%f,\nfun(%f)=%f\n,x1,y1,x2,y2,x3,y3); } 运行过程及结果： fun(2.954784)=15.182909, fun(4.432676)=11.321857, fun(6.649513)=13.720895 程序二：黄金分割法 源程序： #includestdio.h #includemath.h #define f(x) x*x-10*x+36 double gi(double *a,double *b,double e,int *n) { double x1,x2,min; if(fabs((*b-*a)/(*b))=e) min=f((*b+*a)/2); else { x1=*b-0.618*(*b-*a); x2=*a+0.618*(*b-*a); if(f(x1)f(x2)) *a=x1; else *b=x2; *n=*n+1; min=gi(a,b,e,n); } return min; } void main() { double min,a,b,e,m; int n=0; printf(输入搜索区间a，b值和精度e\n); scanf(%lf %lf %lf,a,b,e); min=gi(a,b,e,n); m=(a+b)/2; printf(a=%lf,b=%lf,min=%lf,m=%lf,n=%d\n,a,b,min,m,n); } Press any key to continue 运行过程及结果： a*=5.000000 y*=11.000000 程序三：二次插值法 源程序： #includestdio.h #includemath.h float f(float x) { float min; min=x*x-10*x+36; return min; } void main() {float e=0.001,c1,c2,ap,yp,a,y; float h0=0.03,h=h0,a1=0,a2=h,y1,y2,a3,y3; y1=f(a1); y2=f(a2); if(y2y1) { h=-h;a3=a1;y3=y1; a1=a2;y1=y2;a2=a3;y2=y3; } a3=a2+h;y3=f(a3); while(y3y2) { h=2*h; a1=a2;y1=y2;a2=a3;y2=y3; a3=a2+h;y3=f(a3); } printf(f(%f)=%f\nf(%f)=%f\nf(%f)=%f,a1,y1,a2,y2,a3,y3); y1=f(a1); y2=f(a2); y3=f(a3); c1=(y3-y1)/(a3-a1); c2=((y2-y1)/(a2-a1)-c1)/(a2-a3); ap=0.5*(a1+a3-c1/c2); yp=f(ap); while(abs((y2-yp)/y2)=e) {if((ap-a2)*h0){if(y2=yp){a1=a2;y1=y2;a2=ap;y2=yp;} else{a3=ap;y3=yp;}} else{if(y2=yp){a3=a2;y3=y2;a2=ap;y2=yp;} else{a1=ap;y1=yp;}} } if(y2yp){a=a2;y=y2;} else{a=ap;y=yp;} printf(\nthe best re