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
Max-algebra and pairwise comparison matrices, II
β Scribed by L. Elsner; P. van den Driessche
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 161 KB
- Volume
- 432
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
β¦ Synopsis
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 later paper by Dahl a different error measure was used and led to a slightly different approximating transitive matrix. Here some geometric properties of this approximation problem are discussed. These lead, among other results, to a new characterization of a max-eigenvector of an irreducible nonnegative matrix. The case of Toeplitz matrices is discussed in detail, and an application to music theory that uses Toeplitz symmetrically reciprocal matrices is given.
π SIMILAR VOLUMES
We propose new measures of consistency of additive and multiplicative pairwise comparison matrices. These measures, the relati6e consistency and relati6e error, are easy to compute and have clear and simple algebraic and geometric meaning, interpretation and properties. The correspondence between th
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