3.

1 Introduction to Matrix Application and LU- Factorization

In this module the most efficient and modern algorithms for solving linear systems Ax= b is the LU
-factorization, in which the square matrix is expressed as a product, A= LU. In this product, the square
matrix is lower triangular, which means all the entries above the main diagonal are zero. The square matrix
is upper triangular, which means all the entries below the main diagonal are zero.

Now, you can click " Done" and then proceed to the next page by clicking "Next" for the
discussions of topics
3.2 Applications of Matrix
Operations

Hi everyone are you familiar with Crytography, well in this module you will be able to
learn that matrices can be used to decode and encode cryptic messages.

A cryptogram is a message written according to a secret code (the Greek

word kryptos means “hidden”). The following describes a method of using matrix
multiplication to encode and decode messages.

1. Use A–1 to decode the cryptograph. A =

11 21 64 112 25 50 53 91 39 69 7 13 82 145
Solution
To decode the message behind those numbers we must get first the inverse of matrix

A. By solving A–1 is and we group the number by two because our matrix is 2
x 2.
Therefore the message is “HAPPY_HOLIDAYS”

2. Use A–1 to decode the cryptograph. A =

47 71 48 52 108 124 42 66 49 42 73 66 –12 –63 –
120 35 75 85
Solution

Solving A–1 = and group the numbers into three

Therefore the message is “ AWW_THATS_SO_CUTE”

3. Encode the message “STAY_HOME” using the matrix A = .

Solution
To encode is to write the corresponding letters of the words in numbers and it follows
19 20 1 25 0 8 15 13 5, then multiply it by matrix A
Therefore the numbers are “75 138 76 127 24 40 54 95 5 10”

You may click the following link for additional information on cryptography
Matrix encryption by austincc.edu ( click me ) (Links to an external site.)
Application of cryptography by aix1.uattawa.ca ( click me ) (Links to an external site.)

Encoding and Decoding with Matrices

In this video discussed encoding and decoding with matrices.

Least Square Regression Line

Matrix form a linear regression model y = Ax + B the coefficient of the least square
regression line is given by the matrix equation
A = (XTX)–1(XTY)

4. Find the least regression line of (0, 0), (1, 1), and (2, 4)
solution
To find the least regression line is write first our matrix X and matrix Y. matrix X can be
done by writing “one” beside each element of x like this

X= notice the first column are all “one” beside each x element and Y =
solving XTX

XT X =
and taking its inverse

(XTX)–1 =
solving XTY

XT Y =
substitute on A = (XTX)–1(XTY)

then A equal to
the least regression line is y = 2x – 1/3
3.3 LU- Factorization
Good day everyone, you are now half way of your modules. Here you will be able to
learn the LU-factorization.

Elementary Matrix
An n x n matrix is called an elementary matrix if it can be obtained from the identity
matrix I by a single elementary row operation.
R E M A R K : The identity matrix In is elementary by this definition because it can be
obtained from itself by multiplying any one of its rows by 1.

Which of the following is an elementary matrix? For those that are, describe the
corresponding elementary row operation.

Solution

a. This matrix is elementary. It can be obtained by multiplying the second row of I3I3 by 3.
b. This matrix is not elementary because it is not square.
c. This matrix is not elementary because it was obtained by multiplying th. e third row
of I3I3 by 0 (row multiplication must be by a nonzero constant).
d. This matrix is elementary. It can be obtained by interchanging the second and third
rows of I3I3
e. This matrix is elementary. It can be obtained by multiplying the first row of I2I2 by 2
and adding the result to the second row.
 f. This matrix is not elementary because two elementary row operations are required to
obtain it from

Representing Elementary Row Operation

Let be the elementary matrix obtained by performing an elementary row operation on In .
If that same elementary row operation is performed on an m x n matrix then the resulting
matrix is given by the product EA.
Row Equivalence
Let A and B be matrices. Matrix B is row-equivalent to A if there exists a finite number
of elementary matrices E1, E2, E3….. Ek such that B= Ek, Ek-1,….. E2 E1
Elementary Matrices are Invertible
If E is an elementary matrix then E-1 exists and is an elementary matrix
Property of Invertible Matrices
A square matrix A is invertible if and only if it can be written as the product of
elementary matrices.
LU-Factorization
If the n x n matrix can be written as the product of a lower triangular matrix L and an
upper triangular matrix U, then A = LU is an LU-factorization of A
In general, if can be row reduced to an upper triangular matrix using only the row
operation of adding a multiple of one row to another row, then has an LU-
factorization.

Ek....E2E1A=UEk....E2E1A=U
A=E−11.E−12......E−1kUA=E1−1.E2−1......Ek−1U
A=LUA=LU

Solving System of Linear Equation Using LU-Factorization

The most efficient and modern algorithms for solving linear systems, Ax=b is the so-
called LU-factorization, in which the square matrix is expressed as a product ,A=LU. In
this product, the square matrix is lower triangular, which means all the entries above the
main diagonal are zero. The square matrix is upper triangular, which means all the entries
below the main diagonal are zero.
Steps:

1. Obtained an LU- Factorization of A

2. Let and solve for y by forward substitution
3. Solve for x using back-substitution

R E M A R K: The column matrix x is the solution of the original system because