SPL – Iterasi Gauss-Seidel

November 3, 2020

1. Penyelesaian SPL dengan Metode Iterasi Gauss-Seidel

Misal SPL yang akan diselesaikan adalah

2x1 + 3x2 – x3 = 5
4x1 + 4x2 –3x3 = 5
-2x1 + 3x2 – x3 = 1

[ ] : from IPython.display import display, Math

def print_matrix (matriks ,awal=`` ``) :

data = ` `
for baris in matriks :
if len (baris) == 1:
data += ` %.3f &`%baris + r` \ \ \n `
continue
for elemen in baris:
data += ` %.3f &`%elemen
data += r` \ \ ` + `\n`
display (Math (awal+ ` \ \ begin{pmatrix} \n%s\end{pmatrix}`%data))

[ ] : from IPtyphon.display import Latex, HTML, display, Markdown

From tabulate import tabulate
Import sys

# A= [ [2,3,-1] , [4,4,-3] , [-2,3,-1] ]

# v = [5,3,1]

A=[ [4,-1,-1] , [-2.6.1] , [-1,1,7] ]

V=[3,9,-6]
Nawal = [0,0,0]

N=nlen(A)
X=[0]*n
P=[0]*n
nIterasi=6
for i in range(n) :
for j in range(n) :
if i == j :
a[i] [j+n] = 1

# print_matrix(a)
Print_matrix (a[: , :3] , ``A=``)
Print_matrix (a[: , 3:] , ``Inv=``)
Print (``--------------------``)

For i in range (n) :

If a[i] [i] == 0.0 :
Sys.exit (`Pembagian dengan nol`)

For j in range(n) :
If i != j:
rasio = a[j] [i]/a[i][i]

for k in range(2*n) :
a[j] [k] = a[j] [k] – rasio * a[i] [k]

Print_matrix (a[: , :3] , ``A=``)

Print_matrix (a[: , 3:] , ``Inv=``)
Print (``--------------------``)