Algoritma Metode Iterasi Jacobi

INPUT :

n, A, b, dan hampiran awal Y=(y1 y2 y3…yn)T , batas toleransi T, dan maksimum iterasi N

OUTPUT :

X=(x1 x2 x3…xn)T, vektor galat hampiran g, dan H yang merupakan matriks dengan baris vektor-vektor hampiran selama iterasi.
  1. Set penghitung iterasi k=1
  2. WHILE k < = NDO
    1. FOR i = 1,2,3,…,n, Hitung x_i = \frac{1}{a_{ii}} \left(b_i -\sum_{j\ne i}a_{ij}y_j\right)
    2. SET X = (x1x2x3xn)T
    3. IF ||X_Y||<T THEN STOP
    4. Tambah penghitung iterasi, k = k + 1
    5. FOR i = 1,2,3,…,n, Set yi=xi
    6. SET Y=(y1 y2 y3…yn)T
  3. Tulis pesan “Metode gagal setelah N iterasi”
  4. STOP
About these ads

Posted on October 17, 2011, in education and tagged , , , , , , , . Bookmark the permalink. 2 Comments.

  1. rumit juga ni algoritmanya
    nice share gan..

  2. Pake pemrograman apa nic?
    Dulu aq cuma materinya aja gak sampe praktek pemrograman iterasi jacobi

LEAVE A COMMENT IN HERE. COMMENTING IN HERE IS ALWAYS AUTO APPROVE. PLEASE NO SPAM!!! BECAUSE I HATE SPAM... THANKS A LOT..... :mrgreen:

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

Follow

Get every new post delivered to your Inbox.

Join 1,778 other followers

%d bloggers like this: