Professional Documents
Culture Documents
Remember this...
•In symmetric
matrices, the
elements above
the diagonal is
the mirror of the
Determinant of a Square Matrix
elements below The determinant of a square matrix A, denoted by |A|, is a
the diagonal. polynomial of the elements of a square matrix.
It is a scalar quantity.
It is the sum of certain products of the elements of the
matrix from which it is derived, each product being multiplied by +1 or -1
according to certain rules.
𝟐 × 𝟐 Matrix
𝑎 𝑎
If 𝐴 = 𝑎 𝑎 , then the determinant of A is denoted as
𝑎 𝑎
|𝐴| = 𝑎 𝑎 = 𝑎 𝑎 −𝑎 𝑎
𝟑 × 𝟑 Matrix
= −3
Minors
A submatrix multiplied to an element
Given an element amn , its minor (denoted by |Mmn|) is obtained by deleting the mth row
and the nth column.
The (+1) and (-1) factors in the expansion are decided according to the following rule:
If A is written in the form A = (amn), the product of amn and its minor in the expansion
of determinant |A| is multiplied by (–1)m+n.
On the given example matrix, 1 is the element 𝑎 , therefore multiplied with
(−1) = 1. Its minor is obtained by eliminating the row and column to which the
element 1 belong.
Cofactor
the minor multiplied with the +1 or −1 factor
5 6
Example: (+1)
8 9
Inverse Matrix
The inverse of a square matrix A is a matrix whose product with A is the identity matrix
Ior simply 𝑨𝑨 𝟏 = 𝑰.
It is denoted by 𝐴 and is unique for a given matrix A.
Adjugate / Adjoint
denoted by adj(A)
obtained by replacing the elements in A by their cofactors and then transposing it.
1
𝐴 = 𝑎𝑑𝑗(𝐴)
|𝐴|
The determinant of A is
2 5
det(𝐴) = = 18 − 15 = 3
3 9
Solving for the cofactors,
Therefore,
9 −3
𝐴=
−5 2
Then transposing to get the adjoint,
9 −5
𝑎𝑑𝑗(𝐴) =
Remember this...
−3 2
•Inverse can
So the inverse is, exist only in a
square matrix
1 9 −5 and if the
𝐴 = determinant is
3 −3 2
nonzero.
5
3 −
𝐴 = 3
2
−1 −
3
Singular Matrix
the matrix Ais said to be singular if any of the following equivalent conditions exists:
|𝐴| = 0
If a particular row (column) can be formed as a linear combination of the other
rows (columns)
𝑟(𝐴) < 𝑛
𝐴 𝑥+𝐵 𝑦+𝐶 𝑧 = 𝐾
𝐴 𝑥+𝐵 𝑦+𝐶 𝑧=𝐾
𝐴 𝑥+𝐵 𝑦+𝐶 𝑧=𝐾
𝐾 𝐵 𝐶 𝐴 𝐾 𝐶 𝐴 𝐵 𝐾
𝐾 𝐵 𝐶 𝐴 𝐾 𝐶 𝐴 𝐵 𝐾
|𝐷 | 𝐾 𝐵 𝐶 𝐷 𝐴 𝐾 𝐶 |𝐷 | 𝐴 𝐵 𝐾
𝑥= = 𝑦= = 𝑧= =
|𝐷| 𝐴 𝐵 𝐶 |𝐷| 𝐴 𝐵 𝐶 |𝐷| 𝐴 𝐵 𝐶
𝐴 𝐵 𝐶 𝐴 𝐵 𝐶 𝐴 𝐵 𝐶
𝐴 𝐵 𝐶 𝐴 𝐵 𝐶 𝐴 𝐵 𝐶
Form a matrix using the coefficients on the left side of the equations. The determinant is
0.3 0.52 1
𝑑𝑒𝑡 = 0.5 1 1.9 = −0.0022
0.1 0.3 0.5
Solving for x, on the numerator, replace the coefficients of xby the constants k,
−0.01 0.52 1
0.67 1 1.9
−0.44 0.3 0.5 0.03278
𝑥= = = −14.9
−0.0022 −0.0022
Solving for y, on the numerator, replace the coefficients of y by the constants k,
0.3 −0.01 1
0.5 0.67 1.9
0.0649
𝑦 = 0.1 −0.44 0.5 = = −29.5
−0.0022 −0.0022
1
|2 6| ⟶ |1 3|
2
Then,
1 3
5 −2
Step 3. Add a multiple of a row to another row. 𝒌𝑹𝟏 + 𝑹𝟐 ⟶ 𝑹𝟐
𝑘𝑅 + 𝑅 ⟶ 𝑅
−2|1 3 2| + |2 1 4| ⟶ |0 −5 0|
𝑘𝑅 + 𝑅 ⟶ 𝑅
−3|1 3 2| + |3 −1 6| ⟶ |0 −10 0|
Therefore,
1 3 2
= 0 −5 0
0 −10 0
1 3 2
= 0 1 0
0 −10 0
Step 4. Make other elements on column 2 equal to 0,
𝑘𝑅 + 𝑅 ⟶ 𝑅
−3|0 1 0| + |1 3 2| ⟶ |1 0 2|
𝑘𝑅 + 𝑅 ⟶ 𝑅
−10|0 1 0| + |0 −10 0| ⟶ |0 0 0|
Therefore, the reduced row-echelon form of the matrix is,
1 0 2
= 0 1 0
0 0 0
V. Gauss-Jordan Elimination
Another method of solving system of linear equations through matrices. Unlike Cramer’s
rule, Gauss-Jordan Elimination is extended to large sets of equations.
This method is variant of the Gaussian Elimination method, but unlike the method of
eliminating the unknowns and back-substitute, Gauss-Jordan Eliminationutilizes a systematic
process of row operations to convert the matrix into a reduced row-echelon form. Similarly, the
matrix is augmented with another column for the constant values.
4𝑥 + 𝑦 − 𝑧 = −2
5𝑥 + 𝑦 + 2𝑧 = 4
6𝑥 + 𝑦 + 𝑧 = 6
SOLUTION:
Step 1. Generate the augmented matrix using the coefficients and constants.
4 1 −1 −2
5 1 2 4
6 1 1 6
Step 2. Normalize the first row by making element 4 equal to 1.
𝑘𝑅 ⟶ 𝑅
Using 𝑘 = ,
1
|4 1 −1 −2| ⟶ |1 0.25 −0.25 −0.5|
4
Then,
1 0.25 −0.25 −0.5
5 1 2 4
6 1 1 6
Step 3.Make other elements on column 1 equal to 0.
𝑘𝑅 + 𝑅 ⟶ 𝑅
Using 𝑘 = −5 to make element 5 of row 2 equal to 0,
𝑘𝑅 + 𝑅 ⟶ 𝑅
Using 𝑘 = −6 to make element 6 of row 3 equal to 0,
𝑘𝑅 ⟶ 𝑅
Using 𝑘 = −4,
𝑘𝑅 + 𝑅 ⟶ 𝑅
Using 𝑘 = −0.25 to make element 0.25 of row 1 equal to 0,
𝑘𝑅 + 𝑅 ⟶ 𝑅
Using 𝑘 = 0.5 to make element −0.5 of row 3 equal to 0,
𝑘𝑅 ⟶ 𝑅
Using 𝑘 = − ,
1
− |0 0 −4 −4| ⟶ |0 0 1 1|
4
Then,
1 0 3 6
0 1 −13 −26
0 0 1 1
𝑘𝑅 + 𝑅 ⟶ 𝑅
Using 𝑘 = −3 to make element 3 of row 1 equal to 0,
−3|0 0 1 1| + |1 0 3 6| ⟶ |1 0 0 3|
𝑘𝑅 + 𝑅 ⟶ 𝑅
Using 𝑘 = 13 to make element −13 of row 2 equal to 0,
x y z k
𝑥=3
𝑦 = −13
𝑧=1