Margaret Wright Courant Institute, New York University Silver Professor of Computer Science Associate Editor of SIAM Journal on Scientific Computing, Mathematical Programming, and SIAM Journal on Optimization Director of Graduate Studies, PhD Program in CS at NYU
Fast Times in Linear Programming: Early Success, Revolutions, and Mysteries
function y=newt(f,df,x,n) % newton's method newt(f,df,x,n) % x is the initial guess; n is the number of iterations % files f.m and df.m contain the function and its derivatives % the function and derivative names f and df must be supplied in % quotes, i.e. a call would be of the form, newt('sin', 'cos', .2, 4).Your program will need to use feval to evaluate the functions.