黄金分割比与对称截去  

GOLDEN RATIO AND SYMMETRIC CUTTING OUT

作　　者：陈兆斗[1] 

机构地区：[1]中国地质大学信息工程学院,北京100083

出　　处：《数学杂志》2009年第3期391-394,共4页Journal of Mathematics

摘　　要：本文研究了优选法中一维搜索区间趋于零的充要条件.利用建立的对称截去模型,证明0.618法(优选法)是最快的算法.In this paper, by using a model named symmetric cutting out, a necessary and sufficient condition for interval of search tending to zero is obtained. By the model, we may further conclude that the 0. 618 method （optimum seeking method） is the most rapid convergence algorism for interval of search tending to zero.

关 键 词：黄金分割比 优选法 搜索区间 

分 类 号：O224[理学—运筹学与控制论]