grid search.rar_choiceynm_didhgw_grid search_matlab Grid Search_

# The Grid search is programmed with two functions: one does each step, and the other function controls how many steps shall be taken. # Remember that it is better to write small programs and combine them, than to write a huge program for everything. # This function takes as input a function of one variable f, an interval [a,b] and a natural number n. \ # It outputs a new interval, the result of applying one step of the Grid search, dividing the interval in n-1 subintervals. function interval=GridSearchOneStep1(f,a,b,n) X=linspace(a,b,n); # Dividing the interval. xminindex=1; # Initiate the first index to be the minimum. fmin=f(X(1)); # Initiate fmin to be the value of f there. for i=2:n # For the rest of the n points… if f(X(i))<fmin # if the function value there is lower than fmin… xminindex=i; # Set the minimum index to be that one and … fmin=f(X(i)); # also set fmin to be the value of f there. endif endfor if xminindex==1 # If fmin was found to be at a, then return the subinterval with a to the left. interval=[X(1),X(2)]; elseif xminindex==n # If fmin was found to be at b, then return the subinterval with b to the right. interval=[X(n-1),X(n)]; else # Otherwise return subinterval containing the value where fmin was found, with endpoints the point at the left and the right, respectively. interval=[X(xminindex-1),X(xminindex+1)]; endif; endfunction;