Computational complexity of periodicity problems in max-plus algebra

MaRDI QIDQ2715512zbMATH OpenFDO

Authors M. Gavalec

Publication date 26 July 2001

zbMATH Keywords

algorithmscomputational complexitydiscrete dynamical systemslinear periodicity problemsmax-plus algebra

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Periodic orbits of vector fields and flows (37C27) Discretization methods and integrators (symplectic, variational, geometric, etc.) for dynamical systems (37M15) Numerical nonlinear stabilities in dynamical systems (65P40)

Recommendations

• Linear matrix period in max-plus algebra
• Max algebraic powers of irreducible matrices in the periodic regime: an application of cyclic classes
• Generalized matrix period in max-plus algebra
• Polynomial algorithm for linear matrix period in max-plus algebra
• Periodicity and eigenvalues of matrices over quasi-max-plus algebras

Cited in

(5)

• Periodicity and eigenvalues of matrices over quasi-max-plus algebras
• scientific article; zbMATH DE number 1335885 (Why is no real title available?)
• Computational Complexity of Nachtigall's Representation
• Polynomial algorithm for linear matrix period in max-plus algebra
• Max algebraic powers of irreducible matrices in the periodic regime: an application of cyclic classes

This page was built for publication: Computational complexity of periodicity problems in max-plus algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715512)