𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong regularity of matrices in general max–min algebra

✍ Scribed by Martin Gavalec; Ján Plávka

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
144 KB
Volume
371
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis

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 boundedness. Previous results on this topic are special cases of the theorems presented in this paper.

📜 SIMILAR VOLUMES

The general trapezoidal algorithm for st
The general trapezoidal algorithm for strongly regular max–min matrices
✍ Martin Gavalec 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The problem of the strong regularity for square matrices over a general max-min algebra is considered. An O(n 2 log n) algorithm for recognition of the strong regularity of a given n × n matrix is proposed. The algorithm works without any restrictions on the underlying max-min algebra, concerning th

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.

Orbits and critical components of matric
Orbits and critical components of matrices in max–min algebra
✍ Blanka Semančı´ková 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 645 KB

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