An efficient open-source implementation to compute the jacobian matrix for the Newton-Raphson power flow algorithm
An efficient open-source implementation to compute the jacobian matrix for the Newton-Raphson power flow algorithm
复制标题
用于计算 Newton-Raphson 潮流算法的雅可比矩阵的高效开源实现
DOI：
10.1109/isgteurope.2018.8571471
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
M. Braun
中科院分区：
文献类型：
--
作者：
F. Schäfer;M. Braun
对于具有大量总线的系统（例如，具有多个电压等级的电网）的潮流计算或基于时间序列的计算导致高计算工作量。用于电力系统有效分析的常见潮流求解器是牛顿-拉夫森算法。该方法的主要计算工作来自非线性潮流问题的线性化和求解所得线性方程。本文提出了一种通过直接生成压缩行存储（CRS）格式的雅可比矩阵来快速线性化潮流问题的算法。通过减少稀疏雅可比矩阵的非零元素上的迭代次数来实现速度的增加。这允许有效地创建雅可比矩阵，而不必近似问题。三个电网的计算时间比较表明，可比的开源实现需要3- 14倍的时间来创建雅可比矩阵。
Power flow calculations for systems with a large number of buses, e.g. grids with multiple voltage levels, or time series based calculations result in a high computational effort. A common power flow solver for the efficient analysis of power systems is the Newton-Raphson algorithm. The main computational effort of this method results from the linearization of the nonlinear power flow problem and solving the resulting linear equation. This paper presents an algorithm for the fast linearization of the power flow problem by creating the Jacobian matrix directly in Compressed Row Storage (CRS) format. The increase in speed is achieved by reducing the number of iterations over the nonzero elements of the sparse Jacobian matrix. This allows to efficiently create the Jacobian matrix without having to approximate the problem. A comparison of the calculation time of three power grids shows that comparable open-source implementations need 3-14x the time to create the Jacobian matrix.