Open AccessThe Implementation of Recursive Algorithm to Determine the Determinant of n x n Matrix Using Cofactor Expansion
Author(s) -
Rahmat Hidayat,
Seto Rahardyanto,
Pahlevi Wahyu Hardjita
Publication year - 2019
Publication title -
proceeding international conference on science and engineering
Language(s) - English
Resource type - Journals
ISSN - 2598-232X
DOI - 10.14421/icse.v2.95
Subject(s) - row and column spaces , matrix (chemical analysis) , row , integer (computer science) , algorithm , computation , mathematics , column (typography) , zero (linguistics) , multiple , singular value , combinatorics , computer science , arithmetic , geometry , physics , chemistry , linguistics , philosophy , eigenvalues and eigenvectors , chromatography , database , connection (principal bundle) , quantum mechanics , programming language
This research examines the algorithm to determine the Determinant of n x n matrix using cofactor expansion and the implementation using recursive algorithm. Random function is added as an option to generate large matrix. To identified singular matrix and to avoid unnecessary further process, the algorithm searches for rows that are multiples of integer from another row, or columns that are multiples of integer from another column, then returns 0 as a Determinant value. In order to minimize the number of iterations and computations, the algorithm searches for rows or columns having the highest number of zero elements to be expanded. The program will not expand zero element and immediately returns a value of zero for those cofactor. Finally the program calculates the number of iterations performed each time the cofactor expands to calculate the Determinant of 2 x 2 matrix.In conclusion, the data shows that the use of recursice algorithm to iteratively expand cofactor considering the row and column having highest number of zero, will reduce the number of iteration and computation.