Abstract:
Power flow is the most fundamental computation in power system analysis. Traditionally, the linear solution in power flow is solved by a direct method like LU decompositi...Show MoreMetadata
Abstract:
Power flow is the most fundamental computation in power system analysis. Traditionally, the linear solution in power flow is solved by a direct method like LU decomposition on a CPU platform. However, the serial nature of the LU-based direct method is the main obstacle for parallelization and scalability. In contrast, iterative solvers, as alternatives to direct solvers, are generally more scalable with better parallelism. This study presents a fast decouple power flow (FDPF) algorithm with a graphic processing unit (GPU)-based preconditioned conjugate gradient iterative solver. In addition, the Inexact Newton method is integrated to further improve the GPU-based parallel computing performance for solving FDPF. The results show that the GPU-based FDPF maintains the same precision and convergence as the original CPU-based FDPF, while providing considerable performance improvement for several large-scale systems. The proposed GPU-based FDPF with the Inexact Newton method gives a speedup of 2.86 times for a system with over 10 000 buses if compared with traditional FDPF, both implemented based on MATLAB. This demonstrates the promising potential of the proposed FDPF computation using a preconditioned iterative solver under GPU architecture.
Published in: IEEE Transactions on Power Systems ( Volume: 32, Issue: 4, July 2017)