Merge pull request #4 from rcc02007/master

update

README.md

@@ -74,8 +74,8 @@ general, I will not post homework solutions.
 |3|1/31||Consistent Coding habits|
 |   |2/2|5|Root Finding| 
 |4|2/7|6|Root Finding con’d|      
-|   |2/9|7|Optimization|      
-|5|2/14||Intro to Linear Algebra|
+|   |2/9|7| **Snow Day**|      
+|5|2/14|| Optimization |
 |   |2/16|8|Linear Algebra|
 |6|2/21|9|Linear systems: Gauss elimination|
 |   |2/23|10|Linear Systems: LU factorization|

lecture_08/goldmin.m

@@ -0,0 +1,36 @@
+function [x,fx,ea,iter]=goldmin(f,xl,xu,es,maxit,varargin)
+% goldmin: minimization golden section search
+%   [x,fx,ea,iter]=goldmin(f,xl,xu,es,maxit,p1,p2,...):
+%     uses golden section search to find the minimum of f
+% input:
+%   f = name of function
+%   xl, xu = lower and upper guesses
+%   es = desired relative error (default = 0.0001%)
+%   maxit = maximum allowable iterations (default = 50)
+%   p1,p2,... = additional parameters used by f
+% output:
+%   x = location of minimum
+%   fx = minimum function value
+%   ea = approximate relative error (%)
+%   iter = number of iterations
+if nargin<3,error('at least 3 input arguments required'),end
+if nargin<4|isempty(es), es=0.0001;end
+if nargin<5|isempty(maxit), maxit=50;end
+phi=(1+sqrt(5))/2;
+iter=0;
+while(1)
+  d = (phi-1)*(xu - xl);
+  x1 = xl + d;
+  x2 = xu - d;
+  if f(x1,varargin{:}) < f(x2,varargin{:})
+    xopt = x1;
+    xl = x2;
+  else
+    xopt = x2;
+    xu = x1;
+  end
+  iter=iter+1;
+  if xopt~=0, ea = (2 - phi) * abs((xu - xl) / xopt) * 100;end
+  if ea <= es | iter >= maxit,break,end
+end
+x=xopt;fx=f(xopt,varargin{:});