Calculating max-eigenvalues and max-eigenvectors with jumps of matrices

Abstract

The eigenvalue problem for an irreducible non negative matrix A=[aij] in the max-algebra is the form A x = λ x where (A x)i = (aijxj), x=(x1,x2, …, xn)t and λ refers to maximum cycle geometric mean μ (A) . In this paper we exhibit a method to compute μ (A) and max-eigenvector by using mutation of matrices. Since the order of power method algorithm is O(n3), the advantage of this paper present a faster procedure.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…