fibonacci.asv

来自「用0.618法和fibonacci法求解单变量的最优化问题」· ASV 代码 · 共 26 行

function [ x,y,l] = fibonacci( a,b,n )
%UNTITLED1 Summary of this function goes here
%  Detailed explanation goes here
tic
a=a;
b=b;
n=n;
while b-a>0.0005
    x1=a+fibo(n-2)/fibo(n)*(b-a);
    x2=a+fibo(n-1)/fibo(n)*(b-a);
    if f(x1)>f(x2)
        a=x1
    else
        b=x2
    end
    a
    l=b-a
    n=n-1;
    if n==1
    break
    end    
end
toc
x=a
y=f(x)
l=b-a