Saved in:
Bibliographic Details
Main Authors: Duque, Edgar Mauricio Salazar, Giraldo, Juan S., Vergara, Pedro P., Nguyen, Phuong H., Han, Slootweg
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2403.04578
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914707436208128
author Duque, Edgar Mauricio Salazar
Giraldo, Juan S.
Vergara, Pedro P.
Nguyen, Phuong H.
Han
Slootweg
author_facet Duque, Edgar Mauricio Salazar
Giraldo, Juan S.
Vergara, Pedro P.
Nguyen, Phuong H.
Han
Slootweg
contents 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 in distribution systems. The presented algorithms are the base for a new TensorPowerFlow (TPF) tool and shine for their simplicity, benefiting from multicore \gls{cpu} and \gls{gpu} parallelization. We also focus on the mathematical convergence properties of the algorithm, showing that its unique solution is at the practical operational point, which is the solution of high-voltage and low-current. The proof is validated using numerical simulations showing the robustness of the FPI algorithm compared to the classical \gls{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.
format Preprint
id arxiv_https___arxiv_org_abs_2403_04578
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Tensor Power Flow Formulations for Multidimensional Analyses in Distribution Systems
Duque, Edgar Mauricio Salazar
Giraldo, Juan S.
Vergara, Pedro P.
Nguyen, Phuong H.
Han
Slootweg
Systems and Control
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 in distribution systems. The presented algorithms are the base for a new TensorPowerFlow (TPF) tool and shine for their simplicity, benefiting from multicore \gls{cpu} and \gls{gpu} parallelization. We also focus on the mathematical convergence properties of the algorithm, showing that its unique solution is at the practical operational point, which is the solution of high-voltage and low-current. The proof is validated using numerical simulations showing the robustness of the FPI algorithm compared to the classical \gls{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.
title Tensor Power Flow Formulations for Multidimensional Analyses in Distribution Systems
topic Systems and Control
url https://arxiv.org/abs/2403.04578