0% found this document useful (0 votes)

121 views46 pages

Finding Rank of Matrices in Echelon Form

Q: How is the rank of a matrix determined, and what is its significance in linear algebra?

The rank of a matrix is determined by the number of non-zero rows in its echelon form. This is significant because it indicates the dimension of the vector space spanned by its rows or columns, providing information about the system's degree of independence and its ability to solve equations. For example, in Source 1, the given matrix has four non-zero rows, resulting in a rank of 4.

Q: Explain the significance of the Rayleigh’s power method in finding the largest eigenvalue and corresponding eigenvector of a matrix.

Rayleigh’s power method is significant in finding the largest eigenvalue and corresponding eigenvector of a matrix due to its iterative approximation capabilities. The method starts with an approximate vector and iteratively refines it, maximizing the Rayleigh quotient to converge toward the largest eigenvalue. For instance, in Source 4, six iterations yield a largest eigenvalue of 5.98 with vector (1 1 -1).

Q: What are the implications of having a consistent homogeneous system of linear equations with a rank equal to the number of variables?

A consistent homogeneous system of linear equations with a rank equal to the number of variables implies that the system has only the trivial solution. This means each variable's solution is zero, as shown in Source 1, where the rank of matrix A equals the number of variables (3), leading to solutions x=0, y=0, z=0.

Q: In systems of linear equations, why is consistency crucial for solving them?

Consistency is crucial in solving systems of linear equations as it assures at least one solution exists. An inconsistent system, where the rank of the augmented matrix exceeds that of the coefficient matrix, has no solutions. Source 3 elucidates systems with consistent ranks yielding unique or infinite solutions, depending on degree.

Q: How does the discrepancy between the rank of the coefficient matrix and the augmented matrix affect the solvability of a non-homogeneous system of linear equations?

A discrepancy between the rank of the coefficient matrix and the augmented matrix in a non-homogeneous system indicates inconsistency, meaning there are no solutions. In Source 3, with ranks differing (ρ(A)=2, ρ(A, B)=3), the system lacks solutions, highlighting the relationship between rank equality and solvability.

Q: What does it mean for a non-homogeneous system of linear equations when the ranks of the coefficient matrix and the augmented matrix are equal?

For a non-homogeneous system of linear equations, when the ranks of the coefficient matrix and the augmented matrix are equal, it indicates that the system is consistent and has at least one solution. In Source 3, the ranks match at 3, providing a unique solution: x=9/2, y=-1, z=-1/2.

Q: Why might it be advantageous to use multiple iterations in Rayleigh’s power method for determining eigenvalues?

Using multiple iterations in Rayleigh’s power method enhances accuracy and convergence by continuously refining estimates towards the maximum eigenvalue. Incremental improvements via iterations are evident in Source 5, where six iterations identify eigenvalue 8 efficiently, demonstrating precision gains through methodological repetition.

Q: What role does matrix rank play in determining the number of solutions for a system of linear equations?

Matrix rank determines the number of solutions by indicating the system's dimensional constraints. If the rank equals the number of variables, only a trivial solution exists for homogeneous systems or a unique solution for non-homogeneous ones with consistent systems. In Source 1, a rank equal to variable count implies a trivial solution in homogeneous systems.

Q: Discuss how performing row operations on a matrix affects its echelon form and rank.

Row operations transform a matrix towards echelon form without altering its rank, by preserving linear independence among rows. Thus, they simplify matrices for analysis, such as rank computation or system solvability determination. Source 1 details transformations resulting in echelon forms with consistent ranks, confirming system properties.

Q: What insight does the use of the initial eigenvector in Rayleigh’s power method provide in terms of convergence speed and accuracy for computing eigenvalues?

The choice of the initial eigenvector in Rayleigh’s power method affects convergence speed and accuracy when computing eigenvalues. A good choice aligns closely with the eigenvector corresponding to the largest eigenvalue for quicker convergence. In Source 4, using the sequence (1 0 0) ensured convergence to 5.98 across six iterations, showcasing efficient selection.

Module 5 covers the concept of the rank of a matrix, including definitions and properties related to Echelon form and elementary row operations. It provides examples of matrices and demonstrates how to find their rank through transformations, concluding that the rank is determined by the number of non-zero rows in Echelon form. The document also states that the rank remains unchanged by elementary transformations and provides specific cases where the rank is calculated as 2 or 3.

Uploaded by

dot1kks

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

121 views46 pages

Finding Rank of Matrices in Echelon Form

Uploaded by

dot1kks

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

Module 5

Linear Algebra

_________________________________________________________________________
5.1 Rank of a matrix
Introduction:
 Elementary row operations are 𝑅𝑖 → 𝑅𝑗 , 𝑅𝑖 → 𝑘𝑅𝑖 , 𝑅𝑖 → 𝑘1 𝑅𝑖 + 𝐾2 𝑅𝑗
 A non-zero matrix is in Echelon form if
(i) All the zero rows are below the non-zero rows.
(ii) The first non-zero element in each non-zero row lies to the right of the
non-zero element in any preceding row.
 In other words, For an Echelon form, all the elements below the first non-zero
element of each row should be zero.
 Example:
