PERSAMAAN LINIER

A. Analisa Masalah

Menyelesaikan persamaan linier

B. Deklarasi Input Output

Input :

N                     : Integer

Tampung           : Integer

A[0..9][0..9], b[0..9],x[0..9]       :Integer

Output:

C. Algoritma:

Deklarasi:

n= integer

A[0..9][0..9], b[0..9],x[0..9]=integer

Deskripsi:

For I ß 0 to n do

For j ß 0 to n do

Read à A[i][j]

End for

End for

For I ß0 to n do

Read à b[i]

//proses

For I ß 1 to n do

For j ß 0 to n do

A[i][j]= A[i][j]+((-1)* A[i-1][j])

B[i]=B[i]+((-1*[b0])

End for

End for

For I ß n-1don to 0 do

X[i]ß b[i]

For I ß 1 to n do

A[0][i]= A[0][i]*b[i]

End for

Tamping=0

For I ß 0 to n do

Tamping=tamping+ (A[0][i]*x[i])

End for

X[0]=(b[0]-tampung)div A[0][0]

Cetak : For I ß 0 to n do

Write (x[i])

D. Tes Data 

E. Program C++

#include <iostream.h>
#include <conio.h>

int main () {
int n,tampung;
int A[10][10], b[10],x[10];

for (int i=0; i<=n; i++)
{
for (int j=0; j<=n; j++)
{
A[i][j];
}
}
}
for (int i=0; i<=n; i++)
cin>>b[i];
{
for (int i=1; i<=n; i++)
{
for (int j=0; j<=n; j++)
cin>>A[i][j]=A[i][j]+((-i)*A[i-1][j]);
b [i]=b[i]+(-1*b[0]);
}
}
for (int i=n-1; i<=0; i--)
{
x[i]=[b[i];
}
for (int i=0; i<=n; i++)
{
A[0][i]=A[0][i]*b[i];
}
tampung=0;
for (int i=0; i<=n; i++)
{
tampung=tampung+(A[0][i]*[i]);
}
x[0]=(b[0]-tampung)/A[0][0];

getch ();
}

Selamat Mencoba, Moga berhasil

Share This :

Related Templates