The representation of AC machine dynamics by complex signal flow graphs

1995 ◽  
Vol 42 (3) ◽  
pp. 263-271 ◽  
Author(s):  
J. Holtz
1976 ◽  
Vol 98 (4) ◽  
pp. 367-374
Author(s):  
K. R. Young ◽  
L. L. Hoberock ◽  
J. G. Thompson

A computer algorithm is developed that provides efficient means to compute transmittances directly from a signal flow graph or a block diagram. Signal flow graphs are cast as directed graphs described by adjacency matrices. Nonsearch computation, designed for compilers without symbolic capability, is used to identify all arcs that are members of simple cycles for use with Mason’s gain formula. The routine does not require the visual acumen of an interpreter to reduce the topology of the graph, and it is particularly useful for analyzing control systems described for computer analyses by means of interactive graphics.


1957 ◽  
Vol 45 (1) ◽  
pp. 74-86 ◽  
Author(s):  
William Huggins

Sign in / Sign up

Export Citation Format

Share Document