Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
421283 | Discrete Applied Mathematics | 2010 | 7 Pages |
Abstract
The problem of computing an eigenvector of an inverse Monge matrix in max–plus algebra is addressed. For a general matrix, the problem can be solved in at most O(n3)O(n3) time. This note presents an O(n2)O(n2) algorithm for computing one max–plus algebraic eigenvector of an inverse Monge matrix A. It is assumed that A is irreducible.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Aleksey A. Imaev, Robert P. Judd,