最優(yōu)化方法一維搜索法C++程序.doc

《最優(yōu)化方法一維搜索法C++程序.doc》由會(huì)員上傳分享，免費(fèi)在線閱讀，更多相關(guān)內(nèi)容在教育資源-天天文庫(kù)。

1、加步探索法#include#includeusingnamespacestd;doublefun(doublet){return(t*t*t-2*t+1);}doublemax(doublea,doubleb){if(a>b)returna;elsereturnb;}doublemin(doublea,doubleb){if(a>b)returnb;elsereturna;}doubleAddstep(double(*pfun)(doublet)){intk=0;doublet0=0,h=1,r=2,t,a=0,b=0;t=t0+h;do{

2、if(fun(t)#includeusingnamespacestd;doublefun(doublet){re

3、turn(t*t-3*t);}doubledfun(doublet){return(2*t-3);}voidDichotomous(double(*pfun)(doublet),double(*pdfun)(doublet)){intmaxflag=1000,k=1;doublea=-3,b=5,c,err=0.1,t;do{c=(a+b)/2;if(dfun(c)<0){a=c;}else{if(dfun(c)>0){b=c;}else{a=c;b=c;}}k++;}while(fabs(a-b)>err&&k=maxflag)cout<

4、dl<<"對(duì)分法迭代失敗!迭代次數(shù)為k="<#includeusingnamespacestd;doublefun(doublet){return(t*t*t-2*t+1);}

5、doubledfun(doublet){return(3*t*t-2);}voidNewtonIterative(double(*pfun)(doublet),double(*pdfun)(doublet)){intmaxflag=1000,k=1;doublet0=1,err=0.01,t;do{t0=t;t=t0-pfun(t0)/pdfun(t0);k++;}while(fabs(t-t0)>err&&k=maxflag)cout<

6、成功!迭代次數(shù)為k="<#includeusingnamespacestd;doublefun(doublet){return(t*t+2*t);}voidGoldensection(double(*pfun)(doublet)){intmaxflag=1000,

7、k=1;doublea=-3,b=5,err=0.001,t,t1,t2;do{t1=a+0.618*(b-a);t2=b-0.618*(b-a);if(t1=t2){a=t2;b=t1;}else{if(t1err&&k=maxflag)cout<