By Topic

Dependency-based algorithms for vector processing of sparse matrix forward/backward substitutions [power system stability analysis]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
G. T. Vuong ; Hydro-Quebec, Montreal, Que., Canada ; R. Chahine ; G. P. Granelli ; M. Montagna

Recent efforts to improve the execution speed of steady-state and transient analysis of power systems are focused on exploiting parallel and vector processing. In this paper, two algorithms for forward/backward substitutions and their implementation on vector computers are considered. A dependency-based substitution algorithm (DBSA) is proposed and compared with the well known W-matrix method. According to DBSA, the nonzero entries of the factor matrices are rearranged in groups of elements (slices) leading to independent operations. In the implementation of the W-matrix method, the nonzero elements of the inverse factors are grouped in sets (pseudocolumns) to overcome the problem of dependency between addition operations. Test cases, performed on a CRAY X-MP2/216 and a CRAY Y-MP8/464 vector computer, are taken from real-life power system problems and consist in the solution of linear systems with up to 12000 equations. The maximum speed-ups achieved (with respect to a code based on standard sparsity programming) are near to 7 for complex arithmetic and to 11 for real arithmetic

Published in:

IEEE Transactions on Power Systems  (Volume:11 ,  Issue: 1 )