可并行流形
解算器
加速
秩(图论)
低秩近似
稀疏矩阵
计算机科学
基质(化学分析)
因式分解
算法
矩阵分解
计算科学
并行计算
应用数学
数学
物理
数学分析
汉克尔矩阵
组合数学
量子力学
特征向量
复合材料
高斯分布
材料科学
程序设计语言
作者
Lu Zhang,Bin Wang,Xiangtian Zheng,Weiping Shi,P. R. Kumar,Le Xie
出处
期刊:IEEE Transactions on Power Delivery
[Institute of Electrical and Electronics Engineers]
日期:2021-02-01
卷期号:36 (1): 280-288
被引量:8
标识
DOI:10.1109/tpwrd.2020.2978128
摘要
In electromagnetic transient (EMT) simulation, 80-97% of the computational time is devoted to solving the network equations. A key observation is that the sub-matrix representing the interaction between two far-away groups of buses is usually sparse and can be approximated by a low-rank matrix. Based on this observation, we propose a novel low-rank approximation method which permits O(N log N)-time matrix-vector multiplication for each network solution time step. Comprehensive numerical studies are conducted on a 39-bus system and a 179-bus system from the literature, and large cases created from the two systems. The results demonstrate that the proposed approach is up to 2.8× faster than the state-of-the-art sparse LU factorization based network solution, without compromising simulation accuracy. Since our low-rank approximation is highly parallelizable, further speedup may be possible.
科研通智能强力驱动
Strongly Powered by AbleSci AI