In this paper we consider (max, +)-systems and bipartite (min, max, +)-systems. We present so-called power algorithms that under some mild conditions on the structure of the systems determine eigenvalues and corresponding eigenvectors in an iterative way. We present simple proofs for our algorithms and we illustrate our algorithms by means of some examples also clarifying the difference with existing power algorithms.
|Number of pages
|Discrete Event Dynamic Systems: Theory and Applications
|Published - Oct 2000