Strong regularity of matrices in a discrete bottleneck algebra

DOI10.1016/0024-3795(90)90281-GzbMath0704.15003MaRDI QIDQ916746

Katarína Cechlárova

Publication date: 1990

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithm; systems of linear equations; discrete bottleneck algebra; strong regularity of matrices; trapezoidal matrix

Mathematics Subject Classification ID

06F25: Ordered rings, algebras, modules

15A06: Linear equations (linear algebraic aspects)

Related Items

Linear independence in bottleneck algebras, A survey on fuzzy relational equations. I: Classification and solvability, Simple image set of linear mappings in a max--min algebra, On the resolution and optimization of a system of fuzzy relational equations with sup-\(T\) composition, Strong regularity of matrices -- a survey of results, Solvability and unique solvability of max-min fuzzy equations, Strong regularity of matrices in a discrete bounded bottleneck algebra, The general trapezoidal algorithm for strongly regular max--min matrices., Strong regularity of matrices in general max-min algebra, Unique solvability of max-min fuzzy equations and strong regularity of matrices over fuzzy algebra

Cites Work

• Unnamed Item
• A condition for the strong regularity of matrices in the minimax algebra
• Strong linear independence in bottleneck algebra
• Linear and combinatorial optimization in ordered algebraic structures