文件名称:golden_cut_method
介绍说明－－下载内容均来自于网络，请自行研究使用
2． 黄金分割法的的核心思想是逼近，而最终结果的精确程度取决于相对精度e的大小，e越小，结果越精确，迭代次数越多，这一点从图一的程序运行结果中可以很明显的看出。
3． 程序运行过程中首先输入初始区间[0，1]，然后输入迭代后最后区间的长度0.2，最后得出极小值和极小值点。
-2. Golden section method is the core idea of approximation, while the final result depends on the precise relative accuracy e, the size of, e smaller, more accurate results, the more iterations, which is one of the program is running from the map results can be very clearly be seen. 3. Program is running, first enter the initial interval [0,1], and then enter the length of iterations after the last interval 0.2, finally reached the minimum value and the minimum point.
3． 程序运行过程中首先输入初始区间[0，1]，然后输入迭代后最后区间的长度0.2，最后得出极小值和极小值点。
-2. Golden section method is the core idea of approximation, while the final result depends on the precise relative accuracy e, the size of, e smaller, more accurate results, the more iterations, which is one of the program is running from the map results can be very clearly be seen. 3. Program is running, first enter the initial interval [0,1], and then enter the length of iterations after the last interval 0.2, finally reached the minimum value and the minimum point.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
golden_cut_method.cpp