Matrices and Its Application
Matrices and Its Application
COLUMN SQUARE
ROW MATRIX
MATRIX MATRIX
• Matrix with one row • Matrix with one • Matrix having equal
column rows and columns
•
Example - • Example- • Example-
DIAGONAL UNIT NULL
MATRIX MATRIX MATRIX
• Square matrix all of whose • Diagonal matrix which • Matrix with all elements
elements except those in leading
diagonal are zero. has unity for all its as zero.
• Example- diagonal elements. • Example-
• Example-
TRANSPOSE SYMMETRIC SKEW
SYMMETRIC
OF MATRIX MATRIX MATRIX
• Obtained by • Matrix is symmetric if • Matrix is skew
interchanging rows A=A` symmetric if A=-A`
and columns of matrix • Example- • Example-
• If A= Then A`=
COMPLEX MATRICES
• CONJUGATE OF 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.(Ā)
• HERMITIAN MATRIX. A square matrix A such that A`=Ā is said to be
Hermitian matrix.
• SKEW HERMITIAN MATRIX. A square matrix A such that A`=- Ā is
said to be skew Hermitian matrix.
• UNITARY MATRIX. A square matrix U such that Ū`=U-1 is called unitary
matrix
ADJOINT OF A MATRIX INVERSE OF A MATRIX
Adjoint of a matrix A is the transposed If A be any matrix ,then a matrix B if
matrix of cofactors of A, exists , such that AB=BA=I , is called
Example-if A= then Adj.A= Inverse of A
Denoted as A-1
A-1= Adj.A/
• RANK OF A MATRIX • NORMAL FORM OF A MATRIX
A matrix is said to be of rank r Every non zero matrix of rank r , can
when be reduced by a sequence of
elementary transformations , to the
1. It has at least one non zero minor of
order r
form called the Normal form of
matrix,
2. And every minor of order higher than r
vanishes.
Rank of any matrix A is denoted as
р(A).
SYSTEM OF LINEAR EQUATIONS AND
RANK OF MATRIX
• Consider a system of m linear equations containing n unknowns. A is
coefficient matrix and K is called Augmented
matrix.
A= K=
• 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).
EIGEN VALUES
• 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 a
equation called characteristics equation.
• 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.
PROPERTIES OF EIGEN VALUES
Any square matrix A and its transpose matrix A` have same eigen values.
The eigen values of a triangular matrix are just the diagonal elements of matrix.
The eigen values of a diagonal matrix are just diagonal elements of the matrix.
The sum of the eigen values of a matrix is its trace i.e. the sum of its principal
diagonal elements.
The product of eigen values of matrix is equal to its determinant.
If λ is an eigen value of a matrix A, then 1/λ is the eigen value of A-1.
If λ is eigen value of an orthogonal matrix ,then 1/λ is also its eigen value
If λ1,λ2,…,λn are eigen values of a matrix A, the Am has eigen values λ1m ,λ2m ,…..,λnm.
REDUCTION TO DIAGONAL FORM