黄金分割搜索算法.doc

黄金分割搜索算法 一.实验目的 通过上机实现黄金分割搜索算法，了解并掌握黄金分割搜索算法的内涵。通过动态演示搜索全过程深刻理解该算法。 二. 实验内容与要求 用黄金分割搜索算法求cos(x),x∈[-π/2,π/2]的最大值，设计出具体的程序，使之能够动态演示搜索过程。 三．参考算法 1. Input{a,b,e} 2. x1=a+0.382*(b-a);x2=a+0.618*(b-a) 3. f1=f(x1),f2=f(x2) 4. while(b-ae) 5. if(ff1) 5.1 {a=x1;x1=x2;f1=f2;x2=a+0.382*(b-a);f1=f(x1);} else 5.2 {b=x2;x2=x1;f2=x1;x1=a+0.382*(b-a);f1=f(x1);} 6. xmax=(a+b)/2 7. output{ xmax } 四．源代码 import java.awt.*; import java.awt.event.*; import javax.swing.*; public class GOLD { public static double Pi=3.1415926; public static void main(String args[]) { A a=new A(??); a.init(); } } class A extends JFrame { A (String s) { super(s); } public void init() { getContentPane().add(new MyPanel()); setSize(600,400); setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); setVisible(true); } } class MyPanel extends JPanel implements Runnable { private double x1,y1,x2,y2,a,b,x,n,l; private int m; private int count; public MyPanel() { setSize(600, 400); new Thread(this).start(); } public void run() { int i=0; a=100.00;b=400.00; x1=a+0.328*(b-a); x2=a+0.618*(b-a); y1=250-(Math.cos((x1-250)*(GOLD.Pi/300)))*(300/GOLD.Pi); y2=250-(Math.cos((x2-250)*(GOLD.Pi/300)))*(300/GOLD.Pi); while(count=5) { if(y1y2) { a=x1; x1=x2; y1=y2; x2=a+0.618*(b-a); y2=250-(Math.cos((x2-250)*(GOLD.Pi/300)))*(300/GOLD.Pi); } else { b=x2; x2=x1; y2=y1; x1=a+0.328*(b-a); y1=250-(Math.cos((x1-250)*(GOLD.Pi/300)))*(300/GOLD.Pi); } try { Thread.sleep(1000); } catch (Exception e) { } m=(int)((a+b)/2); System.out.println(m=+m); n=(250-(Math.cos((((a+b)/2)-250)*(GOLD.Pi/300)))*(300/GOLD.Pi)); System.out.println(n=+n); repaint(); count++; } } public void paintComponent(Graphics g) { g.setColor(Color.black); g.drawLine(10,250,490,250); g.drawLine(250,100,250,340);