Scribd
Upload
9 views11 pages

L Systems

The document discusses various methods for solving linear equations, including elimination, substitution, matrix inversion, and iterative approaches. It emphasizes the importance of diagonal dominance for convergence in iterative methods like Jacobi and Gauss-Seidel. Additionally, it provides examples of linear systems to be solved using these methods.

Uploaded by

zamibaji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
9 views11 pages

L Systems

The document discusses various methods for solving linear equations, including elimination, substitution, matrix inversion, and iterative approaches. It emphasizes the importance of diagonal dominance for convergence in iterative methods like Jacobi and Gauss-Seidel. Additionally, it provides examples of linear systems to be solved using these methods.

Uploaded by

zamibaji
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 11

1

SOLUTION OF LINEAR EQUATIONS


INTRODUCTION

ELIMINATION APPROACH OR DIRECT APPROACH


 ELIMINATION/SUBSTITUTION METHODS
 MATRIX INVERSION METHOD
 CRAMER’S RULE
 GAUSS ELIMINATION METHOD
 GAUSS – JORDAN METHOD
 LU – FACTORIZATION METHOD
 CHOLESKY DECOMPOSITION METHOD, ETC.
GGGG
2
INDIRECT OR ITERATIVE APPROACH
 IT IS A TECHNIQUE IN WHICH ROOTS OF EQUATIONS ARE FORMED BY
SUCCESSIVE APPROXIMATION

 IT INVOLVES ASSUMPTINS OF SOME INITIAL VALUES WHICH ARE THEN


REFINED REPEATEDLY TILL THEY REACH SOME ACCEPTED LEVEL OF
ACCURACY

 THE ITERATIVE METHODS ARE OF BEST USE WHEN


 THE MATRIX OF COEFFICIENTS IS VERY LARGE, THAT IS, n=1000 OR MORE

 THE MATRIX OF COEFFICIENTS IS SPARSE (most of coefficients are

zero)

3
CONDITION OF CONVERGENCE
The condition of convergence for system of linear equations is
that linear system is diagonally dominant. The linear system of
equations is said to be diagonally dominant if in each equation,
the absolute value of diagonal coefficient is greater than or
equal to the sum of absolute values of off-diagonal coefficients
and is atleast one equation is actually greater than the sum,
that is,

ȁ𝒂𝒊𝒊ȁ≥ σ𝒏
𝒋=𝟏ห𝒂𝒊𝒋ห 𝒇𝒐𝒓 𝒂𝒍𝒍 𝒊, and
𝒋≠𝒊
ȁ𝒂𝒊𝒊ȁ> σ𝒏
𝒋=𝟏ห𝒂𝒊𝒋ห 𝒇𝒐𝒓 𝒂𝒕 𝒍𝒆𝒂𝒔𝒕 𝒐𝒏𝒆 𝒗𝒂𝒍𝒖𝒆 𝒐𝒇𝒊
𝒋≠𝒊
CONDITION FOR CONVERGENCE
 The system is strictly diagonally dominant if the absolute value
of each entry on the main diagonal is greater than the sum the
absolute values of the other entries in the same row.
 If the system is strictly diagonally dominant, then the system of
linear equations has a unique solution to which the Jacobi
Method and the Gauss Seidel Method will converge for any
initial approximation.
SOLUTION OF LINEAR EQUATIONS

 JACOBI ITERATION METHOD

 GAUSS – SEIDEL METHOD

6
JACOBI ITERATION METHOD

7
GAUSS – SEIDEL METHOD

Where is iterative step

8
Solve the following linear system by Jacobi and Gauss-

𝟏𝟎𝒙𝟏 + 𝟑𝒙𝟐 + 𝒙𝟑 = 𝟏𝟗
Seidel Method

𝟑𝒙𝟏 + 𝟏𝟎𝒙𝟐 + 𝟐𝒙𝟑 = 𝟐𝟗


𝒙𝟏 + 𝟐𝒙𝟐 + 𝟏𝟎𝒙𝟑 = 𝟑𝟓
1. 3𝒙𝟏 − 𝟐𝒙𝟐 + 𝟖𝒙𝟑 = −𝟒
𝟓𝒙𝟏 + 𝒙𝟐 − 𝒙𝟑 = 𝟏𝟐
𝒙𝟏 + 𝟔𝒙𝟐 + 𝟐𝒙𝟑 = 𝟔
2. 𝟐𝒙𝟏 − 𝒙𝟐 = 𝟏
𝒙𝟏 − 𝟓𝒙𝟐 + 𝟐𝒙𝟑 = −𝟐
𝒙𝟏 + 𝟐𝒙𝟐 + 𝟔𝒙𝟑 = 𝟗
3. 𝟐𝒙𝟏 − 𝒙𝟑 = 𝟏
𝟑𝒙𝟐 − 𝒙𝟑 = 𝟐
𝒙𝟏 + 𝟒𝒙𝟑 = 𝟓
4. 𝟐𝒙𝟏 − 𝒙𝟐 + 𝒙𝟑 = 𝟐, 𝒙𝟏 + 𝒙𝟑 = 𝟐
𝒙𝟏 − 𝒙𝟐 + 𝟑𝒙𝟑 = 𝟑
5. 𝟐𝟎𝒙𝟏 + 𝒙𝟐 − 𝟐𝒙𝟑 = 𝟏𝟕, 𝟑𝒙𝟏 + 𝟐𝟎𝒙𝟐 − 𝒙𝟑 = −𝟏𝟖
𝟐𝒙𝟏 − 𝟑𝒙𝟐 + 𝟐𝟎𝒙𝟑 = 𝟐𝟓
6.

7.

8.

9.

10.

You might also like