Matrix computations, MATLAB

Originally developed as a matrix laboratoiy to provide access to matrix software, MATLAB integrates mathematical computing, visualization, and a programming language for scientific and technical computing http //www.mathworks.com/... 

After the assembling of the stochastic matrix Pd we have to solve the associated non-selfadjoint eigenvalue problem. Our present numerical results have been computed using the code speig by Radke AND S0RENSEN in Matlab,... 

To compute the controllability matrix, we can use the MATLAB function ctrb () ... 

For your information, relative gain array can be computed as the so-called Hadamard product, Ay = KjjKrH, which is the element-by-element product of the gain matrix K and the transpose of its inverse. You can confirm this by repeating the examples with MATLAB calculations. 

Table 21-1 Matrix operations in MATLAB to compute equations 21-1-21-4...

With the advent of modern software tools, however, tools such as MATLAB and even the older language, APL, matrix operations can be coded directly from the matrix-math expressions, and then it becomes near-trivial to create and solve the matrix equations on-the-fly, so to speak, and calculate the coefficients for any derivative using any desired polynomial, and computed over any odd number of data points. 

Then we compute the matrix inverse of equation 56-25 (in MATLAB, this is just ... 

Initially, we develop Matlab code and Excel spreadsheets for relatively simple systems that have explicit analytical solutions. The main thrust of this chapter is the development of a toolbox of methods for modelling equilibrium and kinetic systems of any complexity. The computations are all iterative processes where, starting from initial guesses, the algorithms converge toward the correct solutions. Computations of this nature are beyond the limits of straightforward Excel calculations. Matlab, on the other hand, is ideally suited for these tasks, as most of them can be formulated as matrix operations. Many readers will be surprised at the simplicity and compactness of well-written Matlab functions that resolve equilibrium systems of any complexity. 

This function is called numerous times from the Matlab ODE solver. In the example it is the ode45 which is the standard Runge-Kutta algorithm. ode45 requires as parameters the file name of the inner function, ode autocat. m, the vector of initial concentrations, cO, the rate constants, k, and the total amount of time for which the reaction should be modelled (20 time units in the example). The solver returns the vector t at which the concentrations were calculated and the concentrations themselves, the matrix C. Note that due to the adaptive step size control, the concentrations are computed at times t which are not predefined. 

For the computation of the pseudo-inverse, it is crucial that the vectors f j are not parallel, or more correctly, that they are linearly independent. Otherwise, the matrix FlF is singular and cannot be inverted. Matlab issues a warning. We can gain a certain level of understanding by adapting Figure 4-10 ... 

Matlab supplies the function Isqnonneg that performs a non-negative least-squares fit of the kind y=Ca+r, where y and a are column vectors. The function computes the best vector a with only positive entries. This equation corresponds to data acquired at only one wavelength. In our application, the columns of A have to be computed individually in a loop over all wavelengths, in each instance using the appropriate column of Y. C is the complete matrix of concentrations. It is, of course, the same for all wavelengths. 

Equation (27) expresses an error in the dynamic matrix element Lij obtained from full matrix analysis if the error in peak volumes is Aa [50]. It also assumes that volume errors are equal for all peaks and are uncorrelated Aa is volume error normalized to the volume of a single spin at Tm = 0. Modem computer programs (Matlab, Mathematica, Mapple) can calculate the dynamic matrix from eq. (11) directly. 

One ideally suited software for engineering and numerical computations is MATL AET-7 1. This acronym stands for Matrix Laboratory . Rs operating units and principle are vectors and matrices. By their very nature, matrices express linear maps. And in all modern and practical numerical computations, the methods and algorithms generally rely on some form of linear approximation for nonlinear problems, equations, and phenomena. Nowadays all numerical computations are therefore carried out in linear, or in matrix and vector form. Thus MATLAB fits our task perfectly in the modern sense. 

Our two command lines below first generate the coefficient matrix A and the right hand side vector b for (1.1), followed by the MATLAB backslash linear equations solver that computes the solution vector x. This is followed by a simple verification of the error inherent in the residual vector A-x — b for our numerical solution x. This error is nearly zero since in MATLAB the number -1.3323e-15 describes the real number —1.3323 10-15. 

The SVD is generally accepted to be the most numerically accurate and stable technique for calculating the principal components of a data matrix. MATLAB has an implementation of the SVD that gives the singular values and the row and column eigenvectors sorted in order from largest to smallest. Its use is shown in Example 4.3. We will use the SVD from now on whenever we need to compute a principal component model of a data set. 

C+ is the so-called pseudoinverse of C. It can be computed as C+ = (C C) 1 Cl. However, MATLAB provides a numerically superior method for the calculation of A by means of the back-slash operator ( ). Refer to the MATLAB manuals for details. The important point is that we are now in a position to write the residual matrix R, and thus ssq, as a function of the rate constants k only ... 

Below a Matlab script for the calculation of a quadrature approximation of order N from a known set of moments iti using the Wheeler algorithm is reported. The script computes the intermediate coefficients sigma and the jacobi matrix, and, as for the PD algorithm, determines the nodes and weights of the quadrature approximation from the eigenvalues and eigenvectors of the matrix. 

---