Max-algebraic attraction cones of nonnegative irreducible matrices (Q550676)

From MaRDI portal





scientific article; zbMATH DE number 5919622
Language Label Description Also known as
default for all languages
No label defined
    English
    Max-algebraic attraction cones of nonnegative irreducible matrices
    scientific article; zbMATH DE number 5919622

      Statements

      Max-algebraic attraction cones of nonnegative irreducible matrices (English)
      0 references
      0 references
      0 references
      13 July 2011
      0 references
      The max-algebraic cyclicity theorem states that if \(A\in {\mathbb R}^{n\times n}_+\) is irreducible and its maximal cyclic geometric mean \(\lambda(A)\) equals 1 then the sequence of max-algebraic powers \(A^k\) becomes periodic after some finite transient time \(T(A)\) and that the ultimate period of \(A^K\) is equal to the cyclicity of the critical graph. The cyclicity theorem naturally leads to the concept of attraction cone \(\mathrm{Attr}(A,T)\) which is the solution set of a two-sided system \(\lambda^t (A) A^r \otimes x=A^{r+y}\otimes x\) for any \(r\geq T(A)\). The author finds a complete description of \(\mathrm{Attr}(A,t)\) by a concise system of equations without knowing \(T(A)\). In addition the extremals of such attraction cones are investigated and the computational complexity for finding the coefficients of the system describing the attraction cones is examined.
      0 references
      max-plus algebra
      0 references
      tropical algebra
      0 references
      diagonal similarity
      0 references
      cyclicity
      0 references
      imprimitive matrix
      0 references
      irreducible
      0 references
      cyclic geometric mean
      0 references
      critical graph
      0 references
      attraction cone
      0 references
      computational complexity
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references