Reachability matrix by partitioning and related Boolean results

DOI10.1016/0016-0032(89)90020-3zbMath0669.05049OpenAlexW1975642786MaRDI QIDQ1118616

Dionyssis S. Evangelatos

Publication date: 1989

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(89)90020-3

zbMATH Keywords

partitioned matrixpartitioned adjacency matrixreachability complementreachability matrixreachability relations

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Decomposition for augmented forms of large-scale systems ⋮ Structurally fixed modes: Decomposition and reachability

Cites Work

• Qualitative aspects of large scale systems. Developing design rules using APL
• A graph theoretic approach to matrix inversion by partitioning
• Input-output analysis of large-scale interconnected systems. Decomposition, well-posedness and stability
• Graph theoretic structure of the matrix inverse relating to large-scale systems
• A Graph Theoretic Method for the Complete Reduction of a Matrix with a View Toward Finding its Eigenvalues
• A theorem and a procedure for the complete implication matrix of system interconnection matrices
• Reachability matrix and relation to large-scale systems
• Structural zeros in the modal matrix and its inverse
• Structurally controllable and structurally canonical systems
• Binary Matrices in System Modeling
• Decomposition for augmented forms of large-scale systems
• Toward Interpretation of Complex Structural Models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reachability matrix by partitioning and related Boolean results