摘要
提出了不定导纳矩阵任意k阶余因式的有向树拓扑表示式;给出了通过混合分割产生有向树多项式的分解定理.应用它们可以方便有效地求取任意k阶余因式的拓扑表示式.用其求全符号网络函数,可扩大计算机所能拓扑分析的网络规模.用其求部分符号网络函数,可使计算机所能分析的网络规模扩大到一般数值分析程序所能处理的阶数.
The topological representation of a directed tree is proposed for an arbitrary k-order co-factor of an indefinite admittance matrix and the theorem of decomposition for generating the directed tree polynomial of a directed graph associated with an electrical network is given. It is convenient for finding the topological expressions of an arbitrary k-order cofacitor and for finding all-symbolic network functions and the network scale that can be topologically analyzed by a computer can be expanded. Using this method for finding partial symbolic network functions, the network scale capable of computer-based analysis can also be expanded to an order that can be handled by a numerical analysis program.
出处
《华中理工大学学报》
CSCD
北大核心
1993年第6期83-88,共6页
Journal of Huazhong University of Science and Technology
关键词
k阶余因式
有向树
超图
k-order cofactor
directed tree
hypergraph
directed k-hypertree