Metraipolis › archive › dc_aea8e15de79c
Low-rank corrections to a shared reference Jacobian for GPU-parallel AC $N\!-\!1$ contingency analysis — arXiv:2611.03012
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03012
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:26:51.803Z
- SHA-256 of the archived text
bce80dc418fc0c55d440e0e245ce0bc9d0e6cf2253d010b351733fb6fb734b56- Stable URL of this page
https://metraipolis.com/documento/dc_aea8e15de79c
How to cite
Low-rank corrections to a shared reference Jacobian for GPU-parallel AC $N\!-\!1$ contingency analysis — arXiv:2611.03012 — arXiv (en), https://arxiv.org/abs/2611.03012 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_aea8e15de79c (Metraipolis archive dc_aea8e15de79c, sha256 bce80dc418fc0c55d440e0e245ce0bc9d0e6cf2253d010b351733fb6fb734b56)
BibTeX
@misc{dcaea8e15de79c,
title = {Low-rank corrections to a shared reference Jacobian for GPU-parallel AC $N!-!1$ contingency analysis — arXiv:2611.03012},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03012},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_aea8e15de79c; sha256 bce80dc418fc0c55d440e0e245ce0bc9d0e6cf2253d010b351733fb6fb734b56},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03012. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Contingency analysis repeatedly solves the power-flow equations under many single-element outages, an increasingly demanding workload as operating margins tighten and renewable variability grows. Graphics processing units (GPUs) are attractive for this task, but a change in topology alters the sparsity pattern of the Jacobian, preventing the uniform batched factorization on which efficient GPU solvers rely. This paper presents a GPU-parallel Newton--Raphson solver for $N\!-\!1$ contingency analysis that separates the change in operating state from the change in topology. A single reference Jacobian is inverted once and reused across all contingencies. Each topology change is expressed as a low-rank Woodbury correction, while the residual state-dependent perturbation is handled by an inner iterative solve, a truncated Neumann series or the biconjugate gradient stabilized method. We analyze the spectral radius and condition number of the resulting iteration matrices and show that the reference Jacobian is an effective preconditioner. On transmission-scale benchmarks, the method attains per-topology solve times competitive with an optimized 80-core central processing unit baseline, with the low-rank correction accounting for approximately 1--2\% of the workload. This makes GPU-parallel $N\!-\!1$ contingency analysis feasible at transmission scale without per-topology refactorization. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Systems and Control (eess.SY) ; Distributed, Parallel, and Cluster Computing (cs.DC); Numerical Analysis (math.NA). Pagina del lavoro: https://arxiv.org/abs/2611.03012 — 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-11-03T18:10:22.861Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).