UPHSD - CALAMBA

MIDTERM LECTURE PRESENTATION

Numerical Methods
ECE Dept.
Prepared by; Engr. Edison M. Bengco, PECE, MEP-ECE
09258468709/edbengs71@gmail.com

1
 Applications of Matrices
7.8 and Determinants

Copyright © Cengage Learning. All rights reserved.

2
What You Should Learn
• Use determinants to find areas of triangles.

• Use determinants to decide whether points are

collinear.

• Use Cramer’s Rule to solve systems of linear

equations.

• Use matrices to encode and decode messages.

3
Area of a Triangle

4
Area of a Triangle
In this section, you will study some additional applications
of matrices and determinants.

The first involves a formula for finding the area of a triangle

whose vertices are given by three points on a rectangular
coordinate system.

5
Example 1 – Finding the Area of a Triangle

Find the area of the triangle whose vertices are (1, 0),
(2, 2), and (4, 3) as shown in Figure 7.28.

Figure 7.28

6
Example 1 – Solution
Begin by letting (x1, y1) = (1, 0),
(x2, y2) = (2, 2), and
(x3, y3) = (4, 3).

Then, to find the area of the triangle, evaluate the

determinant.

= 1(–1)2 + 0(–1)3 + 1 (–1)4

7
Example 1 – Solution cont’d

= 1(–1) + 0 + 1(–2)

= –3

Using this value, you can conclude that the area of the
triangle is

Area

(–3)

square units.
8
Collinear Points

9
Collinear Points
What if the three points in Example 1 had been on the
same line?

What would have happened had the area formula been

applied to three such points? The answer is that the
determinant would have been zero.

Consider, for instance, the three

collinear points (0, 1), (2, 2) and
(4, 3) as shown in Figure 7.29.

Figure 7.29

10
Example 2 – Testing for Collinear Points

Determine whether the points

(–2, –2), (1, 1), and (7, 5)
are collinear. (See Figure 7.30.)

Figure 7.30
11
Example 2 – Solution
Begin by letting (x1, y1) = (–2, –2),
(x2, y2) = (1, 1), and
(x3, y3) = (7, 5).

12
Example 2 – Solution cont’d

= –2(–4) + 2(–6) + 1(–2)

= –6.

Because the value of this determinant is not zero, you can

conclude that the three points are not collinear.

13
Cryptography

14
Cryptography
A cryptogram is a message written according to a secret
code. (The Greek word kryptos means “hidden.”)

Matrix multiplication can be used to encode and decode

messages.

15
Cryptography
To begin, you need to assign a number to each letter in the
alphabet (with 0 assigned to a blank space), as follows.

16
Cryptography
Then the message is converted to numbers and partitioned
into uncoded row matrices, each having n entries, as
demonstrated in Example 6.

17
Example 6 – Forming Uncoded Row Matrices

Write the uncoded row matrices of dimension 1  3 for the

message
MEET ME MONDAY.
Solution:
Partitioning the message (including blank spaces, but
ignoring punctuation) into groups of three produces the
following uncoded row matrices.

Note that a blank space is used to fill out the last uncoded
row matrix.
18
Cryptography
To encode a message, choose an n  n invertible matrix
such as

and multiply the uncoded row matrices by A (on the right)

to obtain coded row matrices. Here is an example.

19
 USING MATRICES IN REAL LIFE

Black neck stilts are birds that live throughout Florida and
surrounding areas but breed mostly in the triangular region
shown on the map. Use a determinant to estimate the area of
this region. The coordinates given are measured in miles.

N
. (35,220)

. (112,56)

W
. E
(0,0)

S 20
USING Gauss-Jordan Elimination Method
Gauss-Jordan Elimination Method 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. • Interchange any two
rows. • Multiply each element of a row by a nonzero constant.
• Replace a row by the sum of itself and a constant multiple of
another row of the matrix.
For these row operations, we will use the following notations. • Ri
↔ Rj means: Interchange row i and row j. • αRi means: Replace
row i with α times row i. • Ri + αRj means: Replace row i with the
sum of row i and α times row j. The Gauss-Jordan elimination
method to solve a system of linear equations is described in the

21
following steps. 1. Write the augmented matrix of the system. 2. Use
row operations to transform the augmented matrix in the form
described below, which is called the reduced row echelon form (RREF).
(a) The rows (if any) consisting entirely of zeros are grouped together at
the bottom of the matrix. (b) In each row that does not consist entirely
of zeros, the leftmost nonzero element is a 1 (called a leading 1 or a
pivot). (c) Each column that contains a leading 1 has zeros in all other
entries. (d) The leading 1 in any row is to the left of any leading 1’s in
the rows below it. 3. Stop process in step 2 if you obtain a row whose
elements are all zeros except the last one on the right. In that case, the
system is inconsistent and has no solutions. Otherwise, finish step 2
and read the solutions of the system from the final matrix. Note: When
doing step 2, row operations can be performed in any order. Try to
choose row operations so that as few fractions as possible are carried
through the computation. This makes calculation easier when working
by hand. 1 Example 1. Solve the following system by using the Gauss-

22
Example 4. Solve the following system by using the Gauss-Jordan
elimination method. A + B + 2C = 1 2A − B + D = −2
A − B − C − 2D = 4 2A − B + 2C − D = 0
Solution: We will perform row operations on the augmented matrix
of the system until we obtain a

23
24
25
26
27
 USING Gauss-Jordan Elimination
Method
For these row operations, we will use the following notations. • Ri ↔ Rj means: Interchange row i and row j. • αRi means:
Replace row i with α times row i. • Ri + αRj means: Replace row i with the sum of row i and α times row j.

28
29
30
31
32
33
34
 USING Gauss-Jordan Elimination
Method
For these row operations, we will use the following notations. • Ri ↔ Rj means: Interchange row i and row j. • αRi means:
Replace row i with α times row i. • Ri + αRj means: Replace row i with the sum of row i and α times row j.

35
36
37
38
39
40
41