Systems analysis by graphs and matroids. Structural solvability and controllability
From MaRDI portal
Publication:1092044
zbMath0624.05001MaRDI QIDQ1092044
Publication date: 1987
Published in: Algorithms and Combinatorics (Search for Journal in Brave)
matroid theorygraph-theoretic modelscontrollability of linear time- invariant dynamical systemssystems of linear or nonlinear equations
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35) Applications of graph theory to circuits and networks (94C15) Vector spaces, linear dependence, rank, lineability (15A03) Canonical forms, reductions, classification (15A21) Axiomatic systems theory (93A05)
Related Items
On the Kronecker Canonical Form of Singular Mixed Matrix Pencils, An overview of structural systems theory, Graphic approach for the determination of the existence of sequences guaranteeing observability of switched linear systems, König's theorem and bimatroids, An identity for bipartite matching and symmetric determinant, Identifiability of a simultaneous equations model of economy: a structural view, Generic decoupling problems for structured time-delay systems, A theorem on the principal structure for independent matchings, State and input observability for structured linear systems: A graph-theoretic approach, Observability of structured linear systems in descriptor form: a graph-theoretic approach, The generic dimension of a minimal realization of an AR system, Principal structure of submodular systems and Hitchcock-type independent flows, Graph-theoretically determined Jordan-block-size structure of regular matrix pencils, Disturbance rejection problem solvability: from structural approach to reliability/availability analysis, Digraph characterization of structural controllability for linear descriptor systems, Controllability and the theory of economic policy: a structural approach, Computing the generic jordan canonical form, On the irreducibility of layered mixed matrices, A dual approximation approach to weighted matroid intersection, Combinatorial dynamical system theory: General framework and controllability criteria, On the fixed controllable subspace in linear structured systems, Block triangularization of skew-symmetric matrices, Completely controllable pairs of matrices with prescribed positions, Uniform observability analysis for structured bilinear systems. A graph-theoretic approach, The single-input minimal controllability problem for structured systems, Controllability of pairs of matrices with prescribed entries, Observability of switching structured linear systems with unknown input. A graph-theoretic approach, Clustering-based average state observer design for large-scale network systems, Computing the maximum degree of minors in mixed polynomial matrices via combinatorial relaxation, System theory for system identification., Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs, Structural analysis of the partial state and input observability for structured linear systems: application to distributed systems, Structured transfer function matrices and integer matrices: the computation of the generic McMillan degree and infinite zero structure, Sensor location and classification for disturbance rejection by measurement feedback, Observability analysis and sensor location study for structured linear systems in descriptor form with unknown inputs, The symbiotic relationship of combinatorics and matrix theory, Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation, Observability analysis for structured bilinear systems: a graph-theoretic approach, Hierarchical decomposition of symmetric discrete systems by matroid and group theories, New algorithms for the intersection problem of submodular systems, State and input observability recovering by additional sensor implementation: a graph-theoretic approach, Unnamed Item, Unnamed Item, On the structure at infinity of a structured system, A simple graph theoretic characterization of reachability for positive linear systems, From structural analysis to observer-based residual generation for fault detection, Extension of the normal tree method, Enumeration of subdifferentials of piecewise linear functions with abs-normal form, Approximating constrained minimum cost input-output selection for generic arbitrary pole placement in structured systems, An equation-based algorithmic differentiation technique for differential algebraic equations, Controllability of partially prescribed matrices, Decomposition for augmented forms of large-scale systems, An identity for matching and skew-symmetric determinant, Qualitative controllability and uncontrollability by a single entry, Sensor classification for the fault detection and isolation, a structural approach, Principal structure of layered mixed matrices, Some recent results in combinatorial approaches to dynamical systems, On the number of invariant factors of partially prescribed matrices and control theory, Matroid algorithm for monitorability analysis of bond graphs, Simple algebraic algorithm for determination of the generic-rank of structured systems, A dynamic graph characterisation of the fixed part of the controllable subspace of a linear structured system, Applications of matroids in electric network theory, Digraph based determination of Jordan block size structure of singular matrix pencils, The structural index of sensitivity equation systems, Structural analysis of sensor location for disturbance rejection by measurement feedback, Feedback control for structured descriptor systems with minimum free-entry pattern gain vectors, Graph-theoretic approach to symbolic analysis of linear descriptor systems
