Eigen problems and eigenmode are important components related to square matrices. In max-plus algebra, a square matrix can be represented in the form of a graph called a communication graph. The communication graph can be strongly connected graph and a not strongly connected graph. The representation matrix of a strongly connected graph is called an irreducible matrix, while the representation matrix of a graph that is not strongly connected is called a reduced matrix. The purpose of this research is set the steps to determine the eigenvalues and eigenvectors of the irreducible matrix over min-plus algebra and also eigenmode of the regular reduced matrix over min-plus algebra. Min-plus algebra has an ispmorphic structure with max-plus algebra. Therefore, eigen problems and eigenmode matrices over min-plus algebra can be determined based on the theory of eigenvalues, eigenvectors and eigenmode matrices over max-plus algebra. The results of this research obtained steps to determine the eigenvalues and eigenvectors of the irreducible matrix over min-plus algebra and eigenmode algorithm of the regular reduced matrix over min-plus algebra
Copyrights © 2021