2 Matrix Algebra

Technological Institute of the Philippines Prepared by: Engr. Adams Royce A.
Dionisio, RCE
938 Aurora Blvd., Cubao, Quezon City Structural Engineer
College of Engineering and Architecture
Department of Civil Engineering
CE 504
Structural Matrix Analysis

Technological Institute of the Philippines Prepared by: Engr. Adams Royce A. Dionisio, RCE
Matrix Algebra
Matrix- is defined as a rectangular array of quantities (elements) arranged in rows and columns.
Order of the matrix

Types of Matrices
Column Matrix (Vector)- a matrix where all of the elements are arranged in a single column (i.e., n= 1)
Row Matrix (Vector)- a matrix with all of its elements arranged in a single row (i.e., m= 1)
Types of Matrices
Square Matrix- a matrix which has the same number of rows and columns (i.e., m= n)
Diagonal elements, the rest are

called off-diagonal elements
Symmetric Matrix- is a square matrix in which the off-diagonal terms are symmetric about the main diagonal.
(i.e. 𝑎𝑖𝑗 = 𝑎𝑗𝑖 )
Diagonal elements
Types of Matrices
Lower Triangular Matrix- a square matrix where all of the elements above its main diagonal are zero, (i.e.
𝑎𝑖𝑗 =0 for j>i)
Diagonal elements
Upper Triangular Matrix- a square matrix where all of the elements below its main diagonal are zero. (i.e.
𝑎𝑖𝑗 =0 for j<i)
Diagonal elements
Types of Matrices
Diagonal Matrix- a square matrix where all of the elements are zero except along the main diagonal (i.e. 𝑎𝑖𝑗 =
0 for i ≠ 𝑗)
Diagonal elements
Unit or Identity Matrix- is a diagonal matrix with all the diagonal elements equal to unity (1). (i.e. 𝐼𝑖𝑗 =
1 and 𝐼𝑖𝑗 = 0 for i ≠ 𝑗)
Diagonal elements
Types of Matrices
Null Matrix- a matrix where all of the elements are zero. (i.e. 𝑂𝑖𝑗 = 0)
Matrix Operations
Equality of Matrices- matrices are considered to be equal if they are of the same order and if their
corresponding elements are identical (i.e. 𝐴𝑖𝑗 = 𝐵𝑖𝑗 )
𝑨=𝑩
Addition/ Subtraction of Matrix- matrices can be added (or subtracted) only if they are of the same order. (i.e.
𝐴𝑖𝑗 + 𝐵𝑖𝑗 = 𝐶𝑖𝑗 )
𝑎 𝑏 𝑐 1 2 3 𝑎±1 𝑏±2 𝑐±3
𝑨= 𝑑 𝑒 𝑓 𝑩= 4 5 6 𝑨+𝑩=𝑪= 𝑑±4 𝑒±5 𝑓±6
𝑔 ℎ 𝑖 7 8 9 𝑔±7 ℎ±8 𝑖±9
Commutative
Associative
Matrix Operations
Scalar Multiplication of Matrix- when a matrix is multiplied by a scalar, each element of the matrix is multiplied
by the scalar. (i.e. 𝑘 𝑥 𝐴𝑖𝑗 )
𝑎 𝑏 𝑐 𝑎𝑥𝑘 𝑏𝑥𝑘 𝑐𝑥𝑘
𝑨= 𝑑 𝑒 𝑓 𝒌𝒙𝑨= 𝑑𝑥𝑘 𝑒𝑥𝑘 𝑓𝑥𝑘
𝑔 ℎ 𝑖 𝑔𝑥𝑘 ℎ𝑥𝑘 𝑖𝑥𝑘
Multiplication of Matrix- two matrices can be multiplied only if they are conformable, meaning, the number of
columns of the first matrix equals the number of rows of the second matrix. (i.e. 𝐴𝑚 𝑥 𝑝 𝑥 𝐵𝑝 𝑥 𝑛 = 𝐶𝑚 𝑥𝑛 )
𝑎
1 2 3 𝑏 𝑐
𝑨= 𝑑
𝑩= 4 5 6 𝑒 𝑓
𝑔
7 8 9 ℎ 𝑖
𝑎𝑥1+𝑏𝑥4+𝑐𝑥7 𝑎𝑥2+𝑏𝑥5+𝑐𝑥8 𝑎𝑥3+𝑏𝑥6+𝑐𝑥9
𝐴𝑥𝐵 =𝐶 = 𝑑𝑥1+𝑒𝑥4+𝑓𝑥7 𝑑𝑥2+𝑒𝑥5+𝑓𝑥8 𝑑𝑥3+𝑒𝑥6+𝑓𝑥9
𝑔𝑥1+ℎ𝑥4+𝑖𝑥7 𝑔𝑥2+ℎ𝑥5+𝑖𝑥8 𝑔𝑥3+ℎ𝑥6+𝑖𝑥9
Not Commutative Distributive Associative

