Flow-Graph Solutions of Linear Algebraic Equations

A weighted, oriented topological structure, denoted byGand called a flow graph, is associated with a set ofmequations innvariables, denoted byKX = 0, such thatKis a connection matrix andXa vertex weight matrix of the associated graph. This same set of equations can be written asA-ₕ: ^- C (A+) 'X = 0whereA-^-v: andA^+are negative and positive incidence matrices and whereCandXare respectively branch and vertex weight matrices of the graph. By familiar algebraic procedures, an expression for the weightxₚ, of a nonreference vertex ofGis obtained as a linear combination of the weights of the reference vertices (vertices with zero negative order) and can be written asxₚ = ₉=₁^s pr₉xₑ䲛. To these algebraic results there correspond topological expressions in terms of subgraphs ofGfor the coefficients, Prⱼ. A similar correspondence is obtained between the topological operation of deleting a vertex from the flow graph and the algebraic operation of eliminating a variable from the set of equations. These results are derived from the algebraic equations written in terms of the incidence and weight matrices of the graph. They are similar to those given for the familiar Signal-Flow-Graph, although they are more convient to use, since the topological properties of the flow graph depend only upon the algebraic properties of the set of equations. A flow graph can be drawn directly from an electric network diagram, and the flow-graph properties, used to obtain a solution of the network equations. Examples of this for two types of feedback networks are shown.