DocumentCode :
1479921
Title :
Partitioned sparse A-1 methods [power systems]
Author :
Alvarado, Fernando L. ; Yu, David C. ; Betancourt, Ramón
Author_Institution :
Wisconsin Univ., Madison, WI, USA
Volume :
5
Issue :
2
fYear :
1990
fDate :
5/1/1990 12:00:00 AM
Firstpage :
452
Lastpage :
459
Abstract :
The classic Ax=b problem in the partitioning of sparse vector matrices is solved by constructing factored components of the inverses of L and U, the triangular factors of matrix A. The number of additional fill-ins in the partitioned inverses of L and U can be made zero. The number of partitions is related to the path length of sparse vector methods. Allowing some fill-in in the partitioned inverses of L and U results in fewer partitions. Ordering algorithms most suitable for sparsity preservation in the inverses of L and U require addition fill-in in L and U themselves. Tests on practical power system matrices with from 118 to 1993 nodes indicate that the proposed approach is competitive in serial environments, and appears more suitable for parallel environments. Because sparse vectors are not required, the approach works not only for short-circuit calculations but also for power flow and stability computations
Keywords :
load flow; matrix algebra; power systems; stability; power flow; power system; short-circuit calculations; sparse vector matrices partitioning; stability computations; Equations; Parallel processing; Partitioning algorithms; Power systems; Sparse matrices; Topology;
fLanguage :
English
Journal_Title :
Power Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0885-8950
Type :
jour
DOI :
10.1109/59.54552
Filename :
54552
Link To Document :
بازگشت