𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graph theoretical methods in control systems analysis

✍ Scribed by F.Y. Wang; I.T. Cameron

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
468 KB
Volume
48
Category
Article
ISSN
0009-2509

No coin nor oath required. For personal study only.

✦ Synopsis

Graph theoretical methods are widely used in the analysis of controllability, operability, loop interaction and the relative degree of control systems. However, misleading results can occur due to two common reasons: (1) only necessary conditions can be developed by using qualitative graph analysis without any guarantee of sufficiency and (2) the primary graphs directly obtained from the system equations are not normally in their practical irreducible forms. That is, path cancellations and loop eliminations are possible to reduce the graphs yet still preserve the physical significance and the structural characteristics of the control systems. In this paper, a model evaporation process which is described by four different sets of state equations is employed to demonstrate the applications of graph theoretical methods and the sources causing the possible misleading results. Quantitative analysis and graph reduction techniques are emphasized for the detection of misleading graphs.

πŸ“œ SIMILAR VOLUMES

Analysis of protein sheet topologies by
Analysis of protein sheet topologies by graph theoretical methods
✍ Ina Koch; Frieder Kaden; Joachim Selbig πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 755 KB

## Abstract In order to find rules for the secondary structure prediction of proteins which describe the (sequentially) long‐range interactions in sheet structures methods of applied graph theory were used. The so called Ξ² graph which describes the sheet topology was defined for every protein in th

Graph-theoretical methods in general fun
Graph-theoretical methods in general function theory
✍ Amine El Sahili πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 47 KB

Consider two maps f and g from a set E into a set F such that f (x) = g(x) for every x in E. What is the maximal cardinal of a subset A of E such that the images of the restriction of f and g to A are disjoint? Mekler, Pelletier and Taylor have shown that it is card(E) when the set E is infinite; in