Title |
Modified Partial Matrix Refactorization |
Abstract |
Partial Matrix Refactorization (PR) has been available for refactorization repeatedly. But this paper aims to present Modified PR(MPR), which is faster in (re) factorization speed and simpler in program than PR, but storage is almost as big as that of PR. MPR substitutes refactorization process of PR1 for Modifide Trifactortzation (MT) and, instead of PR 2, adds to PR1 the algoritm that calculates modified element values of modified row / cols. MT, which is subalgorithm for MPR, simplifies the algorithm by applying information vectors to currently used Trifactorization, and trifactorizes and refactorizes in high speed. The test results of Fast Decoupled Load Flow (FDLF) and Contingency Analysis useing Indexing Scheme and Optimal Ordering also prove that MPR is faster than PR. |