Matrix Operations
Transpose of Matrix- is obtained by interchanging its corresponding rows and columns. (i.e. 𝐴𝑖𝑗 = 𝐴𝑇𝑗𝑖 )
𝑎 𝑏 𝑐 𝑎 𝑑 𝑔
𝑨= 𝑑 𝑒 𝑓 𝑨𝑻 = 𝑏 𝑒 ℎ
𝑔 ℎ 𝑖 𝑐 𝑓 𝑖
Inverse of a Matrix- the inverse of a square matrix A is defined as a matrix 𝐴−1 with elements of such
magnitudes that the product of the original matrix A and its inverse 𝐴−1 equals a unit matrix I
Orthogonal Matrix- is a matrix whose inverse is equal to its transpose. (i.e. 𝐴−1 = 𝐴𝑇 )
Skew-Symmetric Matrix- is a square matrix whose transpose equals minus the matrix. (i.e. 𝐴𝑇 = −𝐴)
Matrix Operations
Matrix Partitioning- is the process of subdividing a matrix into submatrices. The rules of matrix algebra apply
to partitioned matrices provided the partitioning is conformable.
Sample Problems:
1.
SOLUTION:
Sample Problems:
2.
SOLUTION:
Sample Problems:
3.
SOLUTION:
Sample Problems:
4.
SOLUTION:
24
Sample Problems:
4.
SOLUTION:
24 -5 -4
12 3 -2
-2 5 4
Sample Problems:
4.
SOLUTION:
24 -5 -4
12 3 -2
-2 5 4
Sample Problems:
4.
SOLUTION:
Sample Problems:
4.
SOLUTION:
Determinants
Determinants- is a square array of numbers enclosed within vertical bars.
Methods
Laplace’s Expansion- or cofactor expansion method, states that the numerical value represented by the
determinant is equal to the sum of the products of the elements of any row or column and their respective
cofactors (i.e. 𝐶𝑖𝑗 = (−1)𝑖+𝑗 𝑀𝑖𝑗 )
Minor or submatrix
Adjoint Matrix- (𝑐𝑜𝑓𝑎𝑐𝑡𝑜𝑟 𝑚𝑎𝑡𝑟𝑖𝑥)𝑇

