Basics of Linear Algebra

To understand the concepts of the methods described in the following chapters, one should have an understanding of the basics of linear algebra. This chapter will serve as a short refresher. Linear algebra essentially deals with vector and matrix manipulations, all of which can easily be performed by using the MATLAB software. However, an insight into some of the concepts behind the operations may be helpful. 

There are many good references that give a brief overview of Linear Algebra (Lay, 1996 Bretscher, 1997 and Wise et al., 2004). 

The building blocks of linear algebra are scalars, vectors and matrices. An example of a scalar is a single number, for example a = 3. There are two types of vector column vectors and row vectors. An example of a column vector is  

A column vector can be transformed into a row vector by taking the transpose  

Matlab uses the colon notation, if you would like to address all columns or all rows, for example, 1 = ( , 1 2) means that matrix A1 has the same rows than matrixv4, the number of colums of A1 are only columns one to two of matrix.  

---

Here A is an (m x C) formula matrix, N is a (C x 1) vector of mole numbers, and b is an (mg x 1) vector of constant elemental abundances. (Basics of linear algebra are reviewed in Appendix B.) The matrix A is known from the chemical formulae of the species present, and the abundances b are known from the amounts initially loaded into the reactor. But the mole numbers N are unknown. Moreover, the sets N that satisfy the balances (7.4.2) are not unique many different combinations of amounts of the given species (N) can produce the same elemental balances (b). This means that the formula matrix A is singular. 

While linear algebraic methods are present in almost every problem, they also have a number of direct applications. One of them is formulating and solving balance equations for extensive quantities such as mass and energy. A particularly nice application is stoichiometry of chemical systems, where you will discover most of the the basic concepts of linear algebra under different names. 

In this chapter we introduce complex linear algebra, that is, linear algebra where complex numbers are the scalars for scalar multiplication. This may feel like review, even to readers whose experience is limited to real linear algebra. Indeed, most of the theorems of linear algebra remain true if we replace R by C because the axioms for a real vector space involve only addition and multiplication of real numbers, the definition and basic theorems can be easily adapted to any set of scalars where addition and multiplication are defined and reasonably well behaved, and the complex numbers certainly fit the bill. However, the examples are different. Furthermore, there are theorems (such as Proposition 2.11) in complex linear algebra whose analogues over the reals are false. We will recount but not belabor old theorems, concentrating on new ideas and examples. The reader may find proofs in any number of... 

It has been already noted that the rate of a steady-state reaction can be regarded as a vector in the P-dimensional space specified by its components, which are the rates along the basic routes. In terms of linear algebra, the above result means that when the basis of routes is transformed the reaction rate vector along these routes is transformed contravariantly. 

A natural language accounting for the stoichiometry of chemcial reactions is that of linear algebra. Let us remind ourselves of its basic concepts. 

The section that follows describes basic background concepts and nomenclature. Then a classification of various programming models is outlined. Computational chemistry applications rely on many kinds of linear algebra and on equation-solving techniques that use new computer science algorithms. These implementations are delineated. A partial review of current and planned applications, developed on today s MPP supercomputers for chemistry, is presented. The last section of text gives a summary and our conclusions. Finally, we present a glossary and an appendix that reviews the currently available MPP machines. 

In physics and chemistry it is not possible to develop any useful model of matter without a basic knowledge of some elementary mathematics. This involves use of some elements of linear algebra, such as the solution of algebraic equations (at least quadratic), the solution of systems of linear equations, and a few elements on matrices and determinants. 

The subject of linear equations is best described in terms of concepts associated with linear algebra and matrix theory. The reader is referred to Amundson (1966) for details. We present here only the basic definitions and results that are important for the solution of linear algebraic equations. Consider m equations in n unknowns x, X2,. ..,x given by... 

Although the details may be quite different, every research effort in the area of dynamic simulation faces a common task — the efficient and accurate solution of the Direct Dynamics problem. In the development of algorithms for Direct Dynamics, two basic approaches have emerged for both open- and closed-chain systems. The first utilizes the inversion of the x manipulator joint space inertia matrix to solve for the joint accelerations. More accurately, the accelerations are found via the solution of a system of linear algebraic equations, but the... 

In [31], Oh and Orin extend the basic method of Orin and McGhee [33] to include simple closed-chain mechanisms with m chains of N links each. The dynamic equations of motion for each chain are combined with the net face and moment equations for the reference membo and the kinematic constraint equations at the chain tips to form a large system of linear algebraic equations. The system unknowns are the joint accelerations for all the chains, the constraint fcwces applied to the reference memba, and the spatial acceleration of the reference member, lb find the Joint accelerations, this system must be solved as a whole via standard elimination techniques. Although this approach is sbmghtforward, its computational complexity of 0(m N ) is high. 

The general method for solving Eqs. (11) consists of transforming the partial differential equations with the help of Fourier-Laplace transformations into a set of linear algebraic equations that can be solved by the standard techniques of matrix algebra. The roots of the secular equation are the normal modes. They yield the laws for the decays in time of all perturbations and fluctuations which conserve the stability of the system. The power-series expansion in the reciprocal space variables of the normal modes permits identification of relaxation, migration, and diffusion contributions. The basic information provided by the normal modes is that the system escapes the perturbation by any means at its disposal, regardless of the particular physical or chemical reason for the decay. 

This section will briefly review some of the basic matrix operations. It is not a comprehensive introduction to matrix and linear algebra. Here, we will consider the mechanics of working with matrices. We will not attempt to explain the theory or prove the assertions. For a more detailed treatment of the topics, please refer to the bibliography. 

The Linear Algebraic Problem.—Familiarity with the basic theory of finite vectors and matrices—the notions of rank and linear dependence, the Cayley-Hamilton theorem, the Jordan normal form, orthogonality, and related principles—will be presupposed. In this section and the next, matrices will generally be represented by capital letters, column vectors by lower case English letters, scalars, except for indices and dimensions, by lower case Greek letters. The vectors a,b,x,y,..., will have elements au f it gt, r) . .. the matrices A, B,...,... 

In CED, a number of different iterative solvers for linear algebraic systems have been applied. Two of the most successful and most widely used methods are conjugate gradient and multigrid methods. The basic idea of the conjugate gradient method is to transform the linear equation system Eq. (38) into a minimization problem... 

Hopefully Chapters 1 and 2 have refreshed your memory of early studies in matrix algebra. In this chapter we have tried to review the basic steps used to solve a system of linear equations using elementary matrix algebra. In addition, basic row operations... 

In Chapters 2 and 3, we discussed the rules related to solving systems of linear equations using elementary algebraic manipulation, including simple matrix operations. The past chapters have described the inverse and transpose of a matrix in at least an introductory fashion. In this installment we would like to introduce the concepts of matrix algebra and their relationship to multiple linear regression (MLR). Let us start with the basic spectroscopic calibration relationship ... 

---