𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Eigenvectors in bottleneck algebra

✍ Scribed by Katarína Cechlárová

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
574 KB
Volume
175
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Powers of circulants in bottleneck algeb
Powers of circulants in bottleneck algebra
✍ A.O.L. Atkin; Endre Boros; Katarína Cechlárová; Uri N. Peled 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 475 KB
Strong regularity of matrices in a discr
Strong regularity of matrices in a discrete bounded bottleneck algebra
✍ Katarína Cechlárová; Karol Kolesár 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 424 KB

The results concerning strong regularity of matrices over bottleneck algebras are reviewed. We extend the known conditions to the discrete bounded case and modify the known algorithms for testing strong regularity.

Permuted max-algebraic eigenvector probl
Permuted max-algebraic eigenvector problem is NP-complete
✍ P. Butkovič 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Let a ⊕ b = max(a, b) and a ⊗ b = a + b for a, b ∈ R := R ∪ {-∞} and extend these operations to matrices and vectors as in conventional linear algebra. The following eigenvector problem has been intensively studied in the past: Given A ∈ R n×n find all x ∈ R n , x / = (-∞, . . . , -∞) T (eigenvector

An efficient algorithm for critical circ
An efficient algorithm for critical circuits and finite eigenvectors in the max-plus algebra
✍ Geert-Jan Olsder; Kees Roos; Robert-Jan van Egmond 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 97 KB

We consider the eigenvalue problem in the max-plus algebra for matrices in fÀI Rg nÂn but with eigenvectors in R n . The problem is relaxed to a linear optimization (LO) problem of which the dual problem is solved by ®nding a maximal average weight circuit in the graph of the matrix. The Floyd±Warsh