Structural solvability of systems of equations —A mathematical formulation for distinguishing accurate and inaccurate numbers in structural analysis of systems—

DOI10.1007/BF03167048zbMath0598.15003MaRDI QIDQ3731772

Masao Iri, Kazuo Murota

Publication date: 1985

Published in: Japan Journal of Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

discrete systemsstructural analysisalgebraic independencematroid intersectionbimatroidmixed matrixStructural solvability

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Combinatorial aspects of matroids and geometric lattices (05B35) Vector spaces, linear dependence, rank, lineability (15A03) Linear equations (linear algebraic aspects) (15A06)

Related Items

On the Kronecker Canonical Form of Singular Mixed Matrix Pencils, Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations, Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations, Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, The symbiotic relationship of combinatorics and matrix theory, Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation, Hierarchical decomposition of symmetric discrete systems by matroid and group theories, Legendre duality in combinatorial study of matrix pencils, Some recent results in combinatorial approaches to dynamical systems, Computing the Degree of Determinants via Discrete Convex Optimization on Euclidean Buildings

Cites Work

• Graphs and matching theorems
• LU-decomposition of a matrix with entries of different kinds
• Detection of structural inconsistency in systems of equations with degrees of freedom and its applications
• Network theory and transversal matroids
• The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix
• Coverings of Bipartite Graphs
• Sufficient conditions for the unique solvability of linear networks containing memoryless 2-ports
• Use of matroid theory in operations research, circuits and systems theory
• On Generic Rigidity in the Plane
• Structural controllability of multiinput linear systems
• Dynamic equations in descriptor form
• Structural controllability
• Minimum partition of a matroid into independent subsets
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Two Algorithms for Bipartite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item