Computing an Eigenvector of a Monge Matrix in Max-Plus Algebra

The problem of finding one eigenvector of a given Monge matrix A in a max-plus algebra is considered. For a general matrix, the problem can be solved in O(n 3 ) time by computing one column of the corresponding metric matrix Δ(A λ ), where λ is the eigenvalue of A. An algorithm is presented, which computes an eigenvector of a Monge matrix in O(n 2 ) time. Copyright Springer-Verlag 2006

MoreLess

Year of publication:	2006
Authors:	Gavalec, Martin ; Plavka, Ján
Published in:	Computational Statistics. - Springer. - Vol. 63.2006, 3, p. 543-551
Publisher:	Springer
Subject:	Eigenproblem \| Monge matrix \| Primary: 90C27 \| Secondary: 05B35

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010759120