On matrix powers in max-algebra

Peter Butkovic, Raymond Cuninghame-Green

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

Let A = (a(ij)) is an element of (R) over bar (nxn), N = {1,...,n} and D-A be the digraph (N, {(i, j): a(ij) > - infinity}). The matrix A is called irreducible if D-A is strongly connected, and strongly irreducible if every max-algebraic power of A is irreducible. A is called robust if for every x with at least one finite component, A((k)) circle times x is an eigenvector of A for some natural number k. We study the eigenvalue-eigenvector problem for powers of irreducible matrices. This enables us to characterise robust irreducible matrices. In particular, robust strongly irreducible matrices are described in terms of eigenspaces of matrix powers. (c) 2006 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)370-381
Number of pages12
JournalLinear Algebra and its Applications
Volume421
DOIs
Publication statusPublished - 1 Mar 2007

Keywords

  • irreducible matrix
  • matrix powers
  • max-algebra
  • eigenspace

Fingerprint

Dive into the research topics of 'On matrix powers in max-algebra'. Together they form a unique fingerprint.

Cite this