Scribd
Upload
29 views

Course Title: Numerical Computing

This document provides information about the Numerical Computing course offered on Wednesdays from 12:30 to 2:00 pm. The lecture covers the Gauss-Jacobi method, an iterative technique for solving systems of equations. It assumes the coefficient matrix is strictly diagonally dominant with non-vanishing diagonal elements. The method writes the system in a form where each unknown is explicitly defined in terms of others from the previous iteration. Examples are provided and students are assigned class work.

Uploaded by

Niaz Ahmed Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
29 views

Course Title: Numerical Computing

This document provides information about the Numerical Computing course offered on Wednesdays from 12:30 to 2:00 pm. The lecture covers the Gauss-Jacobi method, an iterative technique for solving systems of equations. It assumes the coefficient matrix is strictly diagonally dominant with non-vanishing diagonal elements. The method writes the system in a form where each unknown is explicitly defined in terms of others from the previous iteration. Examples are provided and students are assigned class work.

Uploaded by

Niaz Ahmed Khan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 16

Course Code: ECE 204

Course Title: Numerical Computing


Class Day: Wednesday Timing: 12:30 to 02:00

Lecture / Week No. : Lecture 9

Instructor Name: Sameen Fatima

Department of Software Engineering


Contents

1. Gauss Jacobi Method

2. Introduction

3. Solved examples

4. Class Assignmnment
Reference No. 1 Topic: Gauss Jacobi Method
Jacobi’s Method
This is an iterative method, where initial approximate solution to a given system of equations is assumed and is improved
towards the exact solution in an iterative way.
In general, when the coefficient matrix of the system of equations is a sparse matrix (many elements are zero), iterative
methods have definite advantage over direct methods in respect of economy of computer memory.
Such sparse matrices arise in computing the numerical solution of partial differential equations
Let us consider

In this method, we assume that the coefficient matrix [A] is strictly diagonally dominant, that is, in each row of [A] the
modulus of the diagonal element exceeds the sum of the off-diagonal elements.
We also assume that the diagonal element do not vanish. If any diagonal element vanishes, the equations can always be
rearranged to satisfy this condition.
Now the above system of equations can be written as
Reference No. 1 Topic: Gauss Jacobi Method
Reference No. 1 Topic: Gauss Jacobi Method
Reference No. 1 Topic: Gauss Jacobi Method
Reference No. 1 Topic: Gauss Jacobi Method
Reference No. 1 Topic: Gauss Jacobi Method
Reference No. self Topic: Gauss Jacobi Method
Reference No. self Topic: Gauss Jacobi Method
Reference No. self Topic: Gauss Jacobi Method
Reference No. self Topic: Gauss Jacobi Method
Reference No. self Topic: Gauss Jacobi Method
Reference No. self Topic: Gauss Jacobi Method
Reference No. self Topic: Gauss Jacobi Method
References Topic: Gauss Jacobi Method

https://vulms.vu.edu.pk/Courses/MTH603/Downloads/Handouts%20MTH603.pdf

You might also like