dark_coder Moderator
Posts : 21 Join date : 2010-10-31 Age : 33 Location : Ground
| Subject: Operasi Adjoin Matrix Thu Nov 04, 2010 9:34 pm | |
| Ne contoh programm adjoin Matrix Pada Java .. - Code:
-
import java.util.Scanner; public class adjoin_matrik { public static void main(String []args) { Scanner in=new Scanner (System.in); int [][]A=new int [10][10]; int [][]C=new int [10][10]; float [][]D=new float [10][10];
int n,m,i,j,h,k1,k2,k3,k4,k5,k6,k7,k8,k9; int a=1,b=1,c=1,d=1,e=1,f=1,g=1,k=1,l=1,o=1,p=1,q=1,r=1,s=1,t=1,u=1,v=1,w=1; int E=1,F=1,G=1,H=1,I=1,J=1; do { System.out.print("input baris ="); n=in.nextInt(); System.out.print("input kolom ="); m=in.nextInt(); } while(n!=3 || m!=3); for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { System.out.print("input elemen matrix A ["+i+","+j+"] ="); A[i][j]=in.nextInt(); } }
for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { if(i==j) a=a * A[i][j]; if(i-j==1) { b=b * A[j][i]; c=c * A[i][j]; p=p * A[i][j]; E=E * A[j][i]; } if(i-j==n-1) { b=b * A[i][j]; c=c * A[j][i]; d=d * A[j][i]; d=d * A[i][j]; o=o * A[i][j]; q=q * A[i][j]; s=s * A[j][i]; u=u * A[i][j]; u=u * A[j][i]; w=w * A[i][j]; F=F * A[j][i]; H=H * A[j][i]; } if(i<n && j>1 && i>1 && j<m && i%j==0) { d=d * A[i][j]; g=g * A[i][j]; q=q * A[i][j]; F=F * A[i][j]; I=I * A[i][j]; } if(i-j==1 && i>1 && j>1) { e=e * A[j][i]; e=e * A[i][j]; k=k * A[i][j]; k=k * A[j][i]; o=o * A[j][i]; s=s * A[i][j]; v=v * A[i][j]; G=G * A[j][i]; } if(i<n-(n-2) && j<n-(n-2)) { e=e * A[i][j]; t=t * A[i][j]; v=v * A[i][j]; G=G * A[i][j]; I=I * A[i][j]; } if(i-j==1 && i<n && j<n) { f=f * A[j][i]; f=f * A[i][j]; l=l * A[i][j]; r=r * A[j][i]; w=w * A[j][i]; H=H * A[i][j]; J=J * A[j][i]; J=J * A[i][j]; } if(i==n && j==n) { f=f * A[i][j]; g=g * A[i][j]; l=l * A[i][j]; r=r * A[i][j]; t=t * A[i][j]; } } } h=(a+b+c-d-e-f); System.out.println("determinan matrix A="+h); if(h!=0) { k1=g-k; k2=l-o; k3=p-q; k4=r-s; k5=t-u; k6=v-w; k7=E-F; k8=G-H; k9=I-J; for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { if(i==1 && j==1) { C[i][j]=k1; } else if(i==1 && j==2) { k2=-k2; C[i][j]=k2; } else if(i==1 && j==3) { C[i][j]=k3; } else if(i==2 && j==1) { k4=-k4; C[i][j]=k4; } else if(i==2 && j==2) { C[i][j]=k5; } else if(i==2 && j==3) { k6=-k6; C[i][j]=k6; } else if(i==3 && j==1) { C[i][j]=k7; } else if(i==3 && j==2) { k8=-k8; C[i][j]=k8; } else if(i==3 && j==3) { C[i][j]=k9; } else System.out.println("ERROR"); } }
for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { D[j][i]=(float)C[j][i] *1/h; System.out.print(D[j][i]+" "); } System.out.println(); } } else System.out.println("Data tidak memenuhi syarat"); } }
| |
|