A generalized eigenmode algorithm for reducible regulå matrices over the max-plus algebra

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

In this paper an algorithm for computing a generalized eigenmode of reducible regulå matrices over the max-plus algebra is proposed. Given a matrix of finite size, the problem consists in giving an algorithm which will tell us how to compute its generalized eigenmode over the max plus algebra. The solution to the problem is achieved by studying some type of recurrent equations. In fact, by transforming the reducible regulå matrix into its normal form, and considering a very specific recurrent equation, an explicit mathematical chåacterization is obtained, upon which the algorithm is constructed.

Original languageEnglish
Title of host publication2009 Chinese Control and Decision Conference, CCDC 2009
Pages5598-5603
Number of pages6
DOIs
StatePublished - 2009
Event2009 Chinese Control and Decision Conference, CCDC 2009 - Guilin, China
Duration: 17 Jun 200919 Jun 2009

Publication series

Name2009 Chinese Control and Decision Conference, CCDC 2009

Conference

Conference2009 Chinese Control and Decision Conference, CCDC 2009
Country/TerritoryChina
CityGuilin
Period17/06/0919/06/09

Keywords

  • Algorithm
  • Eigenmode
  • Max-plus algebra
  • Recurrent equations
  • Reducible matrices

Fingerprint

Dive into the research topics of 'A generalized eigenmode algorithm for reducible regulå matrices over the max-plus algebra'. Together they form a unique fingerprint.

Cite this