Determinants
Basket Method- also called spider web method. Chios Method
𝑎 𝑏 𝑎 𝑏
𝑨= |𝑨| =
𝑐 𝑑 𝑐 𝑑
𝑨 = 𝑎𝑑 − 𝑏𝑐
𝑎 𝑏 𝑐 𝑎 𝑏 𝑐 𝑎 𝑏
𝑎11 𝑎12 𝑎11 𝑎13 𝑎11 𝑎1𝑛
𝑩= 𝑑 𝑒 𝑓 |𝑩| = 𝑑 𝑒 𝑓ቮ 𝑑 𝑒
𝑎21 𝑎22 𝑎21 𝑎23 ⋯ 𝑎21 𝑎2𝑛
𝑔 ℎ 𝑖 𝑔 ℎ 𝑖 𝑔 ℎ 𝑎11 𝑎12 𝑎11 𝑎13 𝑎11 𝑎1𝑛
|𝑨| = (𝑎11 )2−𝑛 𝑎31 𝑎32 𝑎31 𝑎33 ⋯ 𝑎31 𝑎3𝑛
|𝑩| = 𝑎𝑒𝑖 + 𝑏𝑓𝑔 + 𝑐𝑑ℎ − (𝑐𝑒𝑔 + 𝑎𝑓ℎ + 𝑏𝑑𝑖) ⋮ ⋮ ⋮
𝑎11 𝑎12 𝑎11 𝑎13 𝑎11 𝑎1𝑛
𝑎𝑚1 𝑎𝑚2 𝑎𝑚1 𝑎𝑚3 ⋯ 𝑎𝑚1 𝑎𝑚𝑛
Determinants
Upper Triangular Method- the goal is to make the matrix an upper triangular matrix using elementary
operations and the determinant can be easily obtained by multiplying the elements in the diagonal.
Elementary Operations
1. Any two rows of a matrix can be interchange (i.e. 𝑅1 ↔ 𝑅2 )
2. Any row or column of a matrix can be multiplied to any nonzero scalar (i.e. 𝑅1 ′ → 𝑘𝑅1 )
3. Any row of a matrix can be added to another row provided that the former will be multiplied to a nonzero
scalar (i.e. 𝑅2′ → 𝑅2 + 𝑘𝑅1 )
Adams’ Technique: since an upper triangular matrix has zero (0)

