No BSD License  

Highlights from
Numerical Methods using Matlab, 2e

• F=f302(x);
• F=f303(x)
• F=f304(x);
• F=f305(x);
• F=f307(x);
• Q=aitken(x,y,xval) Aitken's method for interpolation.
• Q=aitken(x,y,xval) Aitken's method for interpolation.
• W=romb(func,a,b,d) Implements Romberg integration.
• [a,om]=ellipgen(nx,hx,ny,hy,G... Function either solves:
• [c1,c2]=lfit(x,y)
• [f,a]=golden(func,p,tol) Golden search for finding min of one variable non-linear function.
• [fit,fitot]=fitness(criteria,...
• [fit,fitot]=fitness2d(criteri...
• [fnew,xnew]=asaq(func,x,maxst... Determines optimum of a function using simulated annealing.
• [lam,u]=eiginv(A,mu,tol) Determines eigenvalue of A closest to mu with a tolerance tol.
• [lam,u]=eigit(A,tol) Solves EVP to determine dominant eigenvalue and associated vector
• [r1,r2,im1,im2]=solveq(u,v,n,...
• [res, it]=fnewton(func,dfunc,...
• [res, it]=fnewtsym(func,x0,to...
• [res, it]=schroder(func,dfunc...
• [res, noiter]=mincg(f,derf,ft... Finds local mi of a multivariable non-linear function in n variables
• [rts,it]=bairstow(a,n,tol) Bairstow's method for finding the roots of a polynomial of degree n.
• [tvals, yvals]=abm(f,tspan,st... Adams Bashforth Moulton method for solving
• [tvals, yvals]=eulertp(f,tspa... Euler trapezoidal method for solving
• [tvals, yvals]=feuler(f,tspan... Euler's method for solving
• [tvals, yvals]=fhamming(f,tsp... Hamming's method for solving
• [tvals, yvals]=fhermite(f,tsp... Hermite's method for solving
• [v, dv]=f509(t,x)
• [x1,fr,it]=newtmvsym(x,f,n,to... Newton
• [x1,x2]=rootquad(a,b,c)
• [xsol,basic]=barnes(A,b,c,tol... Barnes' method for solving a linear programming problem.
• [xv,it]=broyden(x,f,n,tol) Broyden's method for solving a system of n non-linear equations
• [xv,it]=newtonmv(x,f,jf,n,tol... Newton's method for solving a system of n non-linear equations
• [xval,maxf]=optga(fun,range,b... Determines maximum of a function using the Genetic algorithm.
• approx=plotapp(func,rangelow,... Plots a function and allows the user to approximate a
• b=mregg(Xd,con,ar,lab) Multiple linear regression, using least squares.
• chrom1=matesome(chrom,matenum... % Example call: chrom1=matesome(chrom,matenum)
• chrom=mutate(chrom,mu)
• chromosome=genbin(bitl,numchr...
• diffgen(func,n,x,h) Numerical differentiation.
• f=f308(v) set f vector to size required by function newtonmv.
• filon(func,case,k,l,u,n) Implements filon's integration.
• filonmod(func,case,k,l,u,n) Implements filon's integration.
• ftauv=ftau2cg(tau);
• fv=f301(x)
• fv=f306(x);
• fv=f401(x)
• fv=f402(x)
• fv=f403(x)
• fv=f404(x)
• fv=f405(x)
• fv=f504(t,x)
• fv=f505(t,x)
• fv=f506(t,x)
• fv=f601(x,y)
• fv=f801(x);
• fv=f802(x)
• fv=f901(t,x)
• gauss2v(func,a,b,c,d,n) Implements 2 variable Gaussian integration.
• jf=f309(v) set jf matrix to size required by function newtonmv.
• neurf=f507(t,x) Calculate synaptic current
• newchrom=selectga(criteria,ch... % Example call: newchrom=selectga(criteria,chrom,a,b)
• p=fun1(x) A simple function definition
• pd=f801pd(x);
• q=f310(p)
• q=fgauss(func,a,b,n) Implements Gaussian integration.
• q=simp2v(func,a,b,c,d,n) Implements 2 variable Simpson integration.
• rkgen.m Runge Kutta methods for solving
• rval=binvreal(chrom,a,b) Converts binary string chrom to real value in range a to b.
• s=gaherm(func,n) Implements Gauss-Hermite integration.
• s=galag(func,n) Implements Gauss-Laguerre integration.
• simp1(func,a,b,m) Implements Simpson's rule using vectors.
• simp2(func,a,b,m) Implements Simpson's rule using for loop.
• u=fwave(nx,hx,nt,ht,init,init... Solves hyperbolic equ'n, e.g. wave equation.
• u=heat(nx,hx,nt,ht,init,lowb,... Solves parabolic equ'n.
• v=f101(x)
• v=f503(t,x)
• v=f508(t,y)
• v=f510(t,x)
• v=f803(x)
• v=f804(x)
• v=f805(x)
• v=jarrett(f,x1,x2,tol)
• v=rombergx(f,tspan,intdiv,ini...
• w=f412(x,z)
• xdash=solvercg(a,b,n,tol) Solves linear system ax = b using conjugate gradient method.
• y=f406(x)
• y=f407(x)
• y=f407a(x)
• y=f408(x)
• y=f409(x)
• y=f410(x)
• y=ftable(fname, lowerb,upperb...
• y=twopoint(x,C,D,E,F,flag1,fl... Solves 2nd order boundary value problem
• yprime=f501(t,y)
• yprime=f502(t,y)
• z=f411(x,y)
• e2pg020a.m
• e2pg020b.m
• e2pg021.m
• e2pg022.m
• e2pg025.m
• e2pg034.m
• e2pg038a.m
• e2pg038b.m
• e2pg053.m
• e2pg054.m
• e2pg055.m
• e2pg058.m
• e2pg068.m
• e2pg083.m
• e2pg093.m
• e2pg094.m
• e2pg097a.m
• e2pg097b.m
• e2pg099.m
• e2pg100.m
• e2pg111.m
• e2pg112a.m
• e2pg112b.m
• e2pg113.m
• e2pg114.m
• e2pg121.m
• e2pg129.m
• e2pg138.m
• e2pg141.m
• e2pg145.m
• e2pg160.m
• e2pg163.m
• e2pg168.m
• e2pg169.m
• e2pg170.m
• e2pg176.m
• e2pg178.m
• e2pg181.m
• e2pg185.m
• e2pg186.m
• e2pg189.m
• e2pg192.m
• e2pg195.m
• e2pg202.m
• e2pg215.m
• e2pg222.m
• e2pg226.m
• e2pg229.m
• e2pg232.m
• e2pg235.m
• e2pg238.m
• e2pg239.m
• e2pg240.m
• e2pg253.m
• e2pg260.m
• e2pg263.m
• e2pg266.m
• e2pg270.m
• e2pg275.m
• e2pg276a.m
• e2pg276b.m
• e2pg285a.m
• e2pg285b.m
• e2pg287.m
• e2pg288.m
• e2pg296.m
• e2pg297.m
• e2pg300.m
• e2pg301.m
• e2pg303.m
• e2pg313a.m
• e2pg313b.m
• e2pg318.m
• e2pg319.m
• e2pg320.m
• e2pg323.m
• e2pg326.m
• e2pg344.m
• e2pg353.m
• e2pg354.m
• e2pg357.m
• e2pg387.m
• e2pg394.m
• e2pg395.m
• e2pg408.m
• e2pg420.m
• View all files