A matrix is a set of numbers arranged in m rows and n columns. Some definition associated with matrices Special matrices: Hermitian Matrix Skew-Hermitian matrix Gauss-Jordan Elimination Method: A method of solving a linear system of equations. This is done by transforming the system's augmented matrix into reduced row-echelon form by means of elementary operations. The following row operations on the augmented matrix of a system produce the augmented matrix of an equivalent system, i.e., a system with the same solution as the original one. The Gauss-Jordan elimination method to solve a system of linear equations is described in the following steps. 1- Interchange any two rows. π π ↔ π π means: Interchange row π and row π. 2- Multiply each element of a row by a nonzero constant. πΌπ π means: Replace row π with πΌ (πΌ ππ ππππ π‘πππ‘) times row π 3- Replace a row by the sum of itself and a constant multiple of another row of the matrix. π π + πΌπ π means: Replace row π with the sum of row i and α times row π. Rank: Rank of Matrix is: The maximum number of linearly independent rows in a matrix A is called the row rank of A. e.g: If the system equations is Ax=B then the solution can be have one of the following cases Where n is the numbers of variables e.g.: Example 1: Solve the following system by using the Gauss-Jordan elimination method. ππ + ππ + ππ = π , π+π+π=π , ππ + ππ = π 2 3 Solution: The augmented matrix of the system is the following. 1 1 4 0 2 3 . 1 1 4 0 5 8 1 5 5 2 π 2 β·π 1 1 2 4 π 3 =π 3 −4π 1 1 π 3 = π 3 13 1 1 0 1 0 0 1 3 0 1 5 5 8 5 2 1 0 0 1 1 −4 1 5 3 −2 1 −2 π 2 =π 2 −2π 1 1 5 3 −2 1 −18 π 1 =π 1 −π 3 π 2 =π 2 −3π 3 1 0 4 1 1 5 1 3 −2 0 5 2 π 3 =π 3 +4π 2 1 1 0 1 0 0 5 8 1 5 5 2 0 7 0 4 1 −2 1 1 1 5 0 1 3 −2 0 0 13 −26 π 1 =π 1 −π 2 1 0 0 3 0 1 0 4 0 0 1 −2 βΉ πΉπππ π¨ = πΉπππ π¨ π© = π From this final matrix, we can read the solution of the system. It is π = π, π = π, π = −π. Example 2: Solve the following system by using the Gauss-Jordan elimination method. π + π + ππ = π , ππ − π + ππ = π , ππ + π + ππ = π 1 1 Solution: The augmented matrix of the system is the following. 2 −1 4 1 1 2 4 1 2 1 −1 2 3 1 6 5 π 2 =π 2 −2π 1 π 3 =π 3 −4π 1 πΉπππ π¨ = πΉπππ π¨ π© < π −3π¦ − 2π§ = 1 ⇒ π¦ = 1+2π§ −3 1 0 0 1 2 1 −3 −2 1 −3 −2 1 π 3 =π 3 −π 2 We obtain infinite solutions , π₯ + π¦ + 2π§ = 1 ⇒ π₯ = 4−4π§ 3 1 0 0 1 −3 0 2 1 1 3 5 4 2 1 −2 1 0 0 Example 3: Solve the following system by using the elementary row operation. ππ + ππ − π = π , π−π+π=π , −π − ππ + ππ = π 1 Solution: The augmented matrix of the system is the following. 3 −1 1 3 −1 −1 1 4 2 −1 7 −4 3 2 π 2 =π 2 −3π 1 π 3 =π 3 +π 1 1 −1 1 4 0 5 −4 −5 0 −5 4 6 π 3 =π 3 +π 1 −1 2 −4 1 0 0 1 4 −1 7 3 2 −1 1 4 5 −4 −5 0 0 1 The matrix has now echelon form, and there is a pivot in the last column. Therefore, the linear system has no solutions. In fact, the πΉπππ π¨ ≠ πΉπππ π¨ π© which clearly has no solutions. Eigenvalues and Eigenvectors A (non-zero) vector V of dimension N is an eigenvector of a square (n×m) matrix A if it satisfies the linear equation π΄ π = π π , where {\displaystyle \lambda } π is a scalar, termed the eigenvalue corresponding to V. That is, the eigenvectors are the vectors that the linear transformation A merely elongates or shrinks, and the amount that they elongate/shrink by is the eigenvalue. The above equation is called the eigenvalue equation or the eigenvalue problem. This yields an equation for the eigenvalues P(λ)=det (A-λI)=0 We call P(λ) the characteristic polynomial, and the equation is called the characteristic equation. The basic equation is Ax=λx π −π π Example Find the eigenvalues and eigenvectors of matrix A: −π π −π π −π π Cayley-Hamilton π Example 1: use Cayley-Hamilton to find π¨−π Where π¨ = π π−π π π¨ − ππ° = π βΉ π ππ =π βΉ π π−π π»ππ ππππππππππππππ ππππππππ ππ π· π¨ = π − π π· π¨ = ππ − ππ − π = π βΉ ππ − ππ = π π π π−π −π=π βΉ π©π πͺπππππ−π―πππππππ πππππππ π π° = π¨π − ππ¨ Find π¨−π ππππππππ ππ π¨−π π¨−π ππ¨−π π° = π¨π π¨−π − ππ¨π¨−π π = π π π π π −π π π π π π¨−π = ππ¨−π = π¨ − ππ° π¨−π π −π π π π −π π = π π π π¨−π = π π − π π π (π¨ − ππ°) π π π Example 1: use Cayley-Hamilton to find and π¨π Where π¨ = π· π¨ = ππ − ππ − π = π ππ = ππ + π π π π π π©π πͺπππππ−π―πππππππ πππππππ π¨π = ππ¨ + π π° ππππππππ ππ π¨ π¨π = ππ¨π + π π¨ πΊπππππππ πππ ππππππππ π©ππ π¨π =ππ¨+π π° ππππ π¨π = π ππ¨ + π π° + π π¨ π¨π = ππ π¨ + ππ π° ⇒ π¨π = ππ π π π π π − ππ π π π Example 1: Use Cayley-Hamilton to find πͺπ πππ πͺπ Where πͺ = π −π π πͺ − ππ° = π βΉ π ππ π − π βΉ ππ = π βΉ πͺπ = πͺ − π π π −π π =π βΉ π −π π π/π −π/π −π/π π/π π π − π − = π βΉ ππ − π = π π π βΉ πͺπ = πͺ βΉ πͺπ = πͺπ = πͺπ = πͺ = π/π −π/π −π/π π/π