[go: up one dir, main page]
Scribd
Upload
28 views37 pages

Unit - I

The document discusses solving homogeneous systems of linear equations using Gaussian elimination. It explains that Gaussian elimination involves using row operations to transform the coefficient matrix into reduced row echelon form. This results in either the unique solution of all variables equal to zero, or an infinite number of solutions if the number of variables is greater than the rank of the matrix.

Uploaded by

ADIL RIZVI
Copyright
© © All Rights Reserved
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
28 views37 pages

Unit - I

The document discusses solving homogeneous systems of linear equations using Gaussian elimination. It explains that Gaussian elimination involves using row operations to transform the coefficient matrix into reduced row echelon form. This results in either the unique solution of all variables equal to zero, or an infinite number of solutions if the number of variables is greater than the rank of the matrix.

Uploaded by

ADIL RIZVI
Copyright
© © All Rights Reserved
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
You are on page 1/ 37

⇒ 𝑡𝑟 𝐴 = ෍ 𝑎𝑖𝑖

1. Apply E – transformation (interchanging of row or


column) to obtain a non – zero element in the first row
and first column i.e., 𝑎11 called pivot. If this element is
not unity (1), make it unity by dividing the elements of
this first row by this pivot (non – zero) element.

2. Add appropriate multipliers of the first row to the other


rows to reduce the other elements of the first column to
zero.
3. Use similar operations for columns to reduce the other
elements of the first row to zero.
4. Now using the element 𝑎22 as the pivot, repeat steps
1, 2 and 3 to reduce the elements of second row and
second column to zero.
5. Continue this process down the main diagonal till the
end of the diagonal is reached or until all the
remaining elements in the matrix become zero.
Consider the following system of 𝑚 linear equations in 𝑛
unknowns 𝑥1 , 𝑥2 , … … … … , 𝑥𝑛

𝑎11 𝑥1 + 𝑎12 𝑥2 + … … … … + 𝑎1𝑛 𝑥𝑛 = 0


𝑎21 𝑥1 + 𝑎22 𝑥2 + … … … … + 𝑎2𝑛 𝑥𝑛 = 0 ቑ … (1)
……………………………………….
𝑎𝑚1 𝑥1 + 𝑎𝑚2 𝑥2 + … … … … + 𝑎𝑚𝑛 𝑥𝑛 = 0
The constant terms on RHS of each equation of the system
(1) is zero. Therefore, the system is called homogeneous.
This can be put in the matrix equation form as follows:

𝑎11 𝑎12 …… 𝑎1𝑛 𝑥1 0


𝑎21 𝑎22 …… 𝑎2𝑛 𝑥2 = 0
… … …… … … …
𝑎𝑚1 𝑎𝑚2 …… 𝑎𝑚𝑛 𝑥𝑛 0
⇒ 𝐴𝑋 =0

Where A is the coefficient matrix, X is the column matrix


of unknowns and 0 is the null matrix.
• The rank of the coefficient matrix A and its augmented

matrix 𝐴 𝐵 are same, therefore, the system is consistent.

• One of the solution of homogeneous system is

𝑥1 = 𝑥2 = … … … … = 𝑥𝑛 = 0

which is known as zero or trivial solution.


• One of the solution of homogeneous system is 𝑥1 = 𝑥2 =

… … … … = 𝑥𝑛 = 0 which is known as zero or trivial


solution.

• When 𝑚 = 𝑛, the coefficient matrix is nonsingular, then

the unique solution will be only 𝑥1 = 𝑥2 = … … … … =


𝑥𝑛 = 0
• When 𝑚 > 𝑛 & 𝜌 𝐴 = 𝑟 = 𝑛 , then by the row
transformations the system can be reduced into 𝑛
equations, and then the system will have unique solution
𝑥1 = 𝑥2 = … … … … = 𝑥𝑛 = 0

• When 𝑚<𝑛 and 𝜌 𝐴 = 𝑟 ≤ 𝑚 , then by row


transformation, they system of equations can be expressed
as follows:
𝑎11 𝑥1 + 𝑎12 𝑥2 + … … … … + 𝑎1𝑛 𝑥𝑛 = 0
0 ∙ 𝑥1 + 𝑎22 𝑥2 + … … … … + 𝑎2𝑛 𝑥𝑛 = 0
……………………………………….
0 ∙ 𝑥1 + 0 ∙ 𝑥2 + … … … … 𝑎𝑛 𝑥𝑟 + … + … + 𝑎𝑚 𝑥𝑛 = 0

Here there are 𝑛 − 𝑟 + 1 unknown quantities. Therefore,

giving arbitrary value to any of 𝑛 − 𝑟 , infinite number of

solutions of the system can be obtained.

You might also like