Algoritma Iterasi Gauss Seidel [PDF]

Citation preview

Sistem Persamaan Linear Algoritma penyelesaian sistem persamaan linear dengan metode Gauss-Seidel dijabarkan sebagai berikut: program metode_Gauss_Seidel; uses crt; label ulang; tyep daftar = array[0..40,0..40] of real; varia = array[0..200] of real; var mm,a,b,x : daftar; k, mf, h: varia; mn, mu: real; m, n, i, j, q: byte; ab: char; begin ulang: clrscr; write(‘Banyaknya kumpulan persamaan’); readln(n); for i:=1 to n do begin for j:=1 to n do begin write(‘Koefisien A’ ,i,j, ’:’); read(a[i,j]); end; write(Nilai H’ ,i, ‘ :’); readln (h[i]); end; for q:=1 to n do begin b[i,q]:=a[i,q]/a[i,i]; end; k[i]:=h[i]/a[i,i]; end; m:=0; for i:=1 to n do begin x[i,1]:=0.0; 1



end; clrscr; write(‘Hasil program iterasi Gauss Seidel’); writeln; write; for i:=1 to n do begin write(‘ X’ ,i, ‘ ‘); end; writeln; repeat begin m:=m+1; for i:=1 to n do begin mn:=0; for j:=1 to n do begin if j=1 then begin end else begin mn:=mn-b[i,j]*x[j,i]; end; x[j,i+1]:=x[j,i]; end; x[i,i+1]:=k[i]+mn; mf[i]:=x[i,i+1]-x[i,i]; mm[i,m]:=x[i,i+1]; end; for i:=1 to n do begin x[i,1]:=x[i,i+1]; end; mu:=0; for i:=1 to n do begin mu:=mu+abs(mf[i]); end; write(m); 2



for i:=1 to n do begin mm[i,0] :=0; write(‘ ‘,mm[i,m-1] : 10 : 5, ‘ ‘); end; writeln; end; until abs(mu)