Page 517 - Applied Numerical Methods Using MATLAB
P. 517

506    INDEX FOR MATLAB ROUTINES
            inline()         S1.1-6     define a function inside the program
            inpolygon()      S9.4       is the point inside an polygonal region?
            input()          S1.1-3     request and get user input
            int()            S5.8, AG2  numerical/symbolic integration
            interp1()        S3.5       1-D interpolation
            interp2()        S3.7       2-D interpolation
            intrp1()         P3.10      1-D interpolation
            intrp2()         S3.7       2-D interpolation
            interpolate by DFS  S3.9-3  interpolation using DFS
                   −  −
            int2s()          S5.10, P5.14  2-D (double) integral
            inv()            S1.1-7     the inverse of a matrix
            isempty()        P1.10      is it empty (no value)?
            isnumeric()      P1.10      has it a numeric value?
            jacob()          S4.6       Jacobian matrix of a given function
            jacob1()         P5.3       Jacobian matrix of a given function
            jacobi()         S2.5-1     Jacobi iteration to solve a equation
                                        st
            Jkb()            P1.21      1 kind of k-th order Bessel function
            lagranp()        S3.1       Lagrange polynomial interpolation
            lgndrp()         S5.9-1     Legendrepolynomial
            length()         S1.1-7     the length of a vector (sequence)
            limit()          AG2-2      limit of a symbolic expression
            lin eq()         S2.1-3     solve linear equation(s)
              −
            linprog()        S7.3-3     solve a linear programming (LP) problem
            load             S1.1-2,4   read variable(s) from file
            loglog()         S1.1-4     plot data as logarithmic scales for the x-axis and y-axis
            lookfor          S1.1-1     search for string in the first comment line in all M-files
            lscov()          S3.8-1     weighted least-squares with known (error) covariance
            lsqcurvefit()     S3.8-3     weighted nonlinear least-squares curve fitting
            lsqlin()         S7.3-1     solve a linear least squares (LLS) problem
            lsqnonlin()      S7.3-1     solve a non-linear least squares (NLLS) problem
            lsqnonneg()      S7.3-2     find a non-negative least squares (NNLS) solution
            lu()             S2.4-1     LU decomposition (factorization)
            lu dcmp()        S2.4-1     LU decomposition (factorization)
             −
            max()            S1.1-7     find the maximum element(s) of an array
            mesh()           S1.1-5, 3.7  plot a mesh-type graph of f(x, y)
            meshgrid()       S1.1-5, 3.7  grid points for plotting a mesh-type graph
            min()            S1.1-7     find the minimum element(s) of an array
            mkpp()           P1.11      make a piece-wise polynomial
            mod()            S1.1-5 (T1.3) remainder after division
            mulaw()          P1.9       µ-law
            mu inv()         S7.1-7     µ −1  law
              −
            multiply matrix()  P1.12    matrix multiplication
                  −
            newton()         S4.4       Newton method to solve a nonlinear equation
            newtonp()        S3.2       Newton polynomial interpolation
            newtons()        S4.6       Newton method to solve a system of nonlinear equation
            norm()           P1.13      norm of vector/matrix
            ode ABM()        S6.4-1     solve a state equation by Adams-Bashforth-Moulton
               −
                                         solver
            ode Euler()      S6.1       solve a state equation by Euler’s method
               −
            ode Ham()        S6.4-2     solve a state equation by Hamming ODE solver
               −
            ode Heun()       S6.2       solve a state equation by Heun’s method
               −
            ode RK4()        S6.3       solve a state equation by Runge-Kutta method
               −
            ode23()/ode45()  S6.4-3     ODE solver
   512   513   514   515   516   517   518   519   520