Crout's LU decomposisi, sorry cuman ada algornya doang pusing banget bikin programnya kalo bisa bantuin kirim e-mail ka abah entar bisa langsung di upload
Algoritma
DO j = 2,n
a[1,j] = a[1,j]/a[1,1]
END DO
DO j = 2,n-1
DO i = j,n
sum = 0
DO k = 1,j-1
sum = sum +
a[i,k]*a[k,j]
END DO
a[i,j] = a[i,j] - sum
END DO
DO k = j+1,n
sum = 0
DO i=1,j-1
sum = sum +
a[j,i]*a[i,k]
END DO
a[j,k] =(a[j,k]-sum)/a[j,j]
END DO
END DO
sum = 0
DO K = 1,n-1
sum =sum + a[n,k] * a[k,n]
END DO
a[n,n] = a[n,n] - sum