摘要
节点导纳矩阵是一个稀疏矩阵,短路电流计算需要对导纳矩阵数据进行查询。为了既能保持快速按行列查询元素数值,又进一步提高按数值查询其所在行列的效率,以便于存储调用及后续矩阵的处理,提出构建高度平衡二叉树的改进十字链表方法,即在十字链表存储的基础上,拓展存储数据结点指针域,形成平衡二叉树,将高度维持在(O(log2n)),平均查找长度也可维持在(O(log2n)),大大降低操作时间复杂度,提高数值查询效率。同时,为保证测试结果的公平性,把构建高度平衡二叉树的时间计入总时间,以进行对比。通过相应算例,验证了该改进方法的高效性。
The node admittance matrix is a sparse matrix, and the short circuit current calculation needs to query the admittance matrix data. In order to keep querying the element numerical value according to row and column and to further improve the efficiency of querying the line number according to the numerical value, which can facilitate the storage and subsequent matrix processing, we propose an improved orthogonal list method for constructing the highly balanced binary tree. Based on productive capacity table stores, the data node pointer field is expanded so as to form a balanced binary tree. The tree’s whose height is maintained at （O（log2 n））,and its average search length is maintained at （O（log2 n））.It can reduce operation time complexity and improve the efficiency of numerical query. At the same time, in order to ensure the fairness of the test results, the time to construct the highly balanced binary tree is included in the total time for comparison. The corresponding examples verify the efficiency of the improved method.
出处
《计算机工程与科学》
CSCD
北大核心
2017年第4期648-655,共8页
Computer Engineering & Science
基金
中国南方电网有限责任公司项目(K-GD2014-099(GD2014-0872))
关键词
稀疏矩阵
十字链表
高度平衡二叉树
查询
效率
sparse matrix
orthogonal list
highly balanced binary tree
query
efficiency
