Efficient computation of the greatest eigenvector in fuzzy algebra

Rok, strany: 1997, 73 - 79

Let $R$ be an arbitrary linearly ordered set, $\oplus=\max$, $\otimes=\min$. An $n$-tuple $x$ is called a max-min eigenvector of a square matrix $A$ over $(R, \oplus, \otimes)$, if $A\otimes x=x$. We review the results linking max-min eigenvectors of a matrix and paths in digraphs and in this context derive a faster method for computing the greatest max-min eigenvector.

ISO 690:

Cechlárová, K. 1997. Efficient computation of the greatest eigenvector in fuzzy algebra. In Tatra Mountains Mathematical Publications, vol. 12, no.3, pp. 73-79. 1210-3195.

APA:

Cechlárová, K. (1997). Efficient computation of the greatest eigenvector in fuzzy algebra. Tatra Mountains Mathematical Publications, 12(3), 73-79. 1210-3195.