Fast load-flow calculations based on spanning trees - G2Elab-SYstèmes et Réseaux ELectriques
Communication Dans Un Congrès Année : 2023

Fast load-flow calculations based on spanning trees

Résumé

In this article a method is implemented for computing load flows that does not rely on the full resolution of a linear system. Instead, we solve very quickly many local load flows corresponding to dipoles (the electrical power is injected at two nodes) with an algorithm based on a Hamiltonian formalism, as it is usually done in quantum physics. The computational burden is quadratic in the size of the network when the dipoles are defined by the lines of a spanning tree of the network. This leads to a considerable speedup when compared to traditional methods relying on the full system inversion as well as methods involving other subproblems.
Fichier principal
Vignette du fichier
08618-fichier.pdf (257.86 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04166065 , version 1 (19-07-2023)

Identifiants

  • HAL Id : hal-04166065 , version 1

Citer

Pierrick Guichard, Nicolas Retière, Didier Mayou. Fast load-flow calculations based on spanning trees. IEEE PES ISGT EUROPE 2023 "Powering solutions for decarbonized and resilient future smartgrids”, Université Grenoble Alpes; IEEE Power & Energy Society, Oct 2023, Grenoble, France. ⟨hal-04166065⟩
109 Consultations
80 Téléchargements

Partager

More