On optimally sparse cycle and coboundary basis for a linear graph
On optimally sparse cycle and coboundary basis for a linear graph
复制标题
DOI：
10.1109/tct.1973.1083752
复制
发表时间：
1973-09
期刊：
影响因子：
--
通讯作者：
L. Chua;Li-Kuan Chen
中科院分区：
文献类型：
--
作者：
L. Chua;Li-Kuan Chen
对广义环分析和广义割集分析的计算效率进行了图论研究。结果表明，选择最优分析模式将分别产生最稀疏的环阻抗矩阵和最稀疏的割集导纳矩阵。给出了确定最优选择的有效算法，这是一个严格的无向线性图问题。提出了基于基图概念的两种算法，并用实例进行了详细说明。网格分析的非平面版本通常产生相当稀疏的环路阻抗矩阵也包括在内。
A graph-theoretic study of the computational efficiency of the generalized loop analysis and the generalized cutset analysis is presented. It is shown that the choice of an optimum mode of analysis will give rise to the sparsest loop impedance matrix and the sparsest cutset admittance matrix, respectively. The problem of formulating efficient algorithms for determining the optimum choice is shown to be strictly a problem in nonoriented linear graph. Two algorithms based on the concept of basis graph are presented and illustrated in detail with examples. A nonplanar version of the mesh analysis which generally yields a rather sparse loop impedance matrix is also included.