By Topic

New ordering methods for sparse matrix inversion via diagonalization

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)
Wang, Y.Q. ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Gooi, H.B.

Two new ordering methods that can be used to reduce the elements in the inverse factors of a sparse matrix are proposed. Compared with all other commonly used ordering methods, the new methods will produce less fill-in elements. The proposed methods are based on the diagonalization of A via the use of a transformation matrix, C. A new node sequence for the power network and all the elements of the C matrix are generated in only a single stage instead of the conventional LDU decomposition followed by a series of multiplications for W-matrix. The methods may be used for the parallel solution of sparse matrix equations. Test results show that the proposed methods can reduce the computation burden effectively

Published in:

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