Scribd
Upload
21 views9 pages

NMST Unit 2

Simultaneous linear equations are systems of linear equations that can be solved using direct methods like Gauss Elimination and Gauss-Jordan, or iterative methods such as Jacobi's and Gauss-Seidel. Direct methods provide exact solutions but may be computationally intensive for large systems, while iterative methods offer approximate solutions that can be refined over iterations. The choice of method depends on the problem's complexity, size, and the required accuracy.

Uploaded by

shahruks1808
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
21 views9 pages

NMST Unit 2

Simultaneous linear equations are systems of linear equations that can be solved using direct methods like Gauss Elimination and Gauss-Jordan, or iterative methods such as Jacobi's and Gauss-Seidel. Direct methods provide exact solutions but may be computationally intensive for large systems, while iterative methods offer approximate solutions that can be refined over iterations. The choice of method depends on the problem's complexity, size, and the required accuracy.

Uploaded by

shahruks1808
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/ 9

SimultaneouS linear

equationS

Simultaneous linear equations are systems of equations in


which each equation is linear, meaning the highest degree
of each variable is 1. These equations can be solved using a
variety of methods, depending on the nature of the system
and the desired accuracy. The solution of simultaneous
linear equations is fundamental in various scientific,
engineering, and computational problems.
This article will explain both direct methods and iterative
methods used to solve these systems. The methods
discussed include Gauss Elimination, Gauss-Jordan,
Jacobi’s method, and Gauss-Seidel method.
1. Simultaneous Linear Equations:
A system of simultaneous linear equations is a set of
equations that share common variables. The general form
of a system of simultaneous linear equations in ‘n’
variables is:
Where:
• are the unknown variables,
• are the coefficients of the system,
• are the constants on the right-hand side
of the equations.
The goal is to find the values of that satisfy all
equations simultaneously.

2. Direct Methods
Direct methods provide an exact solution to the system of
equations in a finite number of steps. Two widely used
direct methods are Gauss Elimination and Gauss-Jordan
Elimination.
2.1 Gauss Elimination Method
The Gauss Elimination Method is a systematic approach used
to solve a system of linear equations by transforming the
system’s augmented matrix into an upper triangular form
and then performing back-substitution.
Steps of Gauss Elimination:
1. Form the Augmented Matrix: Convert the system of
equations into an augmented matrix.
Example: Consider the following system of equations:
The augmented matrix will be:

2. Forward Elimination: Apply row operations to convert


the matrix to an upper triangular form. The goal is to
eliminate variables step-by-step from the lower rows.
3. Back Substitution: After obtaining the upper triangular
matrix, perform back substitution to find the unknown
values of
Example:
For the system above, after forward elimination, we would
perform back substitution to find the values of and
2.2 Pivoting in Gauss Elimination
Pivoting is a technique used during Gauss Elimination to
improve the accuracy of the solution. In partial pivoting,
the largest possible element in each column is moved to
the diagonal to minimize rounding errors. This technique is
important in ensuring numerical stability.
2.3 Gauss-Jordan Method
The Gauss-Jordan method is an extension of Gauss
Elimination that aims to simplify the matrix further to the
reduced row echelon form (RREF). This method eliminates
the need for back substitution as the solution is directly
obtained after the reduction.

Steps of Gauss-Jordan:
1. Form the Augmented Matrix: The system is first written
in augmented matrix form.
2. Row Operations: Use elementary row operations to
transform the matrix into the reduced row echelon
form.
3. Extract the Solution: Once the matrix is in RREF, the
solutions for the unknowns are immediately available.
Example:
For the same system of equations, after applying Gauss-
Jordan reduction, you will have the solutions in the matrix
form that directly represent the values of and

3. Iterative Methods
While direct methods give the exact solution, iterative
methods are used to obtain an approximate solution by
starting with an initial guess and refining it through
repeated iterations. These methods are often used for
large systems of equations where direct methods may be
computationally expensive.
3.1 Jacobi’s Method
The Jacobi method is an iterative technique where each
equation is solved for one unknown, and the values of the
other unknowns are treated as constants. The method is
repeated until the solution converges to the desired
accuracy.
Steps of Jacobi’s Method:

1. Rearrange the Equations: Each equation is solved for


one variable in terms of the others.
For example, for the system:

Rearrange each equation to express and in terms of


the other variables:
2. Choose an Initial Guess: Start with an initial guess for
and
3. Iterate: Substitute the values of the previous iteration
into the equations to find the new values of and
4. Repeat: Repeat the process until the solution converges,
i.e., the values of and no longer change
significantly.
3.2 Gauss-Seidel Method
The Gauss-Seidel method is similar to the Jacobi method, but
with one important difference: in Gauss-Seidel, the
updated values are used immediately in subsequent
calculations within the same iteration.
Steps of Gauss-Seidel Method:

1. Rearrange the Equations: Like the Jacobi method, each


equation is solved for one variable in terms of the
others.
2. Choose an Initial Guess: Start with an initial guess for
and
3. Iterate: In the first iteration, substitute the values of the
previous iteration into the equations. For the second
equation onwards, use the updated value of the first
variable.
4. Repeat: Continue the iterations until the solution
converges.
Difference Between Jacobi and Gauss-Seidel:
• Jacobi: Uses values from the previous iteration.
• Gauss-Seidel: Uses updated values within the same
iteration.

4. Convergence of Iterative Methods


The convergence of an iterative method refers to how quickly
the method approaches the true solution. Not all systems
of equations guarantee convergence for iterative methods,
especially if the system is poorly conditioned. Both Jacobi
and Gauss-Seidel methods converge more quickly for
diagonally dominant systems, where the coefficient of the
unknown in each equation is greater than the sum of the
absolute values of the other coefficients.
Conclusion
Solving simultaneous linear equations is an essential aspect
of computational mathematics, and various methods are
used depending on the problem's complexity and size.
Direct methods, like Gauss Elimination and Gauss-Jordan,
provide exact solutions but can be computationally
intensive for large systems. Iterative methods, such as
Jacobi's method and Gauss-Seidel method, provide
approximate solutions that can be refined over iterations,
offering a more efficient approach for large systems.
Both types of methods have their advantages and limitations.
Direct methods are preferred when accuracy is critical, and
the system is small or moderately sized. Iterative methods,
on the other hand, are effective for large systems where
direct methods are not feasible due to computational
constraints.

You might also like