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

Abstract: The eigenvalue problem for an irreducible non negative matrix

A = [a_{i j}]

in the max-algebra is the form

A o t i m e s x = l a m b d a x

where

(A o t i m e s x)_{i} = m a x (a_{i j} x_{j}), x = (x_{1}, x_{2}, d o t s, x_{n})^{t}

and

l a m b d a

refers to maximum cycle geometric mean

m u (A)

. In this paper we exhibit a method to compute

m u (A)

and max-eigenvector by using mutation of matrices. Since the order of power method algorithm is

O (n^{3})

, the advantage of this paper present a faster procedure.

This page was built for publication: Calculating max-eigenvalues and max-eigenvectors with jumps of matrices