By Topic

Mode ordering algorithms for sparse vector method improvement

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
$31 $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

2 Author(s)
Gomez, A.G. ; Dept. of Electr. & Electron. Eng., Seville Univ., Spain ; Franquelo, L.G.

Three node-ordering algorithms that enhance sparse vector methods without losing sparse matrix method efficiency are presented. The performance of the algorithms is compared with that of the minimum-degree algorithm for eight test systems up to 661 nodes. For the factorization of a sparse matrix into UtU, the new algorithms give a similar or even better sparsity for U, while clearly improving the sparsity of U-1

Published in:

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