INTERMEDIATE METHODS:

MATRIX ALGEBRA
MATRIX ALGEBRA
 Matrix Addition: Just add the corresponding elements.
 Matrix Subtraction: Just subtract the corresponding
elements.
 Matrix Multiplication: Product matrix AB can only be
defined if Number of columns of A = Number of rows
of B

 a b   w x   aw  by ax  bz 
       
 c d   y z   cw  dy cx  dz 
MATRIX ALGEBRA
 Laws of Matrix Algebra:
 Associative laws:
 (A+B)+C = A+(B+C)
 A(BC) = (AB)C
 Commutative Law for Addition:
 A+B = B+A
 However, it is not generally true that AB = BA
 Distributive Laws:
 A(B+C) = AB + AC
 Transpose:
 A transpose of Matrix A is AT which has had it’s rows and columns
interchanged:
 Laws of Transposed Matrices:
 (A+B)T = AT + BT
 (AT)T = A
a b  a c 
 (rA)T = rAT
(AB)T = BTAT
A   ; A  
T

c d  b d 

MATRIX ALGEBRA
 Special Kinds of Matrices:
 SQUARE MATRICES
 In which #Rows=#Columns
 DIAGONAL MATRICES
 In which all non diagonal entries are 0.
 UPPER/LOWER TRIANGULAR MATRICES
 In which all the entries below/above the diagonal are 0.
 SYMMETRIC MATRICES
 In which the matrix is symmetrical about the diagonal.
 IDEMPOTENT MATRICES
 In which A . A = A (e.g., where A = I)
 PERMUTATION MATRICES
 Non-diagonal Identity Matrix.
MATRIX ALGEBRA
 Elementary Matrices: resulted by performing an
elementary row operation on the Identity Matrix.
 Three types:
 Ei,J  Interchange rows i and j
 Ei(r)  Multiply row ‘i’ by a scalar ‘r’
 Ei,J (r)  Multiply row ‘i’ by ‘r’ and add it to row ‘j’
 To use an elementary matrix, LEFT MULTIPLY it with
another matrix, as below:
1 0  a b   a b 
E1, 2 (3)  A         
 3 1   d c   3a  d 3b  c 
MATRIX ALGEBRA
 Inversion:
 Any nxn Matrix can have at most one inverse.

 A Matrix is only invertible is it is NONSINGULAR.

 Therefore, the unique set of solutions to Ax=b is x=A-1b.

 To find the inverse Matrix of A, Augment A with the

identity Matrix and perform row operations to get I.
 [A | I]  [I | A-1]

 d b 
 a b 1 0  1 0
ad  bc

ad  bc 
   
 c d 0 1   0 1 c a 

 ad  bc ad  bc 
1 1  d  b
A   
ad  bc   c a 
MATRIX ALGEBRA
 Inversion laws:
 (A-1)-1=A

 (AT)-1=(A-1)T

 AB is invertible and (AB)-1=B-1A-1

 Indices laws:
 (Am)-1 = (A-1)m = A-m

 ArAs = Ar+s

 (rA)-1 = r-1A-1