Invers Matriks untuk Matriks Jarang Berskala Besar

Abstract

 In the most real life applications, linear equation systems having large dimension of matrix coefficient tend to be sparse, a matrix with the proportion of more zero elements, an alternative way to solve the linier system is to use inverse of the matrix coefficient. In this thesis an algorithm is organized to determine the inverse of sparse matrix by using the modification of Cholesky factorization. In the algorithm it is identified the location in which the clement of matrix is not zero, the aim is to make the efficient use of computer capacity in determining the inverse matrix.