Skip to content

wise-saint/Gauss-Seidel_Method

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Gauss-Seidel_Method

Solution of system of linear equations.

An iterative method to solve a system of linear equations, AX = B.

A general linear iterative method for the solution of the system of
linear equations is defined as :
X(k+1) = H*X(k) + c where k = 0,1,2... and
X(k+1) and X(k)) are the (k+1)th and kth iterations for X.
H is called the iteration matrix.

In the limiting case when k -> ∞, X(k) converges to the exact solution. X = A(-1)B

For Gauss-Seidel Iteration Method :-
Assumption : Diagonal entries of coefficient matrix A are pivot elements.
H = -(D + L)-1*U and
c = (D + L)-1*B where
D is the diagonal matrix, L & U are respectively
lower and upper triangular matrices with zero diagonal entries such that
A = L + D + U

Releases

No releases published

Packages

 
 
 

Languages