摘要
本文以在根节点处增加虚拟零阻抗支路和按一定规律对节点、支路编号的方法,使网络的节点──支路关联矩阵成为易于处理的正方阵。用此关联降,可以很简洁地表示树状网潮流计算的过程,使编程工程简单。以IEEE33节点试例的网络计算表明,方法简单有效。
This paper proposed an algorithm using the node- branch incidence matrix for the radial distribution network loadflow. Adding a fictitious zero irnpedance branch at the root bus , and ordering the branch and the node number in a certain way , a node-branch ineidence matrix of this network was formed. This matrix is an upper traingle matrix with the di- agnonal elements are - 1 . Using this matrix and backward sub- stituation method , the branch currents of the network can be solved by the bus injection currents easily. Then , by the multi- ple of the branch current and impedance using the forward sub- stitution method ,the bus voltage can also be solved easily. This algorithm is efficiency and is verified by IEEE 33bus radial net- Work.
出处
《中国电机工程学报》
EI
CSCD
北大核心
1998年第3期217-220,共4页
Proceedings of the CSEE