电力系统及其自动化学报2011，Vol.23Issue(4)：56-60,5.
节点优化编号的改进最小度算法
Improved Minimum Degree Algorithm of Optimal Ordering
颜伟 1黄正波 1李佐君 2余娟 1贾晓峰1
作者信息
- 1. 输配电装备及系统安全与新技术国家重点实验室,重庆大学电气工程学院,重庆400030
- 2. 重庆电力设计院,重庆400030
- 折叠
摘要
Abstract
The improved minimum degree algorithm (MD) has been used in the paper to enhance the effectiveness and efficiency of the optimal ordering algorithm. In the MD, the total number of connected buses of any bus was called the bus's degree. This paper defined the sum of the degrees of buses connected to one bus as its QUANTITY and presented that less input elements would be realized by eliminating the bus with minimum QUANTITY firstly under the premise of the minimum buses' degree in the MD. Besides, after determining the primary element, by using the method of Gauss elimination without permutation both the rows and columns of the matrix, the MD can be achieved. At the same time, improve the method of how to locate the minimum degree bus and enhance efficiency by the sparse technique. Several results indicates that the method proposed in this paper is suitable for power simulation as it can get less input elements and cost less time.关键词
稀疏技术/节点优化编号/最小度/注入元/高斯消元Key words
sparse technique/ optimal ordering) minimum degree/ input element/ Gauss elimination分类
信息技术与安全科学引用本文复制引用
颜伟,黄正波,李佐君,余娟,贾晓峰..节点优化编号的改进最小度算法[J].电力系统及其自动化学报,2011,23(4):56-60,5.
