Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 59 (1993), S. 377-404 
    ISSN: 1436-4646
    Keywords: 15A21 ; 20C35 ; 93A15 ; Combinatorial canonical form (CCF) ; group representation theory ; hierarchical decomposition ; large-scale system ; layered mixed (LM-) matrix ; matroid theory ; subsystem
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract An algebraic method is proposed for the hierarchical decomposition of large-scale group-symmetric discrete systems into partially ordered subsystems. It aims at extracting “substructures” and “hierarchy” for such systems as electrical networks and truss structures. The mathematical problem considered is: given a parametrized family of group invariant “structured” matricesA, we are to find two constant (=parameter-independent) nonsingular matricesS r andS c such thatS r -1 AS c takes a (common) block-triangular form. The proposed method combines two different decomposition principles developed independently in matroid theory and in group representation theory. The one is the decomposition principle for submodular functions, which has led to the Dulmage—Mendelsohn (DM-) decomposition and further to the combinatorial canonical form (CCF) of layered mixed (LM-) matrices. The other is the full reducibility of group representations, which yields the block-diagonal decomposition of group invariant matrices. The optimality of the proposed method is also discussed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...