Strong regularity of matrices in a discrete bottleneck algebra (Q916746): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Strong linear independence in bottleneck algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A condition for the strong regularity of matrices in the minimax algebra / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3964346 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear and combinatorial optimization in ordered algebraic structures / rank | |||
Normal rank |
Latest revision as of 09:54, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strong regularity of matrices in a discrete bottleneck algebra |
scientific article |
Statements
Strong regularity of matrices in a discrete bottleneck algebra (English)
0 references
1990
0 references
The author studies systems of linear equations of the form \(A\otimes x=b\) over a discrete bottleneck algebra (B,\(\oplus,\otimes,\leq)\), where (B,\(\leq)\) is a nonempty linearly ordered set, \(\oplus =\max\), \(\otimes =\min\) and every \(x\in B\) has a successor. A square matrix A over B is said to be strongly regular if for some vector b the system \(A\otimes x=b\) is uniquely solvable. Theorem: A square matrix A over B is strongly regular if and only if A is equivalent to a strongly trapezoidal matrix. An algorithm for testing of strong regularity of matrices which terminates after using \(O(n^ 2\log n)\) arithmetical operations is described.
0 references
strong regularity of matrices
0 references
systems of linear equations
0 references
discrete bottleneck algebra
0 references
trapezoidal matrix
0 references
algorithm
0 references