.png){kind=icon}
.png){kind=icon}
Return
Fast Newton-Raphson Power Flow Analysis Based on Sparse Techniques and Parallel Processing
.png){kind=icon}
OA
AI
DOI：10.1109/TPWRS.2021.3116182.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Power flow (PF) calculation provides the basis for the steady-state power system analysis and is the backbone of many power system applications ranging from operations to planning. The calculated voltage and power values by PF are essential to determining the system condition and ensuring the security and stability of the grid. The emergence of multicore processors provides an opportunity to accelerate the speed of PF computation and, consequently, improve the performance of applications that run PF within their processes. This paper introduces a fast Newton-Raphson power flow implementation on multicore CPUs by combining sparse matrix techniques, mathematical methods, and parallel processing. Experimental results validate the effectiveness of our approach by finding the power flow solution of a synthetic U.S. grid test case with 82,000 buses in just 1.8 seconds.
Keywords:
Mathematical models
Newton method
Multicore processing
Voltage
Sparse matrices
Graphics processing units
Power systems
Parallel
multicore
sparse
power flow
newton-raphson
OpenMP
SIMD
Journal
IF:
7.2
Papers:
1.1W
Citations:
5.0W