The max-eigenvector of a symmetrically reciprocal matrix A can be used to construct a transitive matrix that is closest to A in a relative error measure. As an alternative to the Perron eigenvector, the max-eigenvector can be used successfully for ranking in the analytical hierarchy process. When ei
Dominant matrices and max algebra
β Scribed by Miroslav Fiedler
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 167 KB
- Volume
- 434
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This paper is a continuation of our 2004 paper "Max-algebra and pairwise comparison matrices", in which the max-eigenvector of a symmetrically reciprocal matrix was used to approximate such a matrix by a transitive matrix. This approximation was based on minimizing the maximal relative error. In a l
A speed-up of a known O(n 3 ) algorithm computing the period of a periodic orbit in max-min algebra is presented. If the critical components (or the transitive closure A + ) of the transition matrix A are known, the computational complexity of the algorithm is O(n 2 ). This is achieved by using only
The problem of the strong regularity of a square matrix in a general max-min algebra is considered and a necessary and sufficient condition using the trapezoidal property is described. The results are valid without any restrictions on the underlying max-min algebra, concerning the density, or the bo
It is known that the max-algebraic powers A r of a nonnegative irreducible matrix are ultimately periodic. This leads to the concept of attraction cone Attr(A, t), by which we mean the solution set of a two-sided system Ξ» t (A)A r β x = A r+t β x, where r is any integer after the periodicity transie