Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (0 votes)
1 views

Linear Equations Using Matrices

The document outlines the aims and objectives of understanding matrix structures and solving systems of linear equations, emphasizing the importance of algebraic skills and logical thinking. It explains linear equations, matrix representation, and the Gaussian elimination method for solving systems of equations. Two examples illustrate the application of Gaussian elimination to find solutions for systems of linear equations in three variables.

Uploaded by

Sohom Dutta
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views

Linear Equations Using Matrices

The document outlines the aims and objectives of understanding matrix structures and solving systems of linear equations, emphasizing the importance of algebraic skills and logical thinking. It explains linear equations, matrix representation, and the Gaussian elimination method for solving systems of equations. Two examples illustrate the application of Gaussian elimination to find solutions for systems of linear equations in three variables.

Uploaded by

Sohom Dutta
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

AIMS AND OBJECTIVES

• Understanding Matrix Structure.


• Simplifying Data Representation.
• Solving Systems of Equations
• Enhancing Problem-Solving Skills
• Building a Foundation for Further Study
• Understanding Linear Relationships
• Solving Real-World Problems
• Developing Algebraic Skills
• Encouraging Logical Thinking
• Enhancing Computational Proficiency
PREVIOUS KNOWLEDGE ON LINEAR EQUATIONS
An equation is a mathematical statement, which has an equal sign (=) between the algebraic
expression. Linear equations are the equations of degree 1. It is the equation for the straight
line. The solutions of linear equations will generate values, which when substituted for the
unknown values, make the equation true. In the case of n variables, each solution may be
interpreted as the Cartesian coordinates of a point of the Euclidean plane. The solutions of a
linear equation form a line in the Euclidean plane, and, conversely, every line can be viewed as
the set of all solutions of a linear equation in two variables. This is the origin of the
term linear for describing this type of equation. More generally, the solutions of a linear equation
in n variables form a hyperplane in the Euclidean space of dimension n.
In our case, we are dealing with linear equations in three variables:
If a, b, c and r are real numbers (and if a, b, and e are not all equal to 0) then ax + by + cz = r is
called a linear equation in three variables. (The "three variables" are the x, the y, and the z.) The
numbers a, b, and c are called the coefficients of the equation. The number r is called the
constant of the equation.
Visualizing Solutions to a System of
Three Equations in Three Variables
PREVIOUS KNOWLEDGE ON MATRIX
Matrix is a set of numbers arranged in rows and columns so as to form a rectangular two
dimensional array. Such an array is enclosed by [ ] or ( ) 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. Matrices are commonly related to linear
algebra. Matrices provide a method of organizing, storing, and working with mathematical
information. Matrices have an abundance of applications and use in the real world. Matrices
provide a useful tool for working with models based on systems of linear equations.
The rows are horizontal parts of the array and the columns are the vertical ones. If a matrix had
m rows and n columns, then we say that the matrix has size m×n. We call this an m by n matrix.
Matrices are usually symbolized using upper-case letters (such as A in the example), while the
corresponding lower-case letters, with two subscript indices (e.g., a11, or a1,1), represent the
entries.
EXAMPLE:
A=
This is a matrix A which is of the order 2 × 3 and the element a11 =1
MATRICE
S
Solving Linear Equations using Matrix Method
A system of linear equations with various unknown factors is known as a system of linear
equations. Unknown factors can be found in various equations, as we all know. To check all of the
equations that make up the system, we must find the value for the unknown factors. We can
state that the given system is a consistent independent system if there is a single solution that
indicates one value for each unknown factor. If there are several solutions, the system has an
infinite number of solutions, then we call it a consistent dependent system. The solution to a
system of equations in three variables is the set of all ordered triples that satisfy all of the
equations of the system.
GAUSS ELIMINATION METHOD
In mathematics, Gaussian elimination, also known as row reduction, is an algorithm for
solving systems of linear equations. . It consists of a sequence of row-wise operations
performed on the corresponding matrix of coeffi cients. The method is named after Carl
Friedrich Gauss, a German mathematician.
To perform row reduction on a matrix, we have to complete a sequence of elementary row
operations to transform the matrix till we get 0s (i.e., zeros) on the lower left-hand corner of the
matrix as much as possible. That means the obtained matrix should be an upper triangular matrix.
Row reduction is a technique that consists of two stages: forward elimination and back
substitution. The difference between these two Gaussian elimination method phases is the output
they create, not the activities we can perform through them. The row reduction required to
simplify the matrix in question into its echelon form is referred to as the forward elimination step.
A goal of this stage is to demonstrate if the system of equations represented in the matrix has a
single feasible solution, an unlimited number of solutions, or no solution at all.
If it is discovered that the system has no solution, there is no need to proceed to the next stage of
row reduction.
The Gaussian elimination with the back substitution step is carried out if solutions for the
variables involved in the linear system can be found. This final step yields a reduced echelon form
of the matrix, which yields the system of linear equations' general solution.
The Gaussian elimination rules are the same as the rules for the three basic row operations, in
other words, we can algebraically act on a matrix's rows in the following three ways:
•Interchanging two rows, for example, R2 ↔ R3
•Multiplying a row by a constant, for example, R1 → kR1 where k is some nonzero number
•Adding a row to another row, for example, R2 → R2 + 3R1
Example 1
Solve the given set of equations by using Gauss elimination method:
x+y+z=4 x + 4y + 3z = 8 x + 6y + 2z = 6
Now convert the equations in matrix form.
[the matrix operations have been shown beside]
The above matrix is the resulting matrix. Hence convert the above matrix in equation
form to get the values of x, y, z. The final equations are as follows:
x+y+z=4
3y + 2z = 4
7y = 0
From this set, we can automatically observe that the value of the variable y is equal to
0. Now by using this knowledge to substitute it in other equations to solve for x and z.
1. y=0
2. 3*0 + 2z = 4
z=2
3. x+y+z=4
x+0+2=4
x=2
Example 2
Solve the following system using Gaussian elimination :

x-2y+z=0 2x+y-3z=5 4x-7y+z=-1

The augmented matrix which represents this system is

The first goal is to produce zeros below the first entry in the first column,
which translates into eliminating the first variable, x, from the second and third equations. T
he row operations which accomplish this are as follows:

The second goal is to produce a zero below the second entry in the second column, which
translates into eliminating the second variable, y, from the third equation. Now, add −5 times
the second row to the third row:

Since the coefficient matrix has been transformed into echelon form, the “forward” part of Gaussian elimination is complete. What
remains now is to use the third row to evaluate the third unknown, then to back‐substitute into the second row to evaluate the
second unknown, and, finally, to back‐substitute into the first row to evaluate the first unknown.
The third row of the final matrix translates into 10 z = 10, which gives z = 1. Back‐substitution of this value into the second row,
which represents the equation y − 3 z = −1, yields y = 2. Back‐substitution of both these values into the first row, which represents
the equation x − 2 y + z = 0, gives x = 3. The solution of this system is therefore (x, y, z) = (3, 2, 1).
THANK YOU

You might also like