A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
An Efficient Algorithm for Nontrivial Eigenvectors in Max-Plus Algebra
2019
Symmetry
The eigenproblem for matrices in max-plus algebra describes the steady state of the system, and therefore it has been intensively studied by many authors. In this paper, we propose an algorithm to compute the eigenvalue and the corresponding eigenvectors of a square matrix in an iterative way. The algorithm is extended to compute the nontrivial eigenvectors for Latin squares in max-plus algebra.
doi:10.3390/sym11060738
fatcat:dmefx6nfv5djrayyeka2wpjfce