Abstract
In the max algebra system, the eigenequation for an n×n irreducible nonnegative matrix A=[a ij] is A⊗x=μ(A)x. Here (A⊗x) i= max ja ijx j and μ(A) is the maximum circuit geometric mean. The complexity of the power method given in [L. Elsner, P. van den Driessche, Linear Algebra Appl., to appear] to compute μ(A) and x is considered. Under some assumptions on the critical matrix, it is shown that the algorithm may have time complexity O(n 4) . A modified power method, based on Karp's formula, is presented. For this new algorithm, with no assumptions on the critical matrix, μ(A) and x can be computed in O(n 3) time. Furthermore, this algorithm can be used to compute all linearly independent eigenvectors corresponding to μ(A).
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