elements below the main diagonal, first make the first column lowest
element zero (0) using elementary operations up to the element
below the main diagonal, then the second column lowest element,
and so on.
𝑅2′ → 𝑅2 + 𝑘𝑅1
𝑒𝑙𝑒𝑚𝑒𝑛𝑡 𝑜𝑛 𝑅2
𝑘=−
Determinants
Pivotal Method
𝑎 𝑏 𝑐
𝑏 − 𝑎𝑒 𝑐 − 𝑎𝑓
𝑨= 1 𝑒 𝑓 |𝑨| =
ℎ − 𝑒𝑔 𝑖 − 𝑓𝑔
𝑔 ℎ 𝑖
1 𝑏 𝑐 𝑑
𝑓 − 𝑏𝑒 𝑔 − 𝑐𝑒 ℎ − 𝑑𝑒
𝑒 𝑓 𝑔 ℎ
𝑩= |𝑩| = 𝑗 − 𝑏𝑖 𝑘 − 𝑐𝑖 𝑙 − 𝑑𝑖
𝑖 𝑗 𝑘 𝑙
𝑛 − 𝑏𝑚 𝑜 − 𝑐𝑚 𝑝 − 𝑑𝑚
𝑚 𝑛 𝑜 𝑝
1. Using elementary operations, make an element equal to 1
2. Always start with multiplication to 1
Sample Problems:
Given a 6x6 matrix, find the determinant using purely;
1. Upper Triangular Method 1 2 1 0
2. Chios Method 0 3 1 1
3. Cofactor Expansion Method 𝑨=
−1 0 3 1
4. Pivotal Method 3 1 2 0
5. Reduce to 3x3 matrix and use Basket Method
Solution:
0 3 1 1 2
1 2 1 0 𝑨=
4 1 𝑅3′ = 𝑅3 − 𝑅2
0 3 1 1 0 2 3
𝑨= ′
𝑅3 = 𝑅3 + 𝑅1 0 0 2/3 5/3
−1 0 3 1
3 1 2 0 1 2 1 0
1 2 1 0 0 3 1 1 1
𝑨= 𝑅4′ = 𝑅4 − 𝑅3
𝑨=
0 3 1 1
𝑅4′ = 𝑅4 − 3𝑅1 0 0 10/3 1/3 5
0 2 4 1 0 0 2/3 5/3
3 1 2 0 1 2 1 0
1 2 1 0 0 3 1 1 10 8
0 3 1 1 5 𝑨 = 𝑨 =1 3 = 16
𝑨= 𝑅4′ = 𝑅4 + 𝑅2 0 0 10/3 1/3 3 5
0 2 4 1 3 0 0 0 8/5
0 −5 −1 0
Sample Problems:
−1 0 3 1
Solution:
2. Chios Method
1 2 1 1 1 0
0 3 0 1 0 1
1 2 1 1 1 0 3 1 3 1
|𝑨| = (1)2−4 2 4 2 1
−1 0 −1 3 −1 1 |𝑨| = (3)2−3
1 2 1 1 1 0 3 1 3 1
3 1 3 2 3 0 −5 −1 −5 0
−1 10 1 1 10 1
𝑨 = 3 =
3 1 1 3 1 1 2 5 3 2 5
𝑨 = 1 −2
2 4 1 = 2 4 1 1 1
10 1
−5 −1 0 −5 −1 0 𝑨 = (10)2−2 = 48 = 16
3 2 5 3
Sample Problems:
−1 0 3 1
Solution:
3. Cofactor Expansion Method
1 2 1 0 3 1 1 0 1 1 0 3 1 0 3 1
0 3 1 1 𝑨 = 1 0 3 1 − 2 −1 3 1 + 1 −1 0 1 − 0 −1 0 3
𝑨=
−1 0 3 1 1 2 0 3 2 0 3 1 0 3 1 2
3 1 2 0
3 1 1
3 1 0 1 0 3
1 0 3 1 =1 3 −1 +1 = −8
2 0 1 0 1 2 0 3 1
1 2 0 0 1 −1 1 −1 0
1 −1 0 1 =1 0 −3 +1 =8
1 0 3 0 3 1
3 1 0
0 1 1
3 1 −1 1 −1 3
−2 −1 3 1 = −2 0 −1 +1 = 16 𝑨 = −8 + 16 + 8 − 0 = 16
2 0 3 0 3 2
3 2 0
Sample Problems:
3. Cofactor Expansion Method 𝑨 =
−1 0 3 1
Solution:
4. Pivotal Method
1 2 1 0 3 − 2(0) 1 − 1(0) 1 − 0(0) 3 1 1
0 3 1 1
𝑨= |𝑨| = 0 − 2(−1) 3 − 1(−1) 1 − 0(−1) = 2 4 1
−1 0 3 1
3 1 2 0 1 − 2(3) 2 − 1(3) 0 − 0(3) −5 −1 0
2 − 3(1) 4 − 1(1) −1 3
|𝑨| = =
−5 − 3(0) −1 − 1(0) −5 −1
−1 3
|𝑨| = = 16
−5 −1
Sample Problems:
3. Cofactor Expansion Method 𝑨 =
−1 0 3 1
Solution:
1 2 1 0 3 − 2(0) 1 − 1(0) 1 − 0(0) 3 1 1
0 3 1 1
𝑨= |𝑨| = 0 − 2(−1) 3 − 1(−1) 1 − 0(−1) = 2 4 1
−1 0 3 1
3 1 2 0 1 − 2(3) 2 − 1(3) 0 − 0(3) −5 −1 0
3 1 1 3 1
|𝑨| = 2 4 1อ 2 4
−5 −1 0 −5 −1
|𝑨| = 3 4 0 + 1 1 −5 + 1(2)(−1) − 1 4 −5 + 3 1 −1 + 1(2)(0) = 16

System of Linear Equations
System of Linear Equations- a collection of linear equations involving common variables.
Two Major Methods for Solution

of System of Linear Equations
1. Direct Method
Cramer’s Rule
Gauss Elimination Method
Gauss-Jordan Method
LU Factorization Method
coefficient matrix -Doolittle’s Method
𝑎11 𝑎12 𝑎13 𝑐1 -Crout’s Method
𝑨|𝑩 = 𝑎21 𝑎22 𝑎23 อ 𝑐2 -Cholesky’s Method
𝑎31 𝑎32 𝑎33 𝑐3 2. Iterative Method
Gauss Jacobi Method
Gauss Seidel Method
augmented matrix
Solution to Linear Equations
Gauss Elimination Method- the objective of this method is to transform the system of linear equation to a new
system of upper triangular form using elementary operations from which a back substitution scheme will be
applied to obtain the values of the variables.
𝑎11 𝑎12 𝑎13 𝑐1 𝑎11 𝑎12 𝑎13 𝑥1 𝑐1

