AMPS: An Augmented Matrix Formulation for Principal Submatrix Updates with Application to Power Grids

by   Yu-Hong Yeung, et al.

We present AMPS, an augmented matrix approach to update the solution to a linear system of equations when the matrix is modified by a few elements within a principal submatrix. This problem arises in the dynamic security analysis of a power grid, where operators need to perform N - k contingency analysis, i.e., determine the state of the system when exactly k links from N fail. Our algorithms augment the matrix to account for the changes in it, and then compute the solution to the augmented system without refactoring the modified matrix. We provide two algorithms, a direct method, and a hybrid direct-iterative method for solving the augmented system. We also exploit the sparsity of the matrices and vectors to accelerate the overall computation. We analyze the time complexity of both algorithms, and show that it is bounded by the number of nonzeros in a subset of the columns of the Cholesky factor that are selected by the nonzeros in the sparse right-hand-side vector. Our algorithms are compared on three power grids with PARDISO, a parallel direct solver, and CHOLMOD, a direct solver with the ability to modify the Cholesky factors of the matrix. We show that our augmented algorithms outperform PARDISO (by two orders of magnitude), and CHOLMOD (by a factor of up to 5). Further, our algorithms scale better than CHOLMOD as the number of elements updated increases. The solutions are computed with high accuracy. Our algorithms are capable of computing N - k contingency analysis on a 778 thousand bus grid, updating a solution with k = 20 elements in 16 milliseconds on an Intel Xeon processor.


AMPS: A Real-time Mesh Cutting Algorithm for Surgical Simulations

We present the AMPS algorithm, a finite element solution method that com...

On numerical solution of full rank linear systems

Matrices can be augmented by adding additional columns such that a parti...

Fast Stencil Computations using Fast Fourier Transforms

Stencil computations are widely used to simulate the change of state of ...

On Solving Groundwater Flow and Transport Models with Algebraic Multigrid Preconditioning

Sparse iterative solvers preconditioned with the algebraic multigrid has...

A Direct Parallel-in-Time Quasi-Boundary Value Method for Inverse Space-Dependent Source Problems

Inverse source problems arise often in real-world applications, such as ...

Training Simplification and Model Simplification for Deep Learning: A Minimal Effort Back Propagation Method

We propose a simple yet effective technique to simplify the training and...

Please sign up or login with your details

Forgot password? Click here to reset