Metraipolis › archive › dc_3c15ac7bbeea
Sparse Generalized-Admittance AC Power Flow for Fast Contingency Analysis and Remedial-Action Assessment — arXiv:2609.14132
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14132
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T02:57:56.301Z
- SHA-256 of the archived text
30205154869559e96c25a22d459f0252fb54d5d0a876457c75d3891c51127b5b- Stable URL of this page
https://metraipolis.com/documento/dc_3c15ac7bbeea
How to cite
Sparse Generalized-Admittance AC Power Flow for Fast Contingency Analysis and Remedial-Action Assessment — arXiv:2609.14132 — arXiv (en), https://arxiv.org/abs/2609.14132 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3c15ac7bbeea (Metraipolis archive dc_3c15ac7bbeea, sha256 30205154869559e96c25a22d459f0252fb54d5d0a876457c75d3891c51127b5b)
BibTeX
@misc{dc3c15ac7bbeea,
title = {Sparse Generalized-Admittance AC Power Flow for Fast Contingency Analysis and Remedial-Action Assessment — arXiv:2609.14132},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14132},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3c15ac7bbeea; sha256 30205154869559e96c25a22d459f0252fb54d5d0a876457c75d3891c51127b5b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14132. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Repeated AC power-flow calculations are common tasks in transmission system operations, in particular for contingency analysis and remedial-action assessment. For large networks, their cumulative runtime can become a computational bottleneck in operational processes. This paper develops a sparse reformulation of the generalized bus-admittance power-flow method known as PFPD. Loads and generators are represented by fixed shunt admittance terms on the diagonal of the admittance matrix, while corrective nodal currents are iteratively computed to match the constant-power and regulated-voltage constraints. In contrast to the original formulation, the slack bus is treated as a fixed-voltage boundary and removed from the admittance block decomposition. The resulting iteration reuses sparse LU factorizations of the initial generalized non-slack matrix and its PQ block, without explicitly forming dense inverse matrices. The same formulation admits two initialization modes: an unsolved base case using the same flat-start shunt heuristic as in the primary PFPD method, and repeated post-action calculations initialized from a solved operating point. Localized topology and parameter changes are expressed as low-rank admittance updates and the resulting admittance matrices are inverted by means of the Woodbury identity. An optional local-network formulation can provide an warm start before full-network refinement. N-1 experiments on the 1354-bus and 9241-bus PEGASE systems and the 6717-bus synthetic Texas system yield average per-contingency speedups between 14.4 and 18.0 relative to pandapower. On transformer tap-position actions, the method is 2.8--2.9 times faster than pandapower and 7.2--29.9 times faster than PowSyBl OpenLoadFlow. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-15 in eess.SY). Categorie arXiv: Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2609.14132 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T02:45:08.532Z dalla pagina https://arxiv.org/catchup/eess.SY/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).