This document provides an overview of matrix algebra and its applications. It discusses different types of matrices like null matrices and scalar matrices. It also covers matrix operations like addition, subtraction, and multiplication. Methods for solving systems of linear equations using matrices are presented, including inverse methods and Gaussian elimination. Applications of matrices in areas like Markov chains and solving word problems involving systems of linear equations are also summarized.
This document provides an overview of matrix algebra and its applications. It discusses different types of matrices like null matrices and scalar matrices. It also covers matrix operations like addition, subtraction, and multiplication. Methods for solving systems of linear equations using matrices are presented, including inverse methods and Gaussian elimination. Applications of matrices in areas like Markov chains and solving word problems involving systems of linear equations are also summarized.
This document provides an overview of matrix algebra and its applications. It discusses different types of matrices like null matrices and scalar matrices. It also covers matrix operations like addition, subtraction, and multiplication. Methods for solving systems of linear equations using matrices are presented, including inverse methods and Gaussian elimination. Applications of matrices in areas like Markov chains and solving word problems involving systems of linear equations are also summarized.
This document provides an overview of matrix algebra and its applications. It discusses different types of matrices like null matrices and scalar matrices. It also covers matrix operations like addition, subtraction, and multiplication. Methods for solving systems of linear equations using matrices are presented, including inverse methods and Gaussian elimination. Applications of matrices in areas like Markov chains and solving word problems involving systems of linear equations are also summarized.
Download as PPTX, PDF, TXT or read online from Scribd
Download as pptx, pdf, or txt
You are on page 1/ 33
Chapter Two
Matrix Algebra and its applications
Matrix is a rectangular arrangement of numbers interms of rows and columns. Each number appearing in the arrangement is called an element or component of that particular Matrix. A matrix is represented a BOLD FACE/ CAPITAL LETTER enclosed by brackets or parentheses as:
a11, the first subscript always refers to the row location of the element; the second subscript always refers to its column location. a mxn reflects the order or dimensions of a matrix. Accordingly. m is total number of rows and n is total number of column in a matrix. TYPES OF MATRICES 3. NULL (ZERO) MATRIX - is a matrix that has zero for every entry. It is generally denoted by O . the sum of a zero matrix and any matrix gives that given matrix mn
and the product of a zero matrix and any matrix equals Zero matrix.
5. SCALAR MATRIX - is a square matrix where elements on the primary diagonal are the same and the rest zeros. NB: An Identity matrix is a scalar matrix, but a scalar matrix may not be an identity matrix MATRIX OPERATIONS (ADDITION, SUBTRACTION, and MULTIPLICATION)
Matrix Addition (subtraction)
Matrix Multiplication Finding Inverse of a Matrix Not all matrices have an inverse. In order for a matrix to have an inverse, the matrix must, first of all, be a square matrix. Still not all square matrices have inverse.
The process of finding inverse of a Matrix
Step1:- augment square matrix with an identity matrix of the same order, as [A/I].
Step 2:- perform ELEMENTARY ROW OPERATIONS on the augmented square
matrix to transform A on the left side of the vertical line in to an identity matrix (I). As the identity matrix is formed on the left of the vertical line, the inverse of A is formed on the right side. Permissible/allowable row operation 1. Interchanging rows:- Any pair of row in a matrix may be interchanged /Exchange operations/
2. The multiplication of any row by a non-zero number:- A row can be multiplied by any non-zero real number /Multiple operations/. 3. The addition /subtraction of (a multiple of) one row to/from) another row:- A multiple of any row can be added to any other row /Add-A-Multiple operations/. MATRIX APPLICATIONS Solving Systems of Linear Equations 1. n by n systems: Systems of linear equations can be solved using different methods. Some are: Elimination method for 2 variable problems (equations). Matrix method Inverse method Cramer’s rule – using determinants (independent study) Gaussian Method.
N.B:- n by n systems means same no of rows and columns/ same no of
equations and variables. I. Inverse Method In order to use this method, the coefficient matrix needs to be non-singular(have an inverse) It involves the following steps: 1. Change a word problem into system of equation(if any) 2. Put all equations in a matrix form, the result will be three different matrix Coefficient matrix Variable matrix Right hand side value matrix /Vector of constants/ 3. Find an inverse of a coefficient matrix. 4. Multiply a inverse of a coefficient matrix with right hand side values matrix (vector of constants) N.B:-The inverse method provides us with unique solution, or no solution and infinite solution (with out separating them).
For Example, x+y = 2
2x + 2y= 4 II. Gaussian Method Solving systems of linear equations using the Gaussian method involves the following steps: 1. Change a word problem into system of equation(if any) 2. Put all equations in a matrix form, the result will be three different matrix Coefficient matrix Variable matrix Right hand side value matrix /Vector of constants/ 3. Augment a coefficient matrix with Right hand side value matrix/ vector of constants/ 4. Perform elementary row operation to convert the augmented coefficient matrix into identity matrix , simultaneously the augmented Right hand side value matrix will be changed into the value of unknown variables. N.B:- The Gaussian Method helps us to obtain: Unique solution, No. Solution and Infinite solution
Example 1:: 2X + 3Y = 44 X +2Y = 22 Q9.Asrat Carpet Company has in inventory 1,500 square yards of wool and 1,800 square yards of nylon for the manufacture of carpeting. Two grades of carpeting are produced. Each roll of superior grade carpeting requires 20 sq. yards of wool and 40 square yards of nylon. Each roll of quality-grade carpeting requires 30 square yards of wool and 30 square yard of nylon. If Asrat would like to use all the material in inventory, how many rolls of superior and how many rows of quality carpeting should be manufactured? Answer: 15 and 40.
Q11.Alemayehu invested a total of 10,000 in three different savings accounts. The accounts paid simple interest at an annual rate of 8 percent, 9 percent and 7.5 percent respectively. Total interest earned for the year was Br 845. The amount in the 9 percent account was twice the amount invested in the 7.5 percent account. How much did Alemayehu invest in each account? Br 1,000, Br 6,000 and Br 3,000 2. M by n linear systems The mxn linear systems are those systems where the number of rows (m) and number of columns (n) are unequal or it is the case where the number of equations (m) and the number of variables (n) are unequal. And it may appear as m>n or m<n. 2.1 Linear equations where m>n To solve an m by n systems of equations with m>n, we start with the matrix (A/B), and attempt to transform it in to the matrix (I/C). One of the three things will result: An n by n identity matrix above m-n bottom rows that are all zero's, giving the unique solution A row that all zero's except in the constant column, indicating that there are no solutions. A matrix in a form different from (1) and (2), indicating that there are an unlimited number of solutions. 2.2. Linear equations where m<n Our attempt transform (A/B) in to (I/C) in the case where m<n will result in: A row that is all zero's except in the constant column, indicating that there are no solutions. Or A matrix in a form different from (1), indicating that there are an unlimited number of solutions.
N.B “Every system of linear equations has no solution, exactly one
solution or infinitely many solutions.” Cramer’s Rule for Solving Linear Equation Cramer’s rule is a method that is useful primarily for low order system, with two or three unknowns. Cramer’s rules states that each unknown can be expressed as the ratio of two matrix determinants.
1. Solving two equations in two unknowns
MARKOV CHAINS Concept, Model and Solutions This model is a forecasting model. It is probabilistic/ stochastic model.
The necessary assumptions of the chain are:
1. The system has a finite number of states - the out comes of the system should be finite. 2. The system condition/outcome, state in any given period depends on its state in the preceding period and on the transition probabilities 3. The transition probabilities are constant over time. 4. Changes in the system will occur once and only once each period. Information flow in the Analysis The Markov model is based on two sets of input data The set of transition probabilities. The existing or initial or current conditions or states. From these inputs the model makes two predictions usually expressed as vectors: 1. The probabilities of the system being in any state at any given future time period. 2. The long run / equilibrium, steady state probabilities. N.B. Markov chain analysis used among other things in Market share Analysis.
