DocumentCode :
1046794
Title :
Sparse Solutions Using Hash Storage
Author :
Smith, Otto J.M. ; Makani, Kalpana ; Krishna, Lakshmi
Author_Institution :
Department of Electrical Engineering and Computer Sciences University of California
Issue :
4
fYear :
1972
fDate :
7/1/1972 12:00:00 AM
Firstpage :
1396
Lastpage :
1404
Abstract :
An efficient computer program which permits rapid calculations for solving a large sparse system of linear equations, which arise in most power system network problems, is described here. This procedure will have an application to any system having a similar admittance matrix to the power system, such as a weather prediction or transportation system. The basic powerful tool¿direct hash technique¿ is used to store the nonzero elements of the sparse matrix. The two main features, triangular factorization of the given sparse matrix and use of this factored form to find the direct solution to the system, are used to estimate a post-transient steady state of a power system. Updating the node admittance matrix after a change in the system structure is also performed in factored matrix form. In both factoring the Jacobian and in changing the the system structure, the introduction of additional non-zero terms in a sparse matrix is easily handled without prior knoledge of the new locations.
Keywords :
Admittance; Application software; Computer networks; Equations; Jacobian matrices; Power systems; Sparse matrices; State estimation; Transportation; Weather forecasting;
fLanguage :
English
Journal_Title :
Power Apparatus and Systems, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9510
Type :
jour
DOI :
10.1109/TPAS.1972.293271
Filename :
4074867
Link To Document :
بازگشت