【摘要】 十字链表具有检索方式灵活和操作方便的特点,分析了十字链表在三角分解和前代–回代计算中的应用方法及其内存分配方式对稀疏矩阵计算效率的影响,十字链表的存储结点通常散列于内存空间中,该内存分配方式下稀疏矩阵的运算效率低于存储结点连续分布在内存中的稀疏矩阵运算效率,该现象由计算机的高速缓冲存储器的工作原理造成。为此提出改进十字链表实现方法,在稀疏矩阵的运算过程中充分利用高速缓冲存储器的高速存取速度来提高计算效率。通过算例证明改进十字链表方法是一种高效的稀疏矩阵技术,在传统大规模系统和分布式发电供能系统仿真中均取得了良好的应用效果。更多还原

【Abstract】 The structure and operation manner of cross chain table and its application in the triangular factorization and forward-backward substitution are presented in this paper to illustrate that its convenience and efficiency in serching,adding and deleting matrix elements can help speeding up the calculation process of factorization and forward-backward substitution.And the impacts of the memory allocation manner of the cross chain table on the calculation efficiency are discussed.The nodes of cross chain table are always stored seperately in the memory because of its memory allocation manner,which can reduce the calculation efficiency.This phenomenon is caused by the principle of the cache.Aiming at this problem,an improved cross chain table method is proposed in this paper which inherits the advantages of the conventional cross chain table and can raise the calculation efficiency by taking adavantage of the high speed access of cache.Case study proves the efficiency of the improved cross chain table,and shows that it can be well applied in both the traditional large scale power system simulation and the distributed generation system simulation.更多还原