𝑨|𝑩 = 0 𝑎22 𝑎23 อ 𝑐2 0 𝑎22 𝑎23 𝑥2 = 𝑐2
0 0 𝑎33 𝑐3 0 0 𝑎33 𝑥3 𝑐3
Gauss Jordan Method- basically an extension of Gauss Elimination Method in such a way that the new form of
system of linear equation will be a diagonal matrix, therefore, no more back substitution or forward
substitution will be needed.
Adams’ Technique: since a lower triangular

matrix has zero (0) elements above the
main diagonal, first make the last column
highest element zero (0) using elementary
operations down to the element above the
main diagonal, then the second to the last
column highest element, and so on.
𝑎11 0 0 𝑐1 𝑎11 0 0 𝑥1 𝑐1
𝑨|𝑩 = 0 𝑎22 0 อ 𝑐2 0 𝑎22 0 𝑥2 = 𝑐2
0 0 𝑎33 𝑥3 𝑐3 𝑅1′ → 𝑅1 + 𝑘𝑅2
0 0 𝑎33 𝑐3
𝑘=−
Inverse of a Matrix- the inverse of a square matrix A is defined as a matrix 𝐴−1 with elements of such
magnitudes that the product of the original matrix A and its inverse 𝐴−1 equals a unit matrix I
𝑥1 𝑎
𝑥2 = 𝑏
𝑥3 𝑐
Sample Problems:
Given a system of linear equation
2𝑥1 − 𝑥2 + 3𝑥3 = 1 Solve for the values of 𝑥1 , 𝑥2 & 𝑥3 using:
1. Gauss Elimination Method
𝑥1 + 4𝑥2 − 𝑥3 = −1 2. Gauss Jordan Method
−2𝑥2 + 5𝑥3 = 2 3. Inverse of a Matrix Method
Solution:
2 −1 3 𝑥1 1 4 12
𝑅3′
→ 𝑅3 + 𝑅2 35 4
1 4 −1 𝑥2 = −1 9 𝑥3 = 𝑥3 =
9 3 35
0 −2 5 𝑥3 2 2 −1 3 1
𝑨𝒙 = 𝑩 𝑨|𝑩 = 0 9/2 −5/2 ቮ −3/2
2 −1 3 1 0 0 35/9 4/3
𝑨|𝑩 = 1 4 −1 อ −1 9 5 −3 −1
2 −1 3 𝑥1 1 𝑥 − 𝑥 = 𝑥2 =
0 −2 5 2 0 9/2 −5/2 𝑥2 = −3/2 2 2 2 3 2 7
1 0 0 35/9 𝑥3
′
𝑅2 → 𝑅2 − 𝑅1 4/3
2
2 −1 3 1 2𝑥1 − 𝑥2 + 3𝑥3 1
(9/2)𝑥2 − (5/2)𝑥3 = −3/2 −3
𝑨|𝑩 = 0 9/2 −5/2 อ −3/2 2𝑥1 − 𝑥2 + 3𝑥3 = 1 𝑥1 =
0 −2 5 2 (35/9)𝑥3 4/3 35
Sample Problems:
Solution:
2. Gauss Jordan Method
2 −1 3 𝑥1 1 4 9
𝑅3′
→ 𝑅3 + 𝑅2 𝑅2′
→ 𝑅2 + 𝑅3
1 4 −1 𝑥2 = −1 9 14
0 −2 5 𝑥3 2 2 −1 3 1 2 22/5 0 −4/5
𝑨𝒙 = 𝑩 𝑨|𝑩 = 0 9/2 −5/2 ቮ −3/2 𝑨|𝑩 = 0 9/2 0 ቮ −9/14
2 −1 3 1 0 0 35/9 4/3 0 0 35/9 4/3
𝑨|𝑩 = 1 4 −1 อ −1 6 44
′ ′
0 −2 5 2 𝑅1 → 𝑅1 + 𝑅2 𝑅1 → 𝑅1 − 𝑅2
5 45
1
′
𝑅2 → 𝑅2 − 𝑅1 2 22/5 0 −4/5 2 0 0 −6/35
2 𝑨|𝑩 = 0 9/2 −5/2 ቮ −3/2
2 −1 3 1 𝑨|𝑩 = 0 9/2 0 ቮ −9/14
0 0 35/9 4/3 0 0 35/9 4/3
𝑨|𝑩 = 0 9/2 −5/2 อ −3/2
0 −2 5 2
Sample Problems:
Solution:
2. Gauss Jordan Method
12 9
2 0 0 𝑥1 −6/35 (35/9)𝑥3 = 4/3 𝑥3 = 𝑅2′
→ 𝑅2 + 𝑅3
0 9/2 0 𝑥2 = −9/14 35 14
0 0 35/9 𝑥3 4/3 2 −1 3 1 2 22/5 0 −4/5
2𝑥1 −6/35 𝑨|𝑩 = 0 9/2 −5/2 ቮ −3/2 𝑨|𝑩 = 0 9/2 0 ቮ −9/14
(9/2)𝑥2 = −9/14 0 0 35/9 4/3 0 0 35/9 4/3
(35/9)𝑥3 4/3 ′
6 ′
44
𝑅1 → 𝑅1 + 𝑅2 𝑅1 → 𝑅1 − 𝑅2
−3 5 45
2𝑥1 = −6/35 𝑥1 = 2 22/5 0 −4/5 2 0 0 −6/35
35
𝑨|𝑩 = 0 9/2 −5/2 ቮ −3/2 𝑨|𝑩 = 0 9/2 0 ቮ −9/14
−1 0 0 35/9 4/3 0 0 35/9 4/3
(9/2)𝑥2 = −9/14 𝑥2 =
7
Sample Problems:
Solution:
3. Inverse of a Matrix Method 𝑨 = 2 18 − −1 5 + 3 −2 = 35
2 −1 3 𝑥1 1 18/35 −1/35 −11/35
1 4 −1 𝑥2 = −1 1 18 −1 −11
𝑨−𝟏 = −5 10 5 = −5/35 10/35 5/35
0 −2 5 𝑥3 2 35
−2/35 4/35 9/35
−2 4 9
𝑨𝒙 = 𝑩
𝒙 = 𝑨−𝟏 𝑩 18/35 −1/35 −11/35 1 −3/35
−5/35 10/35 5/35 −1 = −1/7
−2/35 4/35 9/35 2 12/35
2 −1 3 18 5 −2 18 −5 −2 18 −1 −11 𝑥1 −3/35
1 4 −1 1 10 −4 −1 10 4 −5 10 5 𝑥2 = −1/7
0 −2 5 −11 −5 9 −11 5 9 −2 4 9 𝑥3 12/35

2 Matrix Algebra

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

2 Matrix Algebra

Transféré par

Droits d'auteur :

Formats disponibles

Technological Institute of the Philippines Prepared by: Engr. Adams Royce A.

Structural Matrix Analysis

Order of the matrix

Diagonal elements, the rest are

Not Commutative Distributive Associative

Adjoint Matrix- (𝑐𝑜𝑓𝑎𝑐𝑡𝑜𝑟 𝑚𝑎𝑡𝑟𝑖𝑥)𝑇

Adams’ Technique: since an upper triangular matrix has zero (0)

|𝑨| = 3 4 0 + 1 1 −5 + 1(2)(−1) − 1 4 −5 + 3 1 −1 + 1(2)(0) = 16

Two Major Methods for Solution

𝑎11 𝑎12 𝑎13 𝑐1 𝑎11 𝑎12 𝑎13 𝑥1 𝑐1

Adams’ Technique: since a lower triangular

Vous aimerez peut-être aussi