Scribd
Upload
326 views11 pages

Numerical Methods PPT AYUSH MISHRA

The document describes a presentation on the Jacobi iteration method for solving systems of linear equations. The Jacobi method works by iteratively solving for each variable in terms of the most recent approximations for the other variables. This process is repeated until the approximations converge to within a specified tolerance. The key advantages are that the Jacobi method is simple and numerically robust, with each iteration being fast to compute. However, it may require many iterations to converge and does not converge as quickly as related methods like Gauss-Seidel.

Uploaded by

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

Numerical Methods PPT AYUSH MISHRA

The document describes a presentation on the Jacobi iteration method for solving systems of linear equations. The Jacobi method works by iteratively solving for each variable in terms of the most recent approximations for the other variables. This process is repeated until the approximations converge to within a specified tolerance. The key advantages are that the Jacobi method is simple and numerically robust, with each iteration being fast to compute. However, it may require many iterations to converge and does not converge as quickly as related methods like Gauss-Seidel.

Uploaded by

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

NAME- AYUSH MISHRA PRESENTED TO : Mrs.

NEELAM
ROLL NO- 21/1456 PAHWA MAM

COURSE • BSC (HONS) ELECTRONICS

SUBJECT • NUMERICAL ANALYSIS

PRESENTATION ON • JACOBIAN ITERATION METHOD


INDEX
* General Introduction of Jacobi Iteration Method.
* Basic idea of Jacobi Iteration Method.
* Numerical algorithm of Jacobi Iteration Method.
* Advantages of Jacobi Iteration Method.
* Limitations of Jacobi Iteration Method.
General Introduction of Jacobi Iteration Method

Jacobi iterative method is considered as an iterative algorithm which is used for


determining the solutions for the system of linear equations in numerical linear
algebra.

In this method, an approximate value is filled in for each diagonal element. Until it
converges, the process is iterated.

The Jacobi iteration is the simplest of the classical iterative methods and, generally,
the slowest. However, it forms a basis for the understanding of other methods, such as
Gauss-Seidel .
Basic idea of Jacobi Iteration Method
Two assumptions made on Jacobi Method:
1.The system given by
a11x1 +a12x2+… a1nxn
=b 1 a21x1 +a22x2+…
a2nxn =b 2 an1x1 +an2x2+
… annxn =b n
Has a unique solution.
2.The coefficient matrix A has no zeros on its
main diagonal, namely a11, a22 ,ann are nonzeros.

Main idea of Jacobi method :


To begin, solve the 1st equation for x1, the 2nd
equation for x2 and so on to obtain the rewritten
equations:
Then make an initial guess of the solution . Substitute these values into the right hand side the
of the rewritten equations to obtain the first approximation,

This accomplishes one iteration.


In the same way, the second approximation is computed by substituting the first approximation’s -
vales into the right hand side of the rewritten equations.

By repeated iterations, we form a sequence of approximations .

The Jacobi Method.


For each k ≤ 1, generate the components xi(k) of x(k) from x(k-1) by,
Example: Apply the Jacobi method to solve,

Continue iterations until two successive approximations are identical when rounded to three significant
digits.

Solution :To begin, rewrite the system

Choose the initial guess x1=0, x2=0 and x3=0 .


The first approximation is ,
Continue iteration, we obtain ,
Numerical algorithm of Jacobi Iteration
Method
Input: A=[aij] , b×XO= x0 , tolerance TOL, maximum number of iterations N.

Step 1: Set K=1


Step 2: While (k ≤ N) do step 3-6.
Step 3: For for i= 1,2,…n .

Step 4: If │ |x-X0| │< TOT Then OUTPUT (x1,x2,x3,..xn) ;


Step 5: Set k=k+1.
Step 6: For for i = 1,2,….n
Set XOi= xi
Step 7: OUTPUT (x1,x2,x3,
…xn);\
STOP
Another stopping criterion in Step 4:
Advantages of Jacobi Iteration Method
Here are some advantages of Jacobi Iteration Method

1. It is simple and numerically robust.

2. Each iterations quite fast.

3. It is highly desirable for many applications.

4. The Jacobi method first generate inexact result and subsequently refines its result
at each iteration , with the residuals Converging at an exponential rate.
Limitations of Jacobi Iteration Method
•Here are some Limitations of Jacobi Iteration Method

1. The iterative process is terminated when a convergence criterion is


satisfied. Unlike the Gauss-Seidel method, the previous estimations are
not instantly replaced by the new values in Jacobi method, thus the
storage space required is twice the Gauss-Seidel method and the
convergence rapidness is lower.
3.It might require many iterations.
4.If the linear system is ill-conditioned, it is most probably that the
Jacobi method will fail to converge.

You might also like