MA-101 (MATHEMATICS-1)
APPLICATION OF MATRICES
A PROJECT REPORT
SUBMITTED IN COMPLETE FULFILLMENT OF THE REQUIREMENTS FOR THE AWARD OF THE DEGREE OF
BACHELOR OF TECHNOLOGY
Submitted by :
KRISHU GUPTA
(2K20/B16/15)
DHRUV SINGHAL
(2K20/B16/16/12)
Under the supervision of :
DR. NILAM RATHI
DELHI TECHNOLOGICAL UNIVERSITY
(FORMERLY Delhi College Of Engineering)
Bawana Road , Delhi – 110042
CANDIDATE’S DECLARATION
We (Krishu Gupta, 2K20/B16/15 and Dhruv Singhal, 2K20/B16/12), students of B. Tech
hereby declare that the project titled APPLICATION OF MATRICES which is submitted by us
to the Department of Mathematics, Delhi Technological University, Delhi in partial fulfilment of
the requirement for the award of the degree of Bachelor of Technology, is original and not copied
from any source without proper citation. This work has not previously formed the basis for the
award of any Degree, Diploma Associateship, Fellowship or other similar titles or recognition.
PLACE: Delhi Krishu Gupta (2K20/B16/15)
DATE: 7th July 2021 Dhruv Singhal (2K20/B16/12)
CERTIFICATE
I hereby certify that the Project Dissertation title APPLICATION OF MATRICES which is submitted
by Krishu Gupta (2K20/B16/15) and Dhruv Singhal (2K20/B16/12), Delhi Technological University,
Delhi in complete fulfilment of the requirement for the award of the Degree of Bachelor of
Technology, is a record of the project work carried out by the students under my supervision. To the
best of my knowledge this work has not been submitted in part or full for any Degree or Diploma to
this University or elsewhere.
PLACE: Delhi
SUPERVISOR
DR. NILAM RATHI
DATE: 7th July 2021
ACKNOWLEDGEMENT
In performing this project of ours, we had to take the help and guidance of some respected people,
who deserve our greatest gratitude. The completion of this assignment gives us much pleasure. We
would like to show our gratitude to DR.NILAM RATHI, mentor for our project. Giving us
consistent guidance for our report throughout numerous consultations. We would also like to extend
our deepest gratitude to all those who have directly or indirectly guided us in writing this project.
Many individuals, especially our classmates and team members themselves have made valuable
comment suggestions on this proposal which gave us the inspiration to improve our project. We
thank everyone for their help directly or indirectly in completing our project.
In addition, we would like to thank the Department of Mathematics, Delhi Technological
University,Delhi for giving us the opportunity to work on this topic.
ABSTRACT
Matrices are one of the most powerful tools in mathematics. Matrices are back bone of computer
graphics, computer science and robotics. In the report ‘Matrices and its Application’ the application of
matrices in human life can easily be expressed by the basic concepts of matrices such as, Rank of a
matrix, Inverse of matrix, Eigen-Values and Eigen-Vectors, Matrix multiplication and Determinant of
Matrix.
CONTENTS
Title Page
Candidate’s Declaration
Certificate
Acknowledgement
Abstract
Contents
Introduction
Theory
Applications
Conclusion
References
INTRODUCTION
This report consists of two parts, first we discuss the basic concepts of matrices such as the different
types matrices and their properties, the system of linear equations and their consistency, Elementary
Row operations and how to convert it to the Echelon form, Rank of a matrix, Eigenvalues and
Eigenvectors of Matrix and Diagonalization of a Matrix. Second we will talk about the applications of
Matrices in different parts of our life and history, how people used it in Economics, Encoding-
Decoding, Computer Graphics and Mathematical Molding.
THEORY
DEFINITION OF MATRIX
A matrix is a rectangular array of numbers (or functions) enclosed in brackets. These numbers function are called
entries or elements of the matrix. A matrix can be denoted by capital boldface letters A, B, C and so on or by writing
the general entry in brackets; thus A=[ajk ], and so on. By an 𝑚 × 𝑛 matrix, we mean a matrix with m rows and n
columns. Thus an 𝑚 × 𝑛 matrix is of the form
𝑎11 𝑎12 𝑎13
A = [𝑎𝑗𝑘 ] = [𝑎21 𝑎22 𝑎23 ]
𝑎31 𝑎32 𝑎33
TYPES OF MATRIX
Row Matrix: Matrix with one row, Example:[−2 6 4]
2
Column Matrix: Matrix with one column, Example: [6]
9
3 1
Square Matrix: Matrix having equal rows and columns, Example [ ]
5 8
Diagonal Matrix: In a diagonal matrix, all the elements above and below the diagonal are zero, Example
1 0 0
[ 0 2 0]
0 0 4
1 0 0
Unit Matrix: A diagonal matrix in which all the elements of the diagonal are 1, Example : [0 1 0]
0 0 1
0 0
Null Matrix: A matrix with all elements zero, Example: [ ]
0 0
Singular Matrix: A matrix with no inverse
Idempotent Matrix: A matrix where A2=A
1 1 −1
Symmetric Matrix: A matrix where A=AT, Example: [ 1 2 0 ]
−1 0 5
0 1 −2
Skew-Symmetric Matrix: A matrix where A=-A , Example: [1 0
T
3]
2 −3 0
Conjugate Matrix: If the elements of a matrix are complex numbers then matrix formed by replacing these
complex numbers by their conjugate is CONJUGATE of given matrix (𝐴) ̅̅̅.
̅̅̅ is said to be Hermitian Matrix, Example [ 2
Hermitian Matrix: A square matrix such that AT = (𝐴)
2−𝑖
]
2+𝑖 4
Skew-Hermitian Matrix: A square matrix such that AT = -(𝐴) ̅̅̅ is said to be Hermitian Matrix, Example
3𝑖 2+𝑖
[ ]
−2 + 𝑖 −𝑖
Inverse of a Matrix
If A is a non-singular matrix that is |𝐴| ≠ 0 then A-1 exists. Therefore,
AX=B
A-1(AX)=A-1 B
(A-1 A)X=A-1 B
IX=A-1 B
X=A-1 B
System of Linear Equations
• Consider a system of m linear equations containing n unknowns. A is coefficient matrix and K is called
augmented matrix.
A= K=
This system can be given as AX=k
Note: If k=0, then this system is call a homogenous system and if k≠0 then the above system is called a non-
homogenous system.
Consistency of a System of Linear Equations:
Let p(A) and p(K) denotes the rank of matrix A and K respectively . Then p(A)≤p(K).
If p(A)<p(K),then system of equation has no solution(i.e. system is inconsistent).
If p(A) = p(K) = number of unknowns, then system has unique solution (and hence is consistent).
If p(A) = p(K) < number of unknowns ,then the system has infinitely many solutions (and so is consistent).
Elementary Row Operations
Interchanging of any two rows (Ri↔Rj)
Multiplication of any row by a non-zero scalar (Ri↔xRi)
Adding/Subtracting a scalar multiple of any row to another row (Ri↔Ri +xRj)
Note: These operations change the form of matrix but not it’s Rank
Type equation here.
Echelon Form:
In linear algebra, a matrix is in echelon form if it has the shape resulting from a Gaussian Elimination.
A matrix being in row echelon form means that Gaussian elimination has operated on the rows, and column echelon
form means that Gaussian elimination has operated on the columns.
A matrix is in row echelon form if the following conditions are met.
1. If the ith row contains all zeroes and is true for all the subsequent rows
2. If a column contains first non-zero entry of any row, then every subsequent entry in the column is zero.
3. Rows containing all zeroes occur only after all non-zero rows.
Rank: The number of non-zero rows in the Echelon form of the matrix.
1 3 5 1 3 5 𝑅 → 𝑅 − 2𝑅 1 3 5
2 2 1
Example: A =[ 2 −1 4] ~ [0 −7 −6] { ~[0 −7 −6] 𝑅3 → 𝑅3 + 2𝑅2
𝑅3 → 𝑅3 + 2𝑅1
−2 8 2 0 14 12 0 0 0
Rank of A = Number of non-zero rows in the Echelon form of A = 2
Eigen-Values and Eigen-Vectors
If A is any square matrix of order n, we can form a matrix A-λI, where I is unit matrix. Then determinant of this
matrix equated to zero gives an equation called characteristics equation.
|𝐴 − 𝜆𝐼| = 0
• The roots of this equation are called Eigen values or latent roots or characteristic roots of matrix A.
• Corresponding to each Eigen value there exist an Eigen vector.
Diagonalization of a Matrix
A matrix A is called diagonalizable if it is similar to a diagonal matrix D i.e. if there exists an invertible matrix P such
that A=PDP-1
Since similar matrices have the same eigenvalues therefore eigenvalues of A and D are same, diagonal entries of D are
the eigenvalues of A and if the Eigen-Vector of A is x then Eigen-Vector of D is P-1x.
Real Life Applications Matrices
COMPUTER GRAPHICS
Earlier architecture, cartoon, automation were done by hand drawings but nowadays they are done by using
computer graphics. In video gaming industry matrices are major mathematical tool to construct and manipulate a
realistic animation of a polygonal figure. Computer graphics software uses matrices to process linear transformations
to translate images. For this purpose square matrices are very easily represent linear transformation of objects.
Matrices are used to project three dimensional images into two dimensional planes. In Graphics, digital image is
treated as a matrix to be start with. The rows and columns of matrix correspond to rows and columns of pixels and
the numerical entries correspond to the pixels’ color values. Using matrices to manipulate a point is common
mathematical approach in video game graphics
CRYPTOGRAPHY
To use matrices in encoding and decoding secret messages, our procedure is as follows.
We first convert the secret message into a string of numbers by arbitrarily assigning a number to each letter of the
message. Next we convert this string of numbers into a new set of numbers by multiplying the string by a square
matrix of our choice that has an inverse. This new set of numbers represents the coded message.
To decode the message, we take the string of coded numbers and multiply it by the inverse of the matrix to get the
original string of numbers. Finally, by associating the numbers with their corresponding letters, we obtain the original
message.
Example:
1 1 −1
Using the matrix B = [1 0 1 ] encode the message: ATTACK NOW!
2 1 1
We divide the letters of the message into groups of three.
ATT ACK -NO W- -
Note that since the single letter "W" was left over on the end, we added two spaces to make it into a triplet.
Now we assign the numbers their corresponding letters from the table, and convert each triplet of numbers
into 3×1matrices. We get
𝐴 1 𝐴 1 _ 27 𝑊 23
[𝑇 ] = [20] , [ 𝐶 ] = [ 3 ] , [𝑁] = [14] , [ _ ] = [27]
𝑇 20 𝐾 11 𝑂 15 _ 27
So far we have,
1 1 27 23
[20] [ 3 ] [14] [27]
20 11 15 27
We multiply, on the left, each matrix of our message by the matrix B. For example,
1 1 −1 1 1
[1 0 1 ] [20] = [21]
2 1 1 20 42
By multiplying each of the matrices in (III) by the matrix B, we get the desired coded message as follows:
1 −7 26 23
[21] [ 12 ] [42] [ 50 ]
42 16 83 100
If we need to decode this message, we simply multiply the coded message by B-1, and associate the numbers with the
corresponding letters of the alphabet.
Matrices in Physics
Matrices are used in science of optics to account for reflection and for refraction. Matrices are also useful in electrical
circuits and quantum mechanics and resister conversion of electrical energy. Especially in solving the problems using
Kirchoff’s laws of voltage and current, the matrices are essential
Matrices in Economics
Matrix Cramer’s Rule and determinants are simple and important tools for solving many problems in business and
economics related to maximize profit and minimize loss. Matrices are used to find variance and co- variance. Matrix
Cramer’s Rule is used to find solutions of linear equations with the help of matrix determinant. The equilibrium of
markets in IS-LM model is solved by using determinants and Matrix Cramer’s Rule.
Google’s PageRank (Search Engine) using Eigenvalues and Eigenvectors
Google's extraordinary success as a search engine was due to their clever use of eigenvalues and eigenvectors.
Let us consider a 6-page we can form a "link matrix" representing the relative importance of the links in and out of
each page.
Considering Page 1, it has 4 outgoing links (to pages 2, 4, 5, and 6). So in the first column of our "links matrix", we
1 1
place value in each of rows 2, 4, 5 and 6, since each link is worth of all the outgoing links. The rest of the rows in
4 4
column 1 have value 0, since Page 1 doesn't link to any of them. We continue to do the same process for the other 6
webpages.
1
0 0 0 0 0
2
1
0 0 0 0 0
4
1
0 0 0 0 0
2
A= 1 1 1
0 0 0
4 2 2
1
0 1 1 0 1
4
1
[4 0 0 0 0 0]
Next, to find the eigenvalues.
We have,
1
−𝜆 0 0 0 0
2
1
−𝜆 0 0 0 0
4
1
0 −𝜆 0 0 0 5𝜆4 𝜆3 𝜆2
2
|𝐴 − 𝜆𝐼| = 1 1 1 Which gives 𝜆6 − − − = 0.
8 4 8
0 −𝜆 0
4 2 2
1
0 1 1 −𝜆 1
4
1
[ 0 0 0 0 −𝜆]
4
The only non-negative real value of λ is 1. So with λ=1 we find out the Eigenvector, which is
[4 1 0.5 5.5 8 1]. As Page 5 has the highest PageRank (8 in the above vector), we conclude it is the most
"important", and it will appear at the top of the search results.
CONCLUSION
There are numerous applications of matrices, both in mathematics and other sciences. Some of them merely take
advantage of the compact representation of a set of numbers in a matrix. For example, in game theory and
economics, the payoff matrix encodes the payoff for two players, depending on which out of a given (finite) set of
alternatives the players choose. In addition theoretical knowledge of properties of matrices and their relation to other
fields, it is important for practical purposes to perform matrix calculations effectively and precisely. Many problems
can be solved by both direct algorithms and iterative approaches. For example, finding eigenvectors can be done by
finding a sequence of vectors xn converging to an eigenvector when n tends to infinity. Even matrices are very ancient
mathematical concept but it has many applications in our life.
REFERENCES
https://ijsea.com/archive/volume8/volume8issue10.pdf
file:///C:/Users/dhruv/Downloads/215804533-Matrices-and-Its-Application.pdf
https://math.libretexts.org/Bookshelves/Applied_Mathematics/Applied_Finite_Mathematics_(
Sekhon_and_Bloom)/02%3A_Matrices/2.05%3A_Application_of_Matrices_in_Cryptography
http://aak.slu.cz/pdfs/aak/2011/03/14.pdf
Ting Yip; Matrices in Computer Graphics, Math, 308A, 12/3/2001
http://math.bme.hu/~petz/matrixPD.pdf
https://www.intmath.com/matrices-determinants/8-applications-eigenvalues-eigenvectors.php
http://ijetsr.com/images/short_pdf/1510557148_284-288-ietep1001_ijetsr.pdf