A sequential method of network analysis

Sequential network analysis is a method of analyzing a network by choosing some independent variables among the unknown variables in the network, expressing the remaining unknown variables sequentially in terms of the independent variable by applying KCL and KVL, and then solving the constraint equations obtained as the result of the sequential process to determine the independent variables. This paper deals with the topological properties of a sequential analysis formulated f o r an active network. represented by current-and voltage-graphs. The set of edges whose unknown variables are chosen as independent variables is called the independent-edge set (denoted by Ed, the set of edges at which the constraint equations are obtained is called the constraint-edge set (denoted by Eu), and the set of edges whose unknown variables are expressed in terms of the independent variables is called the covered-edge set (denoted by Ep ) .The sequential step of the analysis proceeds by repeatedly adding to EP a n edge which is currentdependent and/or voltage-dependent with respect to EP. Thus a sequence of covered-edge sets is obtained. The conditions for current-dependent, voltage-dependent, independent and constraint edges are presented and the duality among them is also clarified. From the sequence of ED a sequence of Ep U Eb -EU is obtained. Each of the sets in this sequence specifies the electrical connectivities between Eb and Eu. The relation between the edge sets defined above and the structure of 2-graphs is given. Finally, minimum independent-edge sets are given for some special types of graphs, and an algorithm to decrease the number of independent edges is presented.?he network topology is

show abstract

“…Thus we have r ( G , . E p ) = r ( G , -E T ) + 1 (2) Also e is a bridge of G v * E p + , since it is not voltage-dependent. Thus we have…”

Section: Properties Of Independent Constraint O R Single-dependent Ementioning

confidence: 99%

“…A sequential method of electrical network analy s i s was formulated by W a d for general networks [2]. Another formulation of a sequential network analysis has been given by Kishi,Kajitani and Yamaguchi [ 3 ] .…”

Section: Introductionmentioning

confidence: 99%

Topological properties of sequential network analysis

Ozawa

Yamada

1980

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

show abstract

A new method of circuit analysis and central trees of a graph

Kajitani

Kawamoto

Shoji

1983

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

As a method of analysis for the general linear lumped circuit including active elements, this paper proposes a new method called the primal dual analysis, in which the backward parts of the cut‐set and tieset analysis are applied in two steps. the problem to determine the minimum number of independent variables for the analysis is formulated from the graph‐theoretic viewpoint. the essential difference between the proposed method and the traditional methods is described from the viewpoint of minimizing the required set of variables. In the case of passive circuits, the problem of determining the minimum independent variables in the primal dual analysis is seen to be reduced to the problem of determining the central tree of the graph. This problem is known to be difficult to solve. In the latter part of this paper, some results for this problem, obtained by the authors up to present, are described.

show abstract

A sequential technique for active network analysis

Rao

2000

IEEE Trans. Educ.

View full text Add to dashboard Cite

A sequential method of network analysis

Cited by 13 publications

References 1 publication

Topological properties of sequential network analysis

Topological properties of sequential network analysis

A new method of circuit analysis and central trees of a graph

A sequential technique for active network analysis

Contact Info

Product

Resources

About