Direct sparse Jacobian assembly speeds up power-flow analysis
Symbolic-Permutation-Based Direct Sparse Jacobian Assembly for Accelerated Power-Flow Analysis
Performance
Summary
Power-flow analysis in electrical grids involves solving equations repeatedly, which can be slow because assembling a certain matrix takes a lot of time. The authors found a way to assemble this matrix faster by reordering calculations beforehand so that the computer does fewer steps when running the analysis multiple times. They put all these steps together into a single efficient process that uses memory better, making the solver work much faster without changing accuracy. Their approach is tested on standard power grid models and is built into an open-source software.
What this means in practice
- •For power grid operators: Reduce the time needed for power-flow calculations to support faster decision-making in grid management.
- •For power system software engineers: Implement faster Jacobian assembly methods in simulation tools for transient stability, EMT simulation, and optimal power flow.
Authors
Tianshi Cheng, Venkata Dinavahi
Abstract
The repeated assembly of the sparse Jacobian matrix constitutes a primary computational bottleneck in the Newton-Raphson power-flow analysis. Through an algebraic equivariance analysis of the Jacobian matrix, this paper proposes a direct sparse Jacobian assembly method based on symbolic permutation. By pre-applying the permutation to the admittance matrix during a one-time symbolic phase, the runtime bus-type projection overhead is entirely eliminated. Consequently, complex Jacobian differentiation and global matrix assembly fuse into a single operation, yielding a single-pass, branchless algorithm that streams values directly into contiguous memory. The framework is realized in the open-source RustPower solver. Benchmarks on IEEE test systems and PEGASE 9241 demonstrate that the proposed assembly is 24.4-30.1x faster than the MATPOWER- style baseline and 6.0-7.8x faster than the Schafer-Braun optimized assembly. End-to-end, the grid-level solve time is 11.7x-154.3x faster than pandapower 3.5.4 with Numba, while leaving numerical results and convergence behavior unchanged. Compared with the native C++ LightSim2Grid 1.0.0, grid-level performance is comparable on IEEE 39 and 1.3x-1.8x faster on IEEE 118 and the PEGASE systems. The method extends directly to general problems where a sparse Jacobian inherits its structure from a static network operator, including transient stability analysis, EMT simulation, and OPF Hessian assembly.