2 1 3 2 2 1 −1 3 4
2 3 1 0 4 1 2 3
(0 0 1 4 5 ) , (0 3 2 1 5 )
−4 −5 3 2) , ( 0 3 2) , (
0 0 5 2 0 0 0 0 0
0 0 2 1 3 0 0 0 3
0 0 0 0 0 0 0 0
are in Echelon form.
2 1 3 2 2 1 −1 3 4
2 3 1 0 4 1 2 3
(0 0 1 4 5 ) , (0 3 2 1 5)
−4 −5 3 2) , ( 0 3 2) , (
0 0 5 2 0 0 0 0 −2
0 3 2 1 3 0 −1 0 3
0 0 1 0 0 0 0 1
are not in Echelon form.
 Apply elementary row transformation successively to get the echelon form of the
given matrix.
 The rank of the matrix is the number of non-zero rows in the echelon form of the
matrix. 𝑅𝑎𝑛𝑘 𝑜𝑓 𝐴 = 𝜌(𝐴) = 𝑟.
 The rank of the matrix is not altered by elementary transformations.
Maths dept. Dr. HNNCE, Bengaluru-70
1
 A matrix and its transpose have the same rank.
 If A is a null matrix then 𝜌(𝐴) = 0.
 If A is a non-singular 𝑛 × 𝑛 matrix then 𝜌(𝐴) = 𝑛.

Find the rank of the following matrices by using elementary transformations:

𝟏 𝟐 𝟑
1. (𝟏 𝟒 𝟐)
𝟐 𝟔 𝟓
1 2 3
Let 𝐴 = (1 4 2)
2 6 5
𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1
1 2 3
~ (0 2 −1)
0 2 −1
𝑅3 → 𝑅3 − 𝑅1
1 2 3
~ (0 2 −1)
0 0 0
This is in echelon form. The number of non-zero rows is 2.
Therefore, the rank of the given matrix is 2.
𝟑 −𝟏 𝟐
2. (−𝟔 𝟐 𝟒)
−𝟑 𝟏 −𝟐

3 −1 2
Let 𝐴 = (−6 2 4)
−3 1 −2
𝑅2 → 𝑅2 + 2𝑅1 , 𝑅3 → 𝑅3 + 𝑅1
3 −1 2
~ (0 0 8)
0 0 0

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

Maths dept. Dr. HNNCE, Bengaluru-70

2
𝟐 𝟑 𝟒 −𝟏
3. ( 𝟓 𝟐 𝟎 −𝟏)
−𝟒 𝟓 𝟏𝟐 −𝟏

2 3 4 −1
Let 𝐴 = ( 5 2 0 −1)
−4 5 12 −1
𝑅2 → 2𝑅2 − 5𝑅1 , 𝑅3 → 𝑅3 + 2𝑅1
2 3 4 −1
~ (0 −11 −20 3 )
0 11 20 −3
𝑅3 → 𝑅3 + 𝑅1
2 3 4 −1
~ (0 −11 −20 3 )
0 0 0 0

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

𝟏 𝟑 𝟒 𝟑
4. (𝟑 𝟗 𝟏𝟐 𝟑)
𝟏 𝟑 𝟒 𝟏

1 3 4 3
Let 𝐴 = (3 9 12 3)
1 3 4 1
𝑅2 → 𝑅2 − 3𝑅1 , 𝑅3 → 𝑅3 − 𝑅1
1 3 4 3
~ (0 0 0 −6)
0 0 0 −2
𝑅3 → 3𝑅3 − 𝑅2
1 3 4 3
~ (0 0 0 −6)
0 0 0 0

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

Maths dept. Dr. HNNCE, Bengaluru-70

3
𝟐 𝟏 𝟑 𝟓
5. ( 𝟒 𝟐 𝟏 𝟑 )
𝟖 𝟒 𝟕 𝟏𝟑
𝟖 𝟒 −𝟑 −𝟏

2 1 3 5
Let 𝐴 = ( 4 2 1 3 )
8 4 7 13
8 4 −3 −1
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 4𝑅1 , 𝑅4 → 𝑅4 − 4𝑅1
2 1 3 5
~( 0 0 −5 −7 )
0 0 −5 −7
0 0 −15 −21
𝑅3 → 𝑅3 − 𝑅2 , 𝑅4 → 𝑅4 − 3𝑅1
2 1 3 5
~ (0 0 −5 −7 )
0 0 0 0
0 0 0 0

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

Maths dept. Dr. HNNCE, Bengaluru-70

4
−𝟐 −𝟏 −𝟑 −𝟏
6. ( 𝟏 𝟐 𝟑 −𝟏)
𝟏 𝟎 𝟏 𝟏
𝟎 −𝟏 −𝟏 −𝟏

−2 −1 −3 −1
Let 𝐴 = ( 1 2 3 −1)
1 0 1 1
0 −1 −1 −1
𝑅2 → 2𝑅2 + 𝑅1 , 𝑅3 → 2𝑅3 + 𝑅1
−2 −1 −3 −1
~( 0 3 3 −3 )
0 −1 −1 1
0 1 −1 −1
𝑅2
𝑅2 → 3

−2 −1 −3 −1
~( 0 1 1 −1 )
0 −1 −1 1
0 1 −1 −1
𝑅3 → 𝑅3 + 𝑅2 , 𝑅4 → 𝑅4 − 𝑅2
−2 −1 −3 −1
~( 0 1 1 −1 )
0 0 0 0
0 0 −2 −2
𝑅3 ↔ 𝑅4
−2 −1 −3 −1
~(0 1 1 −1 )
0 0 −2 −2
0 0 0 0
This is in echelon form. The number of non-zero rows is 3.
Therefore, the rank of the given matrix is 3.

Maths dept. Dr. HNNCE, Bengaluru-70

5
𝟐 𝟑 −𝟏 −𝟏
7. (𝟏 −𝟏 −𝟐 −𝟒)
𝟑 𝟏 𝟑 −𝟐
𝟔 −𝟑 𝟎 −𝟕
2 3 −1 −1
Let 𝐴 = (1 −1 −2 −4)
3 1 3 −2
6 −3 0 −7
𝑅1 ↔ 𝑅2
1 −1 −2 −4
~ (2 3 −1 −1)
3 1 3 −2
6 −3 0 −7
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1 , 𝑅4 → 𝑅4 − 6𝑅1
1 −1 −2 −4
~( 0 5 3 7 )
0 4 9 10
0 9 12 17
𝑅3 → 5𝑅3 − 4𝑅2 , 𝑅4 → 5𝑅4 − 9𝑅2
1 −1 −2 −4
~( 0 5 3 7 )
0 0 33 22
0 0 33 22
𝑅4 → 𝑅4 − 𝑅3
1 −1 −2 −4
~( 0 5 3 7 )
0 0 33 22
0 0 0 0

This is in echelon form. The number of non-zero rows is 3.

Therefore, the rank of the given matrix is 3.

Maths dept. Dr. HNNCE, Bengaluru-70

6
𝟎 𝟏 −𝟑 −𝟏
8. ( 𝟏 𝟎 𝟏 𝟏 ) (May 22)
𝟑 𝟏 𝟎 𝟐
𝟏 𝟏 −𝟐 −𝟎

0 1 −3 −1
Let 𝐴 = ( 1 0 1 1 )
3 1 0 2
1 1 −2 −0
𝑅1 ↔ 𝑅2
1 0 1 1
~( 0 1 −3 −1 )
3 1 0 2
1 1 −2 −0
𝑅3 → 𝑅3 − 3𝑅1 , 𝑅4 → 𝑅4 − 𝑅1
1 0 1 1
~( 0 1 −3 −1 )
0 1 −3 −1
0 1 −3 −1
𝑅3 → 𝑅3 − 𝑅2 , 𝑅4 → 𝑅4 − 𝑅2
1 0 1 1
~ (0 1 −3 −1)
0 0 0 0
0 0 0 0

This is in echelon form. The number of non-zero rows is 2.

Therefore, the rank of the given matrix is 2.

Maths dept. Dr. HNNCE, Bengaluru-70

7
𝟏 𝟐 −𝟐 𝟑
9. ( 𝟐 𝟓 −𝟒 𝟔 )
−𝟏 −𝟑 𝟐 −𝟐
𝟐 −𝟒 −𝟏 −𝟔

1 2 −2 3
Let 𝐴 = ( 2 5 −4 6 )
−1 −3 2 −2
2 −4 −1 −6
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 + 𝑅1 , 𝑅4 → 𝑅4 − 2𝑅1
1 2 −2 3
~( 0 1 0 0)
0 −1 0 1
0 −0 3 0
𝑅3 → 𝑅3 + 𝑅2 , 𝑅4 → 𝑅4 − 𝑅1
1 2 −2 3
~( 0 1 0 0)
0 0 0 1
0 0 3 0
𝑅3 ↔ 𝑅4
1 2 −2 3
~(0 1 0 0)
0 0 3 0
0 0 0 1

This is in echelon form. The number of non-zero rows is 4.

Therefore, the rank of the given matrix is 4.

Maths dept. Dr. HNNCE, Bengaluru-70

8
𝟏 𝟐 𝟑 𝟎
10. (𝟐 𝟒 𝟑 𝟐)
𝟑 𝟐 𝟏 𝟑
𝟔 𝟖 𝟕 𝟓

1 2 3 0
Let 𝐴 = (2 4 3 2)
3 2 1 3
6 8 7 5
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1 , 𝑅4 → 𝑅4 − 6𝑅1
1 2 3 0
~ ( 0 0 −3 2 )
0 −4 −8 3
0 −4 −11 5
𝑅2 ↔ 𝑅3
1 2 3 0
~( 0 −4 −8 3 )
0 0 −3 2
0 −4 −11 5
𝑅4 → 𝑅4 − 𝑅2
1 2 3 0
~ ( 0 −4 −8 3 )
0 0 −3 2
0 0 −3 2
𝑅4 → 𝑅4 − 𝑅3
1 2 3 0
0 −4 −8 3
~( )
0 0 −3 2
0 0 0 0

This is in echelon form. The number of non-zero rows is 3.

Therefore, the rank of the given matrix is 3.

Maths dept. Dr. HNNCE, Bengaluru-70

9
5.2 Consistency of a system of linear equations

I. Homogeneous system of linear equations

Consistent Solution exists

Inconsistent Solution does not exist
𝑎1 𝑥 + 𝑏1 𝑦 + 𝑐1 𝑧 = 0
Homogeneous system 𝑎2 𝑥 + 𝑏2 𝑦 + 𝑐2 𝑧 = 0
𝑎3 𝑥 + 𝑏3 𝑦 + 𝑐3 𝑧 = 0
𝑎1 𝑏1 𝑐1 𝑥 0
(𝑎2 𝑏2 𝑐2 ) (𝑦 ) = (0)
Matrix form
𝑎3 𝑏3 𝑐3 𝑧 0
Or 𝐴𝑋 = 0
Coefficient matrix 𝑎1 𝑏1 𝑐1
𝐴 = 𝑎2
( 𝑏2 𝑐2 )
𝑎3 𝑏3 𝑐3
𝜌(𝐴) = 3 Trivial solution (Unique)
𝑥 = 0, 𝑦 = 0, 𝑧 = 0
𝜌(𝐴) < 3 Non-trivial solution (Infinite)
𝑧 = 𝑘, 𝑦 = 𝑝𝑘, 𝑥 = 𝑞𝑘
Homogeneous system of equations is always consistent.

1. Test for consistency and solve the following system of equations:

𝒙 + 𝟐𝒚 + 𝟑𝒛 = 𝟎, 𝟑𝒙 + 𝟒𝒚 + 𝟒𝒛 = 𝟎, 𝟕𝒙 + 𝟏𝟎𝒚 + 𝟏𝟐𝒛 = 𝟎
Coefficient matrix is
1 2 3
𝐴 = (3 4 4)
7 10 12
𝑅2 → 𝑅2 − 3𝑅1 , 𝑅3 → 𝑅3 − 7𝑅1
1 2 3
~ (0 −2 −5)
0 −4 −9
𝑅3 → 𝑅3 − 2𝑅2
1 2 3
~ (0 −2 −5)
0 0 1
This is in echelon form. Number of non-zero rows is 3.
𝜌(𝐴) = 3. Therefore, the given system of equations has trivial solution.
Therefore, 𝑥 = 0, 𝑦 = 0, 𝑧 = 0.
Maths dept. Dr. HNNCE, Bengaluru-70
10
2. Test for consistency and solve the following system of equations:
𝒙 + 𝟑𝒚 − 𝟐𝒛 = 𝟎, 𝟐𝒙 − 𝒚 + 𝟒𝒛 = 𝟎, 𝒙 − 𝟏𝟏𝒚 + 𝟏𝟒𝒛 = 𝟎
Coefficient matrix is
1 3 −2
𝐴 = (2 −1 4)
1 −11 14
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 𝑅1
1 3 −2
~ (0 −7 8)
0 −14 16
𝑅3 → 𝑅3 − 2𝑅2
1 3 −2
~ (0 −7 8 )
0 0 0
This is in echelon form. Number of non-zero rows is 2.
𝜌(𝐴) = 2. Therefore, the given system of equations has non-trivial solutions.
Reduced system of equations is
𝑥 + 3𝑦 − 2𝑧 = 0 ---- (1)
−7𝑦 + 8𝑧 = 0 ------- (2)
8𝑘 10
Choose 𝑧 = 𝑘 then 𝑦 = and 𝑥 = − 𝑘
7 7
10 8𝑘
Therefore, 𝑥 = − 𝑘 ,𝑦 = ,𝑧 = 𝑘
7 7

Maths dept. Dr. HNNCE, Bengaluru-70

11
3. Test for consistency and solve the following system of equations:
𝒙 + 𝟑𝒚 + 𝟐𝒛 = 𝟎, 𝟐𝒙 − 𝒚 + 𝟑𝒛 = 𝟎, 𝟑𝒙 − 𝟓𝒚 + 𝟒𝒛 = 𝟎, 𝒙 + 𝟏𝟕𝒚 + 𝟒𝒛 = 𝟎
Coefficient matrix is
1 3 2
𝐴 = (2 −1 3)
3 −5 4
1 17 4
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1 , 𝑅4 → 𝑅4 − 𝑅1
1 3 2
~ (0 −7 −1)
0 −14 −2
0 14 2
𝑅3 → 𝑅3 − 2𝑅2
1 3 2
~( 0 −7 −1 )
0 0 0
0 0 0
This is in echelon form. Number of non-zero rows is 2.
𝜌(𝐴) = 2. Therefore, the given system of equations has non-trivial solutions.
Reduced system of equations is
𝑥 + 3𝑦 + 2𝑧 = 0 ---- (1)
−7𝑦 − 𝑧 = 0 ----- (2)
−𝑘 11
Choose 𝑧 = 𝑘 then 𝑦 = and 𝑥 = − 𝑘
7 7
11 −𝑘
Therefore, 𝑥 = − 𝑘 ,𝑦 = ,𝑧 = 𝑘
7 7

Maths dept. Dr. HNNCE, Bengaluru-70

12
II. Non-homogeneous system of linear equations

𝑎1 𝑥 + 𝑏1 𝑦 + 𝑐1 𝑧 = 𝑑1
Non-homogeneous 𝑎2 𝑥 + 𝑏2 𝑦 + 𝑐2 𝑧 = 𝑑2
system 𝑎3 𝑥 + 𝑏3 𝑦 + 𝑐3 𝑧 = 𝑑3
𝑎1 𝑏1 𝑐1 𝑥 𝑑1
(𝑎2 𝑏2 𝑐2 ) (𝑦) = (𝑑2 )
Matrix form
𝑎3 𝑏3 𝑐3 𝑧 𝑑3
Or 𝐴𝑋 = 𝐵
Augmented matrix 𝑎1 𝑏1 𝑐1 𝑑1
(𝐴, 𝐵) = (𝑎2 𝑏2 𝑐2 𝑑2 )
𝑎3 𝑏3 𝑐3 𝑑3
𝜌(𝐴) = 𝜌(𝐴, 𝐵) Consistent
( ) ( )
𝜌 𝐴 = 𝜌 𝐴, 𝐵 = 3 Unique solution
𝜌(𝐴) = 𝜌(𝐴, 𝐵) < 3 Infinite number of solutions

𝜌(𝐴) ≠ 𝜌(𝐴, 𝐵) Inconsistent

Maths dept. Dr. HNNCE, Bengaluru-70

13
4. Test for consistency and solve the following system of equations:
𝒙 + 𝟐𝒚 + 𝟑𝒛 = 𝟏, 𝟐𝒙 + 𝟑𝒚 + 𝟖𝒛 = 𝟐, 𝒙 + 𝒚 + 𝒛 = 𝟑
Augmented matrix is
1 2 3 1
(𝐴, 𝐵) = (2 3 8 2)
1 1 1 3
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 𝑅1
1 2 3 1
~ (0 −1 2 0)
0 −1 −2 2
𝑅3 → 𝑅3 − 𝑅2
1 2 3 1
~ (0 −1 2 0)
0 0 −4 2
This is in echelon form. Number of non-zero rows is 3.
𝜌(𝐴) = 𝜌(𝐴, 𝐵) = 3.
Therefore, the given system of equations is consistent and has a unique solution.
Reduced system of equations is
𝑥 + 2𝑦 + 3𝑧 = 1 ---- (1)
−𝑦 + 2𝑧 = 0 ---- (2)
−4𝑧 = 2 ---- (3)
Solving by back substitution,
9 1
𝑥 = 2 , 𝑦 = −1, 𝑧 = − 2

Maths dept. Dr. HNNCE, Bengaluru-70

14
5. Test for consistency and solve the following system of equations:
𝟓𝒙 + 𝟑𝒚 + 𝟕𝒛 = 𝟒, 𝟑𝒙 + 𝟐𝟔𝒚 + 𝟐𝒛 = 𝟗, 𝟕𝒙 + 𝟐𝒚 + 𝟏𝟎𝒛 = 𝟓
Augmented matrix is
5 3 7 4
(𝐴, 𝐵) = (3 26 2 9)
7 2 10 5
𝑅2 → 5𝑅2 − 3𝑅1 , 𝑅3 → 5𝑅3 − 7𝑅1
5 3 7 4
~ (0 121 −11 33 )
0 −11 1 −3
𝑅3 → 11𝑅3 + 𝑅2
5 3 7 4
~ (0 121 −11 33)
0 0 0 0
This is in echelon form. Number of non-zero rows is 2.
𝜌(𝐴) = 𝜌(𝐴, 𝐵) = 2.
Therefore, the given system of equations is consistent
and has an infinite number of solutions.

Reduced system of equations is

5𝑥 + 3𝑦 + 7𝑧 = 4 ---- (1)
121𝑦 − 11𝑧 = 33 ---- (2)
3+𝑘 7−16𝑘
Choose 𝑧 = 𝑘 then 𝑦 = and 𝑥 = .
11 11
7−16𝑘 3+𝑘
Therefore, 𝑥 = ,𝑦 = , 𝑧 = 𝑘.
11 11

Maths dept. Dr. HNNCE, Bengaluru-70

15
6. Test for consistency and solve the following system of equations:
𝒙 + 𝒚 + 𝒛 = −𝟑, 𝟑𝒙 + 𝒚 − 𝟐𝒛 = −𝟐, 𝟐𝒙 + 𝟒𝒚 + 𝟕𝒛 = 𝟕
Augmented matrix is
1 1 1 −3
(𝐴, 𝐵) = (3 1 −2 −2)
2 4 7 7
𝑅2 → 𝑅2 − 3𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1
1 1 1 −3
~ (0 −2 −5 7 )
0 2 5 13
𝑅3 → 𝑅3 + 𝑅2
1 1 1 −3
~ (0 −2 −5 7 )
0 0 0 20
This is in echelon form. Number of non-zero rows is 3.
𝜌(𝐴) = 2 𝑎𝑛𝑑 𝜌(𝐴, 𝐵) = 3. 𝜌(𝐴) ≠ 𝜌(𝐴, 𝐵).
Therefore, the given system of equations is inconsistent
Therefore, the system has no solution.

Maths dept. Dr. HNNCE, Bengaluru-70

16
7. Test for consistency and solve the following system of equations:
𝒙 + 𝟐𝒚 + 𝟐𝒛 = 𝟓, 𝟐𝒙 + 𝒚 + 𝟑𝒛 = 𝟔, 𝟑𝒙 − 𝒚 + 𝟐𝒛 = 𝟒, 𝒙 + 𝒚 + 𝒛 = −𝟏
Coefficient matrix is
1 2 2 5
(𝐴, 𝐵) = ( 2 1 3 6)
3 −1 2 4
1 1 1 −1
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1 , 𝑅4 → 𝑅4 − 𝑅1
1 2 2 5
~(0 −3 −1 −4 )
0 −7 −4 −11
0 −1 −1 −6
𝑅3 → 3𝑅3 − 7𝑅2 , 𝑅4 → 3𝑅4 − 𝑅2
1 2 2 5
~( 0 −3 −1 −4 )
0 0 −5 −5
0 0 −2 − 14
𝑅4 → 5𝑅4 − 2𝑅3
1 2 2 5
~ ( 0 −3 −1 −4 )
0 0 −5 −5
0 0 0 − 60
This is in echelon form. Number of non-zero rows is 4.
𝜌(𝐴) = 3 𝑎𝑛𝑑 𝜌(𝐴, 𝐵) = 4. 𝜌(𝐴) ≠ 𝜌(𝐴, 𝐵).
Therefore, the given system of equations is inconsistent
Therefore, the system has no solution.

Maths dept. Dr. HNNCE, Bengaluru-70

17
8. Find the values of 𝝀 and 𝝁 for which the system
𝒙 + 𝒚 + 𝒛 = 𝟔, 𝒙 + 𝟐𝒚 + 𝟑𝒛 = 𝟏𝟎, 𝒙 + 𝟐𝒚 + 𝝀𝒛 = 𝝁
has (i) Unique solution (ii) Infinitely many solutions (iii) No solution. (May 22)
Augmented matrix is
1 1 1 6
(𝐴, 𝐵) = (1 2 3 10)
1 2 𝜆 𝜇
𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 𝑅1
1 1 1 6
~ (0 1 2 4 )
0 1 𝜆−1 𝜇−6
𝑅3 → 𝑅3 − 𝑅2
1 1 1 −3
~ (0 −2 −5 7 )
0 0 𝜆−3 𝜇 − 10
This is in echelon form.
(i) If 𝜆 ≠ 3, then 𝜌(𝐴) = 𝜌(𝐴, 𝐵) = 3.
The given system of equations has a unique solution.
(ii) If 𝜆 = 3, 𝜇 = 10 then 𝜌(𝐴) = 𝜌(𝐴, 𝐵) = 2.
The given system of equations has infinitely many solutions.
(iii) If 𝜆 = 3, 𝜇 ≠ 10 then 𝜌(𝐴) ≠ 𝜌(𝐴, 𝐵).
The given system of equations has no solution.

2𝑥 − 3𝑦 + 𝑧 = −1
11𝑦 + 9𝑧 = 51
−20𝑧 = 26

By back substitution,
−20𝑧 = 26 gives 𝑧 = −1.3
11𝑦 + 9(−1.3) = 51 gives 𝑦 = 5.7
2𝑥 − 3(5.7) − 1.3 = −1 gives 𝑥 = 8.7

Therefore, the solution is

𝑥 = 8.7 , 𝑦 = 5.7, 𝑧 = −1.3

Maths dept. Dr. HNNCE, Bengaluru-70

25
5.4 Gauss Jordan method

Introduction

In this method, using elementary row transformations, augmented matrix is reduced to

1 0 0 𝑘1
the form (0 1 0 𝑘2 ) .
0 0 1 𝑘3
1. Apply Gauss Jordan method to solve the system of equations:
𝒙 + 𝟑𝒚 + 𝟑𝒛 = 𝟏𝟔 , 𝒙 + 𝟒𝒚 + 𝟑𝒛 = 𝟏𝟖 , 𝒙 + 𝟑𝒚 + 𝟒𝒛 = 𝟏𝟗
The augmented matrix associated to the given system of equations is
1 3 3 16
(𝐴: 𝐵) = (1 4 3 18)
1 3 4 19
𝑅2 → 𝑅2 − 𝑅1 , 𝑅3 → 𝑅3 − 𝑅1
1 3 3 16
~ (0 1 0 2)
0 0 1 3
𝑅1 → 𝑅1 − 3𝑅2
1 0 3 10
~ (0 1 0 2)
0 0 1 3
𝑅1 → 𝑅1 − 3𝑅3
1 0 0 1
~ (0 1 0 2)
0 0 1 3
Therefore, 𝑥 = 1, 𝑦 = 2 , 𝑧 = 3 .

Maths dept. Dr. HNNCE, Bengaluru-70

26
2. Solve the system of equations by using the Gauss-Jordan method
𝒙 + 𝒚 + 𝒛 = 𝟏𝟎, 𝟐𝒙 − 𝒚 + 𝟑𝒛 = 𝟏𝟗, 𝒙 + 𝟐𝒚 + 𝟑𝒛 = 𝟐𝟐
The augmented matrix associated to the given system of equations is

1 1 1 10
(𝐴: 𝐵) = (2 −1 3 19)
1 2 3 22

𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 𝑅1

1 1 1 10
~ (0 −3 1 −1)
0 1 2 12
𝑅
𝑅2 → −32

1 1 1 10
~ (0 1 −1/3 1/3)
0 1 2 12

𝑅3 → 𝑅3 − 𝑅2 , 𝑅1 → 𝑅1 − 𝑅2

1 0 4/3 29/3
~ (0 1 −1/3 1/3 )
0 0 7/3 35/3

3
𝑅3 → 7 𝑅3

1 0 4/3 29/3
~ (0 1 −1/3 1/3 )
0 0 1 5
1 4
𝑅2 → 𝑅2 + 3 𝑅3 , 𝑅1 → 𝑅1 − 3 𝑅3

1 0 0 3
~ (0 1 0 2)
0 0 1 5

Therefore, 𝑥 = 3, 𝑦 = 2 , 𝑧 = 5.

Maths dept. Dr. HNNCE, Bengaluru-70

27
3. Solve the system of equations by using Gauss-Jordan method
𝒙 + 𝒚 + 𝒛 = 𝟗, 𝟐𝒙 + 𝒚 − 𝒛 = 𝟎, 𝟐𝒙 + 𝟓𝒚 + 𝟕𝒛 = 𝟓𝟐

The augmented matrix associated to the given system of equations is

1 1 1 9
(𝐴: 𝐵) = (2 1 −1 0)
2 5 7 52

𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1

1 1 1 9
~ (0 −1 −3 −18)
0 3 5 34

𝑅2 → −1 × 𝑅2

1 1 1 9
~ (0 1 3 18)
0 3 5 34

𝑅3 → 𝑅3 − 3𝑅2 , 𝑅1 → 𝑅1 − 𝑅2

1 0 −2 −9
~ (0 1 3 18 )
0 0 −4 −20
1
𝑅3 → − 4 𝑅3

1 0 −2 −9
~ (0 1 3 18 )
0 0 1 5

𝑅2 → 𝑅2 − 3𝑅3 , 𝑅1 → 𝑅1 + 2𝑅3

1 0 0 1
~ (0 1 0 3)
0 0 1 5

Therefore, 𝑥 = 1, 𝑦 = 3 , 𝑧 = 5.

Maths dept. Dr. HNNCE, Bengaluru-70

28
4. Apply Gauss Jordan method to solve the system of equations:
𝒙 − 𝟐𝒚 + 𝟑𝒛 = 𝟐 , 𝟑𝒙 − 𝒚 + 𝟒𝒛 = 𝟒 , 𝟐𝒙 + 𝒚 − 𝟐𝒛 = 𝟓
The augmented matrix associated to the given system of equations is
1 −2 3 2
(𝐴: 𝐵) = (3 −1 4 4)
2 1 −2 5
𝑅2 → 𝑅2 − 3𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1
1 −2 3 2
~ (0 5 −5 −2)
0 5 −8 1
𝑅3 → 𝑅3 − 𝑅2
1 −2 3 2
~ (0 5 −5 −2)
0 0 −3 3
𝑅2
𝑅2 → 5

1 −2 3 2
~ (0 1 −1 −2/5)
0 0 −3 3
𝑅1 → 𝑅1 + 2𝑅2
1 0 1 6/5
~ (0 1 −1 −2/5)
0 0 −3 3
𝑅
𝑅3 → −33

1 0 1 6/5
~ (0 1 −1 −2/5)
0 0 1 −1
𝑅2 → 𝑅2 + 𝑅3 , 𝑅1 → 𝑅1 − 𝑅3
1 0 0 11/5
~ (0 1 0 −7/5)
0 0 1 −1
11 7
Therefore, 𝑥 = , 𝑦 = − 5 , 𝑧 = −1.
5

Maths dept. Dr. HNNCE, Bengaluru-70

29
5. Apply Gauss Jordan method to solve the system of equations:
𝟐𝒙 − 𝟑𝒚 + 𝒛 = −𝟏 , 𝒙 + 𝟒𝒚 + 𝟓𝒛 = 𝟐𝟓 , 𝟑𝒙 − 𝟒𝒚 + 𝒛 = 𝟐
The augmented matrix associated to the given system of equations is
2 −3 1 −1
(𝐴: 𝐵) = (1 4 5 25 )
3 −4 1 2
𝑅1 ⟷ 𝑅2
1 4 5 25
~ (2 −3 1 −1)
3 −4 1 2
𝑅2 → 𝑅2 − 2𝑅1 , 𝑅3 → 𝑅3 − 3𝑅1
1 4 5 25
~ (0 −11 −9 −51)
0 −16 −14 −73
2 𝑅
𝑅2 → −11

1 4 5 25
(
~ 0 1 9/11 51/11)
0 −16 −14 −73
𝑅1 → 𝑅1 − 4𝑅2 , 𝑅3 → 𝑅3 + 16𝑅2
1 0 19/11 71/11
~ (0 1 9/11 51/11)
0 0 −10/11 13/11
11
𝑅3 → − 10 𝑅3

1 0 19/11 71/11
~ (0 1 9/11 51/11 )
0 0 1 −13/10
19 9
𝑅1 → 𝑅1 − 11 𝑅3 , 𝑅2 → 𝑅2 − 11 𝑅3

1 0 0 87/10
(
~ 0 1 0 57/10 )
0 0 1 −13/10
87 57 13
Therefore, 𝑥 = 10 , 𝑦 = 10 , 𝑧 = − 10 .

Maths dept. Dr. HNNCE, Bengaluru-70

30
6. Apply Gauss Jordan method to solve the system of equations:
𝟐𝒙 + 𝒚 + 𝒛 = 𝟏𝟎 , 𝟑𝒙 + 𝟐𝒚 + 𝟑𝒛 = 𝟏𝟖 , 𝒙 + 𝟒𝒚 + 𝟗𝒛 = 𝟏𝟔 (7, -9, 5)
The augmented matrix associated to the given system of equations is
2 1 1 10
(𝐴: 𝐵) = (3 2 3 18)
1 4 9 16
𝑅1 ⟷ 𝑅3
1 4 9 16
~ (3 2 3 18)
2 1 1 10
𝑅2 → 𝑅2 − 3𝑅1 , 𝑅3 → 𝑅3 − 2𝑅1
1 4 9 16
~ (0 −10 −24 −30 )
0 −7 −17 −22
2 𝑅
𝑅2 → −10

1 4 9 16
~ (0 1 24/10 3 )
0 −7 −17 −22
𝑅1 → 𝑅1 − 4𝑅2 , 𝑅3 → 𝑅3 + 7𝑅2
1 0 −6/10 4
~ (0 1 24/10 3)
0 0 −2/10 −1
𝑅3 → −5𝑅3
1 0 −6/10 4
~ (0 1 24/10 3)
0 0 1 5
6 24
𝑅1 → 𝑅1 + 10 𝑅3 , 𝑅2 → 𝑅2 − 10 𝑅3

1 0 0 7
~ (0 1 0 −9)
0 0 1 5
Therefore, 𝑥 = 7, 𝑦 = −9, 𝑧 = 5 .

Maths dept. Dr. HNNCE, Bengaluru-70

31
5.4 Gauss Seidel method
Introduction
Consider the system of equations 𝑎1 𝑥 + 𝑏1 𝑦 + 𝑐1 𝑧 = 𝑑1
𝑎2 𝑥 + 𝑏2 𝑦 + 𝑐2 𝑧 = 𝑑2
𝑎3 𝑥 + 𝑏3 𝑦 + 𝑐3 𝑧 = 𝑑3
Rearrange this system of equations to a diagonally dominant system.
Rearrange the given system of equations in such a way that 𝑎1 , 𝑏2 , 𝑐3 must be non
zero and numerically largest comparing to other coefficients.
1
Rewrite this system of equations as 𝑥 = 𝑎 (𝑑1 − 𝑏1 𝑦 − 𝑐1 𝑧)
1

1
𝑦 = 𝑏 (𝑑2 − 𝑐2 𝑧 − 𝑎2 𝑥)
2

1
𝑧 = 𝑐 (𝑑3 − 𝑎3 𝑥 − 𝑏3 𝑦)
3

Consider the initial approximations as 𝑥0 = 0, 𝑦0 = 0, 𝑧0 = 0.

1
First iteration: 𝑥1 = (𝑑1 − 𝑏1 𝑦0 − 𝑐1 𝑧0 )
𝑎1
1
𝑦1 = 𝑏 (𝑑2 − 𝑐2 𝑧0 − 𝑎2 𝑥1 )
2

1
𝑧1 = 𝑐 (𝑑3 − 𝑎3 𝑥1 − 𝑏3 𝑦1 )
3

1
Second iteration: 𝑥2 = 𝑎 (𝑑1 − 𝑏1 𝑦1 − 𝑐1 𝑧1 )
1

1
𝑦2 = 𝑏 (𝑑2 − 𝑐2 𝑧1 − 𝑎2 𝑥2 )
2

1
𝑧2 = 𝑐 (𝑑3 − 𝑎3 𝑥2 − 𝑏3 𝑦2 )
3

1
Third iteration: 𝑥3 = 𝑎 (𝑑1 − 𝑏1 𝑦2 − 𝑐1 𝑧2 )
1

1
𝑦3 = 𝑏 (𝑑2 − 𝑐2 𝑧2 − 𝑎2 𝑥3 )
2

1
𝑧3 = 𝑐 (𝑑3 − 𝑎3 𝑥3 − 𝑏3 𝑦3 )
3

Therefore, approximate solution of the given system of equations is

𝑥 ≅ 𝑥3 , 𝑦 ≅ 𝑦3 , 𝑧 ≅ 𝑧3
Accuracy can be improved by increasing number of iterations.
Initial approximation does not affect the solution, it may affect the number of iterations.

Maths dept. Dr. HNNCE, Bengaluru-70

32
1. Solve the following system of equations by Gauss-Seidel method
𝟏𝟎𝒙 + 𝒚 + 𝒛 = 𝟏𝟐, 𝒙 + 𝟏𝟎𝒚 + 𝒛 = 𝟏𝟐, 𝒙 + 𝒚 + 𝟏𝟎𝒛 = 𝟏𝟐
Rearrange this system of equations to a diagonally dominant system.
10𝑥 + 𝑦 + 𝑧 = 12
𝑥 + 10𝑦 + 𝑧 = 12
𝑥 + 𝑦 + 10𝑧 = 12
Rewrite this system of equations as
1
𝑥= (12 − 𝑦 − 𝑧)
10
1
𝑦= (12 − 𝑧 − 𝑥)
10
1
𝑧= (12 − 𝑥 − 𝑦)
10
Consider the initial approximations as 𝑥0 = 0, 𝑦0 = 0, 𝑧0 = 0.
First iteration:
1 1
𝑥1 = 10 (12 − 𝑦0 − 𝑧0 ) = 10 (12 − 0 − 0) = 1.2
1 1
𝑦1 = 10 (12 − 𝑧0 − 𝑥1 ) = 10 (12 − 0 − 1.2) = 1.32
1 1
𝑧1 = 10 (12 − 𝑥1 − 𝑦1 ) = 10 (12 − 1.2 − 1.32) = 1.452

Second iteration:
1 1
𝑥2 = 10 (12 − 𝑦1 − 𝑧1 ) = 10 (12 − 1.32 − 1.452) = 1.2
1 1
𝑦2 = 10 (12 − 𝑧1 − 𝑥2 ) = 10 (12 − 1.452 − 1.2) = 0.9348
1 1
𝑧2 = 10 (12 − 𝑥2 − 𝑦2 ) = 10 (12 − 1.2 − 0.9348) = 0.9865
Third iteration:
1 1
𝑥3 = 10 (12 − 𝑦2 − 𝑧2 ) = 10 (12 − 0.9348 − 0.9865) = 1.0079
1 1
𝑦3 = (12 − 𝑧2 − 𝑥3 ) = (12 − 0.9865 − 1.0079) = 1.0005
10 10
1 1
𝑧3 = 10 (12 − 𝑥3 − 𝑦3 ) = 10 (12 − 1.0079 − 1.0005 ) = 0.9992
Therefore, approximate solution of the given system of equations is
𝑥 ≅ 1, 𝑦 ≅ 1, 𝑧 ≅ 1

Maths dept. Dr. HNNCE, Bengaluru-70

33
2. Solve the following system of equation by Gauss-Seidel method:
𝟐𝟎𝒙 + 𝒚 − 𝟐𝒛 = 𝟏𝟕 , 𝟑𝒙 + 𝟐𝟎𝒚 − 𝒛 = −𝟏𝟖 , 𝟐𝒙 − 𝟑𝒚 + 𝟐𝟎𝒛 = 𝟐𝟓
Rearrange this system of equations to a diagonally dominant system.
20𝑥 + 𝑦 − 2𝑧 = 17
3𝑥 + 20𝑦 − 𝑧 = −18
2𝑥 − 3𝑦 + 20𝑧 = 25
Rewrite this system of equations as
1
𝑥= (17 − 𝑦 + 2𝑧)
20
1
𝑦= (−18 + 𝑧 − 3𝑥)
20
1
𝑧= (25 − 2𝑥 + 3𝑦)
20
Consider the initial approximations as 𝑥0 = 0, 𝑦0 = 0, 𝑧0 = 0.
First iteration:
1 1
𝑥1 = 20 (17 − 𝑦0 + 2𝑧0 ) = 20 (17 − 0 − 0) = 0.85
1 1
𝑦1 = 20 (−18 + 𝑧0 − 3𝑥1 ) = 20 (−18 + 0 − 3(0.85)) = −1.0285
1 1
𝑧1 = (25 − 2𝑥1 + 3𝑦1 ) = (25 − 2(0.85) + 3(−1.0285)) = 1.0107
20 20

Second iteration:
1 1
𝑥2 = 20 (17 − 𝑦1 + 2𝑧1 ) = 20 (17 + 1.0285 + 2(1.0107)) = 1.0025
1 1
𝑦2 = 20 (−18 + 𝑧1 − 3𝑥2 ) = 20 (−18 + 1.0107 − 3(1.0025)) = −0.9998
1 1
𝑧2 = 20 (25 − 2𝑥2 + 3𝑦2 ) = 20 (25 − 2(1.0025) − 3(0.9998)) = 0.9998

Third iteration:
1 1
𝑥3 = 20 (17 − 𝑦2 + 2𝑧2 ) = 20 (17 + 0.9998 + 2(0.9998)) = 0.9999
1 1
𝑦3 = (−18 + 𝑧2 − 3𝑥3 ) = (−18 + 0.9998 − 3(0.9999)) = −0.9999
20 20
1 1
𝑧3 = 20 (25 − 2𝑥3 + 3𝑦3 ) = 20 (25 − 2(0.9999) − 3(0.9999)) = 1
Therefore, approximate solution of the given system of equations is
𝑥 ≅ 1, 𝑦 ≅ −1, 𝑧 ≅ 1

Maths dept. Dr. HNNCE, Bengaluru-70

34
3. Use the Gauss – Seidel iterative method to solve the system of equations
𝟐𝟕𝒙 + 𝟔𝒚 − 𝒛 = 𝟖𝟓 , 𝟔𝒙 + 𝟏𝟓𝒚 + 𝟐𝒛 = 𝟕𝟐 , 𝒙 + 𝒚 + 𝟓𝟒𝒛 = 𝟏𝟏𝟎
Carryout four iterations, taking the initial approximation to the solution as (𝟐, 𝟑, 𝟐).
Rearrange this system of equations to a diagonally dominant system.
27𝑥 + 6𝑦 − 𝑧 = 85
6𝑥 + 15𝑦 + 2𝑧 = 72
𝑥 + 𝑦 + 54𝑧 = 110
Rewrite this system of equations as
1
𝑥= (85 − 6𝑦 + 𝑧)
27
1
𝑦= (72 − 2𝑧 − 6𝑥)
15
1
𝑧= (110 − 𝑥 − 𝑦)
54
Consider the initial approximations as 𝑥0 = 2, 𝑦0 = 3, 𝑧0 = 2.
First iteration:
1 1
𝑥1 = 27 (85 − 6𝑦0 + 𝑧0 ) = 27 (85 − 6(3) + 2) = 2.5556
1 1
𝑦1 = 15 (72 − 2𝑧0 − 6𝑥1 ) = 15 (72 − 2(2) − 6(2.5556)) = 3.5111
1 1
𝑧1 = (110 − 𝑥1 − 𝑦1 ) = (110 − 2.5556 − 3.5111) = 1.9247
54 54

Second iteration:
1 1
𝑥2 = (85 − 6𝑦1 + 𝑧1 ) = (85 − 6(3.5111) + (1.9247)) = 2.5133
27 27
1 1
𝑦2 = 15 (72 − 2𝑧1 − 6𝑥2 ) = 15 (72 − 2(1.9247) − 6(2.5133)) = 3.5381
1 1
𝑧2 = 54 (110 − 𝑥2 − 𝑦2 ) = 54 (110 − 2.5133 − 3.5381) = 1.9250
Third iteration:
1 1
𝑥3 = 27 (85 − 6𝑦2 + 𝑧2 ) = 27 (85 − 6(3.5381 ) + 1.9250) = 2.4332
1 1
𝑦3 = 15 (72 − 2𝑧2 − 6𝑥3 ) = 15 (72 − 2(1.9250 ) − 6(2.4332)) = 3.5701
1 1
𝑧3 = 54 (110 − 𝑥3 − 𝑦3 ) = 54 (110 − 2.4332 − 3.5701) = 1.9259

Therefore, approximate solution of the given system of equations is

𝑥 = 2.4332, 𝑦 = 3.5701, 𝑧 = 1.9259

Maths dept. Dr. HNNCE, Bengaluru-70

35
4. Apply the Gauss –Seidel iterative method to solve the system of equations
𝟓𝒙 − 𝒚 = 𝟗, −𝒙 + 𝟓𝒚 − 𝒛 = 𝟒, −𝒚 + 𝟓𝒛 = −𝟔
Rearrange this system of equations to a diagonally dominant system.
5𝑥 − 𝑦 + 0𝑧 = 9
−𝑥 + 5𝑦 − 𝑧 = 4
0𝑥 − 𝑦 + 5𝑧 = −6
Rewrite this system of equations as
1
𝑥 = (9 + 𝑦)
5
1
𝑦 = (4 + 𝑥 + 𝑧)
5
1
𝑧 = (−6 + 𝑦)
5
Consider the initial approximations as 𝑥0 = 0, 𝑦0 = 0, 𝑧0 = 0.
First iteration:
1 1
𝑥1 = 5 (9 + 𝑦0 ) = 5 (9 + 0) = 1.8
1 1
𝑦1 = (4 + 𝑧0 + 𝑥1 ) = (4 + 0 + 1.8) = 1.16
5 5
1 1
𝑧1 = (−6 + 𝑦1 ) = (−6 + 1.16) = −0.968
5 5

Second iteration:
1 1
𝑥2 = 5 (9 + 𝑦1 ) = 5 (9 + 1.16) = 2.032
1 1
𝑦2 = 5 (4 + 𝑧1 + 𝑥2 ) = 5 (4 − 0.968 + 2.032) = 1.0128
1 1
𝑧2 = 5 (−6 + 𝑦2 ) = 5 (−6 + 1.0128) = −0.9974
Third iteration:
1 1
𝑥3 = 5 (9 + 𝑦2 ) = 5 (9 + 1.0128) = 2.0026
1 1
𝑦3 = (4 + 𝑧2 + 𝑥3 ) = (4 − 0.9974 + 2.0026) = 1.001
5 5
1 1
𝑧3 = 5 (−6 + 𝑦3 ) = 5 (−6 + 1.001) = −0.9998
Therefore, approximate solution of the given system of equations is
𝑥 ≅ 2, 𝑦 ≅ 1, 𝑧 ≅ −1

Maths dept. Dr. HNNCE, Bengaluru-70

36
5. Use the Gauss –Seidel iterative method to solve the system of equations
5𝒙 + 𝟐𝒚 + 𝒛 = 𝟏𝟐, 𝒙 + 𝟒𝒚 + 𝟐𝒛 = 𝟏𝟓, 𝒙 + 𝟐𝒚 + 𝟓𝒛 = 𝟐𝟎
Rearrange this system of equations to a diagonally dominant system.
5𝑥 + 2𝑦 + 𝑧 = 12
𝑥 + 4𝑦 + 2𝑧 = 15
𝑥 + 2𝑦 + 5𝑧 = 20
Rewrite this system of equations as
1
𝑥 = (12 − 2𝑦 − 𝑧)
5
1
𝑦 = (15 − 2𝑧 − 𝑥)
4
1
𝑧 = (20 − 𝑥 − 2𝑦)
5
Consider the initial approximations as 𝑥0 = 0, 𝑦0 = 0, 𝑧0 = 0.
First iteration:
1 1
𝑥1 = 5 (12 − 2𝑦0 − 𝑧0 ) = 5 (12 − 2(0) − 0) = 2.4
1 1
𝑦1 = 4 (15 − 2𝑧0 − 𝑥1 ) = 4 (15 − 2(0) − 2.4) = 3.15
1 1
𝑧1 = (20 − 𝑥1 − 2𝑦1 ) = (20 − 2.4 − 2(3.15)) = 2.26
5 5

Second iteration:
1 1
𝑥2 = 5 (12 − 2𝑦1 − 𝑧1 ) = 5 (12 − 2(3.15) − 2.26) = 0.688
1 1
𝑦2 = 4 (15 − 2𝑧1 − 𝑥2 ) = 4 (15 − 2(2.26) − 0.688) = 2.488
1 1
𝑧2 = 5 (20 − 𝑥2 − 2𝑦2 ) = 5 (20 − 0.688 − 2(2.488)) = 2.8672
Third iteration:
1 1
𝑥3 = 5 (12 − 2𝑦2 − 𝑧2 ) = 5 (12 − 2(2.488) − 2.8672) = 0.8314
1 1
𝑦3 = (15 − 2𝑧2 − 𝑥3 ) = (15 − 2(2.8672) − 0.8314) = 2.1086
4 4
1 1
𝑧3 = 5 (20 − 𝑥3 − 2𝑦3 ) = 5 (20 − 0.8314 − 2(2.1086)) = 2.9903
Therefore, approximate solution of the given system of equations is
𝑥 = 0.8314, 𝑦 = 2.1086, 𝑧 = 2.9903

Maths dept. Dr. HNNCE, Bengaluru-70

37
6. Solve the following system of equations by Gauss Seidel iterative method
𝒙 + 𝟑𝒚 + 𝟏𝟎𝒛 = 𝟐𝟒, 𝟐𝒙 + 𝟏𝟕𝒚 + 𝟒𝒛 = 𝟑𝟓, 𝟐𝟖𝒙 + 𝟒𝒚 − 𝒛 = 𝟑𝟐
Rearrange this system of equations to a diagonally dominant system.
28𝑥 + 4𝑦 − 𝑧 = 32
2𝑥 + 17𝑦 + 4𝑧 = 35
𝑥 + 3𝑦 + 10𝑧 = 24
Rewrite this system of equations as
1
𝑥= (32 − 4𝑦 + 𝑧)
28
1
𝑦= (35 − 4𝑧 − 2𝑥)
17
1
𝑧= (24 − 𝑥 − 3𝑦)
10
Consider the initial approximations as 𝑥0 = 0, 𝑦0 = 0, 𝑧0 = 0.
First iteration:
1 1
𝑥1 = 28 (32 − 4𝑦0 + 𝑧0 ) = 28 (32 − 4(0) + 0) = 1.1429
1 1
𝑦1 = 17 (35 − 4𝑧0 − 2𝑥1 ) = 17 (35 − 4(0) − 2(1.1429)) = 1.9244
1 1
𝑧1 = (24 − 𝑥1 − 3𝑦1 ) = (24 − 1.1429 − 3(1.9244)) = 1.7084
10 10

Second iteration:
1 1
𝑥2 = (32 − 4𝑦1 + 𝑧1 ) = (32 − 4(1.9244) + 1.7084) = 0.9290
28 28
1 1
𝑦2 = 17 (35 − 4𝑧1 − 2𝑥2 ) = 17 (35 − 4(1.7084) − 2(0.9290)) = 1.5476
1 1
𝑧2 = 10 (24 − 𝑥2 − 3𝑦2 ) = 10 (24 − 0.9290 − 3(1.5476)) = 1.8428

Third iteration:
1 1
𝑥3 = 28 (32 − 4𝑦2 + 𝑧2 ) = 28 (32 − 4(1.5476) + 1.8428) = 0.9876
1 1
𝑦3 = (35 − 4𝑧2 − 2𝑥3 ) = (35 − 4(1.8428) − 2(0.9876)) = 1.5090
17 17
1 1
𝑧3 = 10 (24 − 𝑥3 − 3𝑦3 ) = 10 (24 − 0.9876 − 3(1.5090)) = 1.8485
Therefore, approximate solution of the given system of equations is
𝑥 = 0.9876, 𝑦 = 1.5090, 𝑧 = 1.8485

Maths dept. Dr. HNNCE, Bengaluru-70

38
5.6 Rayleigh’s power method

Introduction:

 This method is useful to find the largest Eigen value and its corresponding Eigen
vector.
 If initial Eigen vector is not given, take [1 0 0]𝑇 as an initial Eigen vector.
Problems:

1. Using Rayleigh’s power method find the the largest eigen value and the
4 1 −1
corresponding eigen vector of the matrix ( 2 3 −1) by taking [𝟏 𝟎 𝟎]𝑻 as
−2 1 5
initial eigen vector [carry out 6 iterations]. (MQP 1)

4 1 −1 1 4 1
(2 3 −1) (0) =( 2 ) = 4 ( 0.5 )
−2 1 5 0 −2 −0.5

4 1 −1 1 5 1
(2 3 −1 ) ( 0.5 ) = ( 4) = 5 ( 0.8 )
−2 1 5 −0.5 −4 −0.8

4 1 −1 1 5.6 1
(2 3 −1) ( 0.8 ) = ( 5.21 ) = 5.6 ( 0.93 )
−2 1 5 −0.8 −5.21 −0.93

4 1 −1 1 5.86 1
(2 3 −1 ) ( 0.93 ) = ( 5.74 ) = 5.86 ( 0.98 )
−2 1 5 −0.93 −5.74 −0.98

4 1 −1 1 5.96 1
(2 3 −1) ( 0.98 ) = ( 5.9 ) = 5.96 ( 0.99 )
−2 1 5 −0.98 −5.9 −0.99

4 1 −1 1 5.98 1
(2 3 −1 ) ( 0.99 ) = ( 5.98 ) = 5.98 ( 1)
−2 1 5 −0.99 −5.98 −1

Maths dept. Dr. HNNCE, Bengaluru-70

39
1
After 6 iterations, largest eigen value is 5.98, The corresponding eigen vector is ( 1 ) .
−1
2. Find the largest eigen value and the corresponding eigen vector of
𝟔 −𝟐 𝟐
[−𝟐 𝟑 −𝟏] with the initial approximate eigen vector [𝟏 𝟎 𝟎]𝑻 (MQP 2)
𝟐 −𝟏 𝟑

6 −2 2 1 6 1
(−2 3 −1) (0) =( 2 ) = 6 ( 0.33 )
2 −1 3 0 −2 −0.33

6 −2 2 1 4.68 1
(−2 3 −1) ( 0.33 ) = (−0.68) = 4.68 (−0.15)
2 −1 3 −0.33 0.68 0.15

6 −2 2 1 6.6 1
(−2 3 −1) (−0.15) = (−2.6) = 6.6 (−0.4)
2 −1 3 0.15 2.6 0.4

6 −2 2 1 7.6 1
(−2 3 −1) (−0.4) = (−3.6) = 7.6 (−0.47)
2 −1 3 0.4 3.6 0.47

6 −2 2 1 7.88 1
(−2 3 −1) (−0.47) = (−3.88) = 7.88 (−0.5)
2 −1 3 0.47 3.88 0.5

6 −2 2 1 8 1
(−2 3 −1 −0.5 = −4 = 8 −0.5)
) ( ) ( ) (
2 −1 3 0.5 4 0.5

After 6 iterations, largest eigen value is 8

1
The corresponding eigen vector is (−0.5) .
0.5

Maths dept. Dr. HNNCE, Bengaluru-70

40
3. Find the largest eigen value and the corresponding eigen vector for
𝟔 −𝟐 𝟐
𝑨 = (−𝟐 𝟑 −𝟏) with initial vector (𝟏 𝟏 𝟏)𝑻 [Carryout 5 iterations.]
𝟐 −𝟏 𝟑
(July 2021 18MAT11)

6 −2 2 1 6 1
(−2 3 −1 1)
) ( = ( 0) = 6( 0 )
2 −1 3 1 4 0.67

6 −2 2 1 7.34 1
(−2 3 −1) ( 0 ) = (−2.67) = 7.34 (−0.36)
2 −1 3 0.67 4.01 0.55

6 −2 2 1 7.82 1
(−2 3 ) (
−1 −0.36 ) = (−3.63 ) = 7.82 ( −0.46)
2 −1 3 0.55 4.01 0.51

6 −2 2 1 7.94 1
(−2 3 −1) (−0.46) = (−3.89) = 7.94 (−0.49)
2 −1 3 0.51 3.99 0.5

6 −2 2 1 7.98 1
(−2 3 −1) (−0.49) = (−3.97) = 7.98 (−0.5)
2 −1 3 0.5 3.99 0.5

After 5 iterations, largest eigen value is 7.98

1
The corresponding eigen vector is (−0.5) .
0.5

Maths dept. Dr. HNNCE, Bengaluru-70

41
4. Using Rayleigh’s power method find the largest eigen value and the corresponding
2 0 1
eigen vector of the matrix (0 2 0) by taking [𝟏 𝟎 𝟎]𝑻 as initial eigen vector
1 0 2
[carry out 5 iterations]. (Jan 20, 18MAT11)

2 0 1 1 2 1
(0 2 0) (0) = (0) = 2( 0 )
1 0 2 0 1 0.5

2 0 1 1 2.5 1
(0 2 0) ( 0 ) =(0 ) = 2.5 ( 0 )
1 0 2 0.5 2 0.8

2 0 1 1 2.8 1
(0 2 0) ( 0 ) =(0 ) = 2.8 ( 0 )
1 0 2 0.8 2.6 0.93

2 0 1 1 2.93 1
(0 2 0) ( 0 ) = ( 0 ) = 2.93 ( 0 )
1 0 2 0.93 2.86 0.98

2 0 1 1 2.98 1
(0 2 0) ( 0 ) = ( 0 ) = 2.98 ( 0 )
1 0 2 0.98 2.96 0.99

After 5 iterations, largest eigen value is 7.98

1
The corresponding eigen vector is (−0.5) .
0.5

Maths dept. Dr. HNNCE, Bengaluru-70

42
5. Using Rayleigh’s power method find the largest eigen value and the corresponding
25 1 2
eigen vector of the matrix ( 1 3 0 ) by taking [𝟏 𝟎 𝟎]𝑻 as initial eigen
2 0 −4
vector [carry out 7 iterations]. (MQP 1, 18MAT11)

25 1 2 1 25 1
(1 3 0 ) (0) =(1) = 25 (0.04)
2 0 −4 0 2 0.08

25 1 2 1 25.2 1
(1 3 0 ) (0.04) = (1.12) = 25.2 (0.04)
2 0 −4 0.08 1.68 0.07

25 1 2 1 25.18 1
(1 3 0 ) (0.04 ) = ( 1.12 ) = 25.18 (0.04)
2 0 −4 0.07 1.72 0.07

25 1 2 1 25.18 1
(1 3 0 ) (0.04) = ( 1.12 ) = 25.18 (0.04)
2 0 −4 0.07 1.72 0.07

Two consecutive iterations give the same eigen value and eigen vector.

Largest eigen value is 25.18

1
The corresponding eigen vector is (0.04) .
0.07

Maths dept. Dr. HNNCE, Bengaluru-70

43
6. Find the largest eigen value and the corresponding eigen vector of the matrix
−2 0 −1
(1 −1 1 ). Perform 5 iterations by taking the initial eigen vector as
2 2 0
[𝟏 𝟏 𝟏] 𝑻 .

−2 0 −1 1 −3 −0.75
(1 −1 1 ) (1) =( 1 ) = 4 ( 0.25 )
2 2 0 1 4 1

−2 0 −1 −0.75 0.5 0.5

(1 −1 1 ) ( 0.25 ) = ( 0 ) = 1( 0 )
2 2 0 1 −1 −1

−2 0 −1 0.5 0 0
(1 −1 1 ) ( 0 ) = (−0.5) = 1 (−0.5)
2 2 0 −1 1 1

−2 0 −1 0 −1 0.067
(1 −1 1 ) (−0.5) = (1.5) = 1.5 ( 1 )
2 2 0 1 −1 0.067

−2 0 −1 0.067 2.74 1
(1 −1 1 ) ( 1 ) = (−0.866) = 2.74 (0.316)
2 2 0 0.067 2.134 0.779

After 5 iterations, largest eigen value is 25.18

1
The corresponding eigen vector is (0.04) .
0.07

Maths dept. Dr. HNNCE, Bengaluru-70

44
7. Find the largest eigen value and the corresponding eigen vector of the matrix
𝟐 −𝟏 𝟎
(−𝟏 𝟐 −𝟏) by Rayleigh’s power method. (May 22)
𝟎 −𝟏 𝟐

Take (1 0 0)𝑇 as an initial eigen vector.

2 −1 0 1 2 1
(−1 2 −1 0)
) ( = (−1) = 2 (−0.5)
0 −1 2 0 0 0

2 −1 0 1 2.5 1
(−1 2 −1) (−0.5) = (−2) = 2.5 (−0.8)
0 −1 2 0 0.5 0.2

2 −1 0 1 2.8 1
(−1 2 ) (
−1 −0.8 ) = ( −2.8) = 2.8 ( −1 )
0 −1 2 0.2 1.2 0.43

2 −1 0 1 3 0.87
(−1 2 −1) ( −1 ) = (−3.43) = 3.43 ( −1 )
0 −1 2 0.43 1.86 0.54

2 −1 0 0.87 2.74 0.76

(−1 2 −1) ( −1 ) = (−3.41) = 3.41 ( −1 )
0 −1 2 0.54 2.08 0.65

After 5 iterations, largest eigen value is 3.41

0.76
The corresponding eigen vector is ( −1 ) .
0.65

Maths dept. Dr. HNNCE, Bengaluru-70

45
8. Find the largest eigen value and the corresponding eigen vector of the matrix
𝟏 −𝟑 𝟐
(𝟒 𝟒 −𝟏) by Rayleigh’s power method.
𝟔 𝟑 𝟓

Take (1 0 0)𝑇 as an initial eigen vector.

1 −3 2 1 1 0.167
(4 4 −1 0)
) ( = ( 4) = 6 (0.667)
6 3 5 0 6 1

1 −3 2 0.167 0.166 0.021

(4 4 −1) (0.667) = (2.336) = 8.003 (0.292)
6 3 5 1 8.003 1

1 −3 2 0.021 1.145 0.191

(4 4 ) (
−1 0.292 ) = (0.252) = 6.002 (0.042)
6 3 5 1 6.002 1

1 −3 2 0.191 2.065 0.329

(4 4 −1) (0.042) = (−0.068) = 6.272 (−0.011)
6 3 5 1 6.272 1

1 −3 2 0.329 2.326 0.335

(4 4 −1 −0.011 = 0.272 = 6.941 0.04 )
) ( ) ( ) (
6 3 5 1 6.941 1

After 5 iterations, largest eigen value is 6.941

0.335
The corresponding eigen vector is ( 0.04 ) .
1

Maths dept. Dr. HNNCE, Bengaluru-70

Common questions