Towards Perturbation-Induced Static Pivoting on GPU-Based Linear Solvers
Linear system solving is a key tool for computational power system studies, e.g., optimal power flow, transmission switching, or unit commitment. CPU-based linear system solver speeds, however, have saturated in recent years. Emerging research shows that GPU-based linear system solvers are beginning to achieve notable speedup over CPU-based alternatives in some applications. Due to the architecture of GPU memory access, numerical pivoting represents the new bottleneck which prevents GPU-based solvers from running even faster. Accordingly, this paper proposes a matrix perturbation-based method to induce static pivoting. Using this approach, a series of perturbed, well-conditioned, pivot-free linear systems are solved in parallel on GPUs. Matrix expansion routines are then used to linearly combine the results, and the true solution is recovered to an arbitrarily high degree of theoretical accuracy. We showcase the validity of our approach on distributed-slack AC power flow solve iterations associated with the PGLib 300-bus test case.
Code (0)
등록된 구현이 없습니다.
Tasks
CPUGPUSimilar Papers 제목 키워드 기반
Empirical Perturbation Analysis of Linear System Solvers from a Data Poisoning Perspective
The perturbation analysis of linear solvers applied to systems arising broadly in machine learning settings -- for instance, when using linear regression models -- establishes an important perspective when reframing thes…
Data PoisoningNovel Pivoted Cholesky Decompositions for Efficient Gaussian Process Inference
The Cholesky decomposition is a fundamental tool for solving linear systems with symmetric and positive definite matrices which are ubiquitous in linear algebra, optimization, and machine learning. Its numerical stabilit…
Gaussian ProcessesActive LearningStAnD: A Dataset of Linear Static Analysis Problems
Static analysis of structures is a fundamental step for determining the stability of structures. Both linear and non-linear static analyses consist of the resolution of sparse linear systems obtained by the finite elemen…
CPUGPUAdaptive randomized pivoting and volume sampling
Adaptive randomized pivoting (ARP) is a recently proposed and highly effective algorithm for column subset selection. This paper reinterprets the ARP algorithm by drawing connections to the volume sampling distribution a…
Active LearningPerturbation-Induced Linearization: Constructing Unlearnable Data with Solely Linear Classifiers
Collecting web data to train deep models has become increasingly common, raising concerns about unauthorized data usage. To mitigate this issue, unlearnable examples introduce imperceptible perturbations into data, preve…