The Islamia University of

Bahawalpur

Submitted By;

Name: Kashif Khan

Roll No: F21BELEN1M01013

Department: Electrical Engineering

Subject: Linear Algebra

 Submitted To; Hafiz. Engr. Dr. Zeeshan Ahmad
Arfeen

1)Rank of a Matrix by Row- Echelon Form

We can transform a given non-zero matrix to a

simplified form called a Row-echelon form, using the row

elementary operations. In this form, we may have rows all of whose
entries are zero. Such rows are called zero rows. A non-zero row is
one in which at least one of the elements is not zero.

For example, consider the following matrix.

A=[102001000]

Here R1 and R2 are non-zero rows.

R3 is a zero row.

A non-zero matrix A is said to be in a row-echelon form if:

(i) All zero rows of A occur below every non-zero row of A.

 (ii) The first non-zero element in any row I of A occurs in the
jth column of A, and then all other elements in the jth
column of A below the first non-zero element of row I are
zeros.

(iii) The first non-zero entry in the ith row of A lies to the left
of the first non-zero entry in ( I + 1)th row of A.

1.1)Matrix

matrix, a set of numbers arranged in rows and columns so as to form a

rectangular array. The numbers are called the elements, or entries, of the matrix.
Matrices have wide applications in engineering, physics, economics, and statistics as
well as in various branches of mathematics
If there are m rows and n columns, the matrix is said to be an “m by n” matrix, written
“m × n.” For example

1.2)Submatrix

A matrix obtained by deleting some of the rows and/or columns of a matrix is said
to be a submatrix of the given matrix.

1.3) Eigen Value

 Eigenvalues are the special set of scalar values that is associated with the set of
linear equations most probably in the matrix equations

Example

λ=2 is an eigenvalue of A of multiplicity equal to 2.

Eigen vector

The eigenvector is a vector that is associated with a set of linear equations. The
eigenvector of a matrix is also known as a latent vector, proper vector, or characteristic
vector.

How to find the eigenvalues and eigenvectors of a 2x2 matrix

1. Set up the characteristic equation, using |A − λI| = 0.

2. Solve the characteristic equation, giving us the eigenvalues (2 eigenvalues for a 2x2
system)
3. Substitute the eigenvalues into the two equations given by A − λI.

1.4 ) Null space of a matrix

The null space of a matrix , is the set of all solutions to the homogeneous equation
A x → = 0 → . It is denoted by N u l A . The zero vector is always in the null space of a
matrix.

Consistent System:

If both the lines intersect at a point, then there exists a unique solution to the
pair of linear equations. In such a case, the pair of linear equations is said to be
consistent.
Examples:

Let's take an example of consistent equations as x + y = 6 and x – y = 2 there is one

solution in common. Similarly, in the equations x + y = 12 and 3y = x there is also one
solution in common hence we can call them consistent equations.

What is a rank of the matrix?

The maximum number of its linearly independent columns (or rows ) of a matrix is
called the rank of a matrix. The rank of a matrix cannot exceed the number of its rows or
columns.

2)Consistent linear systems

A consistent linear system is a system of linear equations with at least one set
of values satisfying all equations.

Explanation:

A system of linear equations is said to be consistent if there is a solution which

satisfies all of the equations.

For example: X+y=1x+2y=5

Solution

X=−3y=4 And thus is consistent.

The system X+y=12x+2y=2

Has infinitely many solutions, as any (x,y) pair will work so long as y=−x+1. As
such, it is also a consistent system.However, the following system is not
consistent.
X+y=1x+y=2

1.5) Trivial solution

Trivial solutions are the solutions to some equations which have a simple structure.
They are of less importance but cannot be skipped due to the sake of completeness. In
other words, a simple solution to an equation is termed a trivial solution

1.6) Row reduced echelon form

A matrix is in reduced row-echelon form if it satisfies the following: In each row, the left-
most nonzero entry is 1 and the column that contains this 1 has all other entries equal to
0. This 1 is called a leading 1.

1.7) Vectors
A vector is an element in a vector space. It is a quantity that can describe both the
direction and magnitude of an element.

1.8) Vector Space

The vector space consists of vectors that may be added together and multiplied by
scalars.

Row Matrix:

A1 × n matrix is called a row vector while an n × 1 matrix is a column vector.

Example: [ 1 − 2 4 ]

1.9)Column Vector
In linear algebra, a column vector is a column of entries, for example, The set of all
row vectors with n entries forms an n-dimensional vector space; similarly, the set of all
column vectors with m entries forms an m-dimensional vector space.

1.10)Mapping:

An operation that associates each element of a given set (the domain) with one or more
elements of a second set (the range).

Types of Mapping:

General Reference (sometimes called planimetric maps)

Topographic Maps
.Thematic.
Navigation Charts.

Null matrix:

The matrix whose every element is zero is called a null or zero matrix and it is
denoted by 0.
For example, [00] is a zero matrix of order 1 × 2. [00] is a zero or null matrix of order 2
× 1.

1.11) diagonal matrix

A square matrix in which every element except the principal diagonal elements is
zero is called a Diagonal Matrix.

For example:
A square matrix D = [dij]n x n will be called a diagonal matrix if dij = 0,

1.12)Cooplaner matrixa :

A set of three or more distinct points are collinear if and only if, the matrix of the
coordinates of these vectors is of rank 1 or less.

1.13)Cofactor matrix

A Cofactor, in mathematics, is used to find the inverse of the matrix, adjoined. The
Cofactor is the number you get when you remove the column and row of a designated
element in a matrix, which is just a numerical grid in the form of rectangle or a square.

For examples:

For instance, if you eliminate the fourth column and the second row of the matrix, the
determinant of the matrix is M24. So co-factors are the number you get when you
eliminate the row and column of a designated element in a matrix, which is just a
grid in the form of a square or a rectangle

1.14)Hermitian Matrix

A Hermitian matrix is a matrix that is equal to its conjugate transpose.

Examples: A square matrix A = [aij]n × n such that A* = A, where A* is the conjugate

transpose of A; that is, if for every aij ∊ A, a i j ― = a i j. (1≤ i, j ≤ n), then A is called a
Hermitian Matrix.

Gaussian elimination method:

The Gaussian elimination method is known as the row reduction algorithm for
solving linear equations systems. It consists of a sequence of operations performed
on the corresponding matrix of coefficients.
Example 1: Solve this system: Multiplying the first equation by −3 and adding the
result to the second equation eliminates the variable x: This final equation, −5 y =
−5, immediately implies y = 1.

1.15)Transpose of matrix

The transpose of a matrix is found by interchanging its rows into columns or

columns into rows. The transpose of the matrix is denoted by using the letter “T”

Conjugate of matrix:

A conjugate matrix is a matrix obtained from a given matrix by taking the complex
conjugate of each element of.

How do you find the conjugate?

You find the complex conjugate simply by changing the sign of the imaginary part of
the complex number.

Example:
To find the complex conjugate of 4+7i we change the sign of the imaginary part. Thus
the complex conjugate of 4+7i is 4 - 7i.
Conjugate of a matrix
A conjugate matrix is a matrix obtained from a given matrix by taking the complex
conjugate of each element of.

How do you find the conjugate?

You find the complex conjugate simply by changing the sign of the imaginary part of the
complex number.

Example:

To find the complex conjugate of 4+7i we change the sign of the imaginary part. Thus the
complex conjugate of 4+7i is 4 – 7i.