Journal
IEEE TRANSACTIONS ON POWER SYSTEMS
Volume 33, Issue 1, Pages 166-173Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2017.2695962
Keywords
Graph sparsification; linear system solution; matrix preconditioning; power system simulation
Categories
Funding
- National Science Foundation [EECS 1307458]
- Chancellor's Fellowship of Missouri ST
Ask authors/readers for more resources
Many power systems applications such as power flow and short-circuit analysis require very large sparse matrix computations. With the increase in reliance on our electric infrastructure, power systems are continually growing in size, creating greater computational complexity in solving these large linear systems within reasonable time. For sparse matrix applications, it is desirable to have an algorithm with low runtime complexity in terms of the number of nonzeros in the matrix. There have been several recent advances in computational methods in other fields that, if applied to power system, could make real-time dynamic simulation a reality. Much work has been done for specific types of these problems where the system is symmetric and diagonally dominant, similar to the form of power system matrices. This paper details an expansion on the current work in fast linear solvers to develop power system specific methods that show potential for accurate solutions inO(m log(2) n) run times, where n represents the number of nodes and m represents the number of nonzeros in the power system matrix. This paper presents the simulation validation of a recently developed recursively solved iterative chain method for sparse matrices using a low stretch spanning tree preconditioner.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available