Eigenvectors in Bottleneck algebra (Q1200552): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Katarína Cechlárova / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Mihail Voicu / rank
Normal rank
 
Property / author
 
Property / author: Katarína Cechlárova / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Mihail Voicu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong linear independence in bottleneck algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3964346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048946 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear and combinatorial optimization in ordered algebraic structures / rank
 
Normal rank

Latest revision as of 11:00, 17 May 2024

scientific article
Language Label Description Also known as
English
Eigenvectors in Bottleneck algebra
scientific article

    Statements

    Eigenvectors in Bottleneck algebra (English)
    0 references
    16 January 1993
    0 references
    The paper deals with a characterization of the eigenvectors in terms of the associated graph and with an alternative way of computing them. Upper and lower bounds for all eigenvectors are given. The approach is illustrated by several numerical examples.
    0 references
    Bottleneck algebra
    0 references
    eigenvectors
    0 references
    associated graph
    0 references
    Upper and lower bounds
    0 references
    numerical examples
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references