Professional Documents
Culture Documents
Module V (PPT) 1
Module V (PPT) 1
Vinayak Sawant
Definition of matrix
addition, multiplication and transpose of a matrix
Row/column matrix
Square matrix, Diagonal matrix, Scalar matrix
Trace of a matrix, Determinant of a matrix
Singular matrix, Non-singular matrix
Zero or Null matrix, Unit or Identity matrix
Upper triangular matrix, Lower triangular matrix
Every square matrix can be uniquely expressed as sum of Hermitian matrix and a
skew-Hermitian matrix [A = P + Q = 12 (A + Aθ ) + 21 (A − Aθ )]
Every square matrix A can be uniquely expressed as P + iQ where P = 12 (A + Aθ )
1
and Q = 2i (A − Aθ ) are Hermitian matrices.
Every Hermitian matrix A can be written as B + iC , where B = 12 (A + Ā) real
1
symmetric and C = 2i (A − Ā) is real skew-symmetric matrix.
Every Skew-Hermitian matrix A can be written as B + iC where, B = 12 (A + Ā) is
1
real skew-symmetric and C = 2i (A − Ā) is real symmetric matrix.
Definition:
A square matrix A is called unitary if the product of A and its transpose of conjugate i.e.
Aθ is a unit matrix.
OR
A is unitary if AAθ = Aθ A = I
For an unitary matrix A−1 = Aθ .
1 If a11 is zero, use the row operation Rij and bring the first element in the first row
non-zero.
2 If now the first element in the first row is not unity divide the first row by suitable
number, so that the first element is unity.
3 Using suitable values of k and by substracting k-th times the first row from the
remaining rows,reduce all the first elements in the remaining rows to zero.
4 Repeat this procedure for other rows, so that the matrix A is reduced to echelon form.
The rank of a matrix in echelon form is equal to the number of rows containing non-zero
elements.
1 If a11 ̸= 1 interchange suitably, two rows or two columns such that first element is 1.
If this is not possible divide the first row or the first column by a11 so that the first
element is 1.
2 By performing operations of the type R2 + kR1 , C2 + kC1 etc. bring zero everywhere
in the first row and first column.
3 Repeat the above two operations now on each of the remaining rows by using the first
row.
If A is a matrix of rank r, then there exist non-singular matrices P and Q such that P AQ
is in normal form
i.e.
Ir 0
= P AQ
0 0
1 If a set of vectors is linearly dependent then at least one member can be expressed as
a linear combination of the remaining vectors.
2 If a set of vectors is linearly independent then no member of the set can be expressed
as a linear combination of the other members.
If the matrix of coefficients is denoted by A, the matrix of unknowns by X and the matrix
of the constants on the right hand side by B then the equations can be written in matrix
form as
a11 a12 . . . a1n x1 b1
a21 a22 . . . a2n x2 b2
. . . . . . . . . . . . . . . = . . .
. . . . . . . . . . . . . . . . . .
am1 am2 . . . amn xn bm
i.e. AX = B
The matrix [A, B] i.e. the matrix formed by the coefficients and the constants is called the
augmented matrix.
Thus, the matrix of the coefficient and the augmented matrix are:
a11 a12 . . . a1n a11 a12 . . . a1n b1
a21 a22 . . . a2n a21 a22 . . . a2n b2
A= . . . . . . . . . . . . , [A, B] = . . . . . . . . . . . . . . .
... ... ... ... . . . . . . . . . . . . . . .
am1 am2 . . . amn am1 am2 . . . amn bm
If the system has a solution set, i.e., if we able to solve the equations and get s1 , s2 , ..., sn ,
then the set is called consistent otherwise it is called inconsistent.
1 Write the given system of m linear equations in n unknowns in the matrix form
AX = B.
2 Apply row transformations on A as well as on the column matrix B till you get an
echelon form.
3 Then rewrite the equations as a set of linear equations.
4 Determine rank of A and the rank of augmented matrix [A, B].
Further,
(a) If r = n, i.e. if the rank of A is equal to the number of unknowns, the system has
unique solution.
(b) If r < n, if the rank of A is less than the number of unknowns the system has
infinite solutions.
In this case n − r unknowns called parameters can be assigned arbitrary values. The
remaining unknowns then can be expressed in terms of these parameters.
1 Write the given system of m linear equations in n unknowns in the matrix form
AX = O.
2 Apply row transformations only and reduce the coefficient matrix A to echelon form.
3 Then rewrite the equations as a set of linear equations.
4 If r = n i.e. the rank of matrix A is equal to the number of unknowns then only
trivial(zero) solution is the possible solution.
5 If r < n i.e. the rank of the matrix A is less than the number of unknowns then the
system has non-trivial solutions.
The number of independent solutions i.e. the number of parameters= n − r.