TY - JOUR
T1 - Tensor power flow formulations for multidimensional analyses in distribution systems
AU - Salazar Duque, Edgar Mauricio
AU - Giraldo, Juan S.
AU - Vergara, Pedro P.
AU - Nguyen, Phuong H.
AU - Slootweg, J.G.
N1 - Publisher Copyright:
© 2024 The Author(s)
PY - 2024/11
Y1 - 2024/11
N2 - In this paper, we present two multidimensional power flow formulations based on a fixed-point iteration (FPI) algorithm to efficiently solve hundreds of thousands of Power flows (PFs) in distribution systems. The presented algorithms are the base for a new TensorPowerFlow (TPF) tool and shine for their simplicity, benefiting from multicore Central processing unit (CPU) and Graphics processing unit (GPU) parallelization. We also focus on the mathematical convergence properties of the algorithm, showing that its unique solution is at the practical operational point. The proof is validated using numerical simulations showing the robustness of the FPI algorithm compared to the classical Newton–Raphson (NR) approach. In the case study, a benchmark with different PF solution methods is performed, showing that for applications requiring a yearly simulation at 1-minute resolution, the computation time is decreased by a factor of 164, compared to the NR in its sparse formulation. Finally, a set of applications is described, highlighting the potential of the proposed formulations over a wide range of analyses in distribution systems.
AB - In this paper, we present two multidimensional power flow formulations based on a fixed-point iteration (FPI) algorithm to efficiently solve hundreds of thousands of Power flows (PFs) in distribution systems. The presented algorithms are the base for a new TensorPowerFlow (TPF) tool and shine for their simplicity, benefiting from multicore Central processing unit (CPU) and Graphics processing unit (GPU) parallelization. We also focus on the mathematical convergence properties of the algorithm, showing that its unique solution is at the practical operational point. The proof is validated using numerical simulations showing the robustness of the FPI algorithm compared to the classical Newton–Raphson (NR) approach. In the case study, a benchmark with different PF solution methods is performed, showing that for applications requiring a yearly simulation at 1-minute resolution, the computation time is decreased by a factor of 164, compared to the NR in its sparse formulation. Finally, a set of applications is described, highlighting the potential of the proposed formulations over a wide range of analyses in distribution systems.
KW - Fixed-point iteration
KW - GPU
KW - Mixed computer resources
KW - Power flow
KW - Tensor
UR - http://www.scopus.com/inward/record.url?scp=85206675719&partnerID=8YFLogxK
U2 - 10.1016/j.ijepes.2024.110275
DO - 10.1016/j.ijepes.2024.110275
M3 - Article
AN - SCOPUS:85206675719
SN - 0142-0615
VL - 162
JO - International Journal of Electrical Power and Energy Systems
JF - International Journal of Electrical Power and Energy Systems
M1 - 110275
ER -