STRONG REGULARITY OF MATRICES IN A DISCRETE BOTTLENECK ALGEBRA

被引：14

作者：

CECHLAROVA, K

机构：

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 1990年 / 128卷

关键词：

D O I：

10.1016/0024-3795(90)90281-G

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Systems of linear equations of the form A⊗x = b over a discrete bottleneck algebra (B, ⊕, ⊗, ≤), where ⊕ = max and ⊗ = min, are studied. A square matrix A is said to be strongly regular if for some vector b the system A⊗x = b is uniquely solvable. A necessary and sufficient condition for strong regularity is proved, together with an O(n2logn) method for testing this property. © 1990.

引用

页码：35 / 50

页数：16

共 6 条

[1] A CONDITION FOR THE STRONG REGULARITY OF MATRICES IN THE MINIMAX ALGEBRA [J].