By Topic

Sparse vector method improvements via minimum inverse fill-in ordering

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)
Lee, C.-L. ; Dept. of Electr. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; Chen, N.

A practical ordering algorithm to enhance sparse vector methods without sacrificing the sparsity of the table of factors is presented. The proposed algorithm locally minimizes the number of new nonzero elements in the inverse of the lower triangular matrix during the factorization process. Two refined versions which can usually give the shortest length on factorization path of single and/or composite singletons are provided. Test results from previously published ordering algorithms based on minimum fill-in are also presented for comparison. The performance of applications to power system state estimation is evaluated. It is shown that the proposed ordering algorithm is a very effective strategy for the improvement of sparse vector methods

Published in:

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