Linear solvers for power grid optimization problems: a review of GPU-accelerated linear solvers
arXiv:2106.13909 · doi:10.1016/j.parco.2021.102870
Abstract
The linear equations that arise in interior methods for constrained optimization are sparse symmetric indefinite and become extremely ill-conditioned as the interior method converges. These linear systems present a challenge for existing solver frameworks based on sparse LU or LDL^T decompositions. We benchmark five well known direct linear solver packages using matrices extracted from power grid optimization problems. The achieved solution accuracy varies greatly among the packages. None of the tested packages delivers significant GPU acceleration for our test cases.
Cited by in corpus (6)
- Accelerating Optimal Power Flow with GPUs: SIMD Abstraction of Nonlinear Programs and Condensed-Space Interior-Point Methods
- MPCGPU: Real-Time Nonlinear Model Predictive Control through Preconditioned Conjugate Gradient on the GPU
- Exploiting GPU/SIMD Architectures for Solving Linear-Quadratic MPC Problems
- Bean: A Language for Backward Error Analysis
- Towards Efficient Alternating Current Optimal Power Flow Analysis on Graphical Processing Units
- Accelerated Computation and Tracking of AC Optimal Power Flow Solutions using GPUs