A Dual Method for Computing Power Transfer Distribution Factors
Henrik Ronellenfitsch, Marc Timme, Dirk Witthaut

TL;DR
This paper introduces a dual method for calculating Power Transfer Distribution Factors (PTDFs) that leverages network cycles, reducing matrix size and computational effort, especially in grids with few cycles.
Contribution
The paper presents a non-approximative dual approach to compute PTDFs using cycle-based topology, changing the matrix inversion from N×N to (L-N+1)×(L-N+1), enhancing efficiency.
Findings
Method reduces matrix size for PTDF calculation.
Potential speedup in power grids with few cycles.
Maintains mathematical equivalence to traditional methods.
Abstract
Power Transfer Distribution Factors (PTDFs) play a crucial role in power grid security analysis, planning, and redispatch. Fast calculation of the PTDFs is therefore of great importance. In this paper, we present a non-approximative dual method of computing PTDFs. It uses power flows along topological cycles of the network but still relies on simple matrix algebra. At the core, our method changes the size of the matrix that needs to be inverted to calculate the PTDFs from , where is the number of buses, to , where is the number of lines and is the number of independent cycles (closed loops) in the network while remaining mathematically fully equivalent. For power grids containing a relatively small number of cycles, the method can offer a speedup of numerical calculations.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
