State Equations from a Linear Graph without Transformers or Gyrators

1. From the linear graph dene:

N = the number of nodes

B = the number of branches
SA = the number of across-variable sources
ST = the number of through-variable sources
S = SA + ST
2. Construct a normal tree from the linear graph.
3. From the normal tree dene:
the primary variables = the branch across variables and the link through variables
the secondary variables = the branch through variables and the link across variables

n = the system order

= the number of A-type elements in the branches + the number of T-type elements in
the links1
the n state variables = the across-variables for the A-type elements in the branches
and the through-variables for the T-type elements in the links
4. Write the B S elemental equations for the passive (nonsource) elements with the primary variable on the left side of
each equation. The derivatives of the n state variables should appear on the left side of the elemental equations for all
independent energy storage elements.
5. Write N 1 SA independent continuity equations involving only one secondary through variable (a branch through
variable) by applying the continuity condition to a set of N 1 SA contours that each cut only one passive branch of the
normal tree. Express each equation with the secondary through variable on the left side of the equation.
6. Write B N + 1 ST independent compatibility equations involving only one secondary across variable (a link across
variable) by placing each of the passive links back in the tree and writing the compatibility equation for each resulting
loop. Express each equation with the secondary across variable on the left side of the equation.
7. Use the N 1 SA continuity and B N + 1 ST compatibility equations (a total of B S equations) to eliminate all
secondary variables from the B S elemental equations by direct substitution.
8. Reduce the resulting B S equations in the primary variables to n state equations in the n state variables and the S source
variables.
9. Write the resulting state equations in the standard matrix form.

1. For a system having two or more A-type elements in direct series connection or two or more T-type elements in direct parallel
connection, this choice for n may result in excess state variables. See Section 5.2 in the textbook for details.
22Nov03 3:05 pm

Normal Tree from a Linear Graph without Transformers or Gyrators

1. Include all N linear graph nodes in the tree.

2. Include all across variable sources in the tree. (If all across variable sources cannot be included in the tree, then some
across variable sources form a loop and compatibility is violated.)
3. Include as many as possible of the A-type elements in the tree. (Any A-type element that cannot be included in the tree is
a dependent energy storage element.)
4. Attempt to complete the tree, which must have N 1 branches, by adding to it as many of the D-type elements as is
possible. (It may not be possible to include all of the D-type elements.)
5. If the tree is not complete, attempt to complete it by adding to it the minimum number of T-type elements required to
complete it. (Any T-type element that must be included in the tree is a dependent energy storage element.)
6. Examine the tree to determine if any through variable source must be added to it to complete it. If so, the through
variable for that source cannot be independently specied and continuity is violated.

22Nov03 3:05 pm