Eigenproblem for monotone and toeplitz matrices in a Max-algebra
Ján Plavka · Optimization · 2004
The eigenproblem for monotone and Toeplitz matrices in a max-algebra is shown to be solvable in O(n 2) time. Two algorithms are described which, for a given n × n real monotone and for a given n × n real Toeplitz matrix compute an eigenvalue λ and all eigenvectors of the form x = (x 1, x 2, … , x n ) such that These results improve standard O(n 3) algorithms used in the general case.