IEEJ Transactions on Power and Energy
Online ISSN : 1348-8147
Print ISSN : 0385-4213
ISSN-L : 0385-4213
Paper
A Fast Algorithm for LU Decomposition of a Large Sparse Matrix in an Electromagnetic Transient Analysis Program
Rikido YonezawaTaku Noda
Author information
JOURNAL FREE ACCESS

2018 Volume 138 Issue 6 Pages 473-481

Details
Abstract

For electromagnetic transient (EMT) analysis programs, faster simulations are always desired, since circuits to be simulated are becoming larger and larger. This paper proposes a non-zero element combination recording algorithm for fast search for non-zero elements in the LU decomposition of a large sparse matrix obtained from circuit equations. It should be noted that the solution process of the circuit equations occupies a large portion of the total simulation time. A sparse matrix routine with the proposed algorithm has been developed. In a simulation case with a synchronous generator model which requires frequent LU decompositions, the developed routine is faster by 1.5 times than the conventional one.

Content from these authors
© 2018 by the Institute of Electrical Engineers of Japan
Previous article Next article
feedback
Top