By Topic

Application of threshold partitioning of sparse matrices to Markov chains

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)
Choi, H. ; Dept. of Math., Temple Univ., Philadelphia, PA, USA ; Szyld, D.B.

Three algorithms which permute and partition a sparse matrix are presented as tools for the improved solution of Markov chain problems. One is the algorithm PABLO [SIAM J. Sci. Stat. Computing, vol.11, pp.811-823, 1990] while the other two are modifications of it. In the new algorithms, in addition to the location of the nonzeros, the values of the entries are taken into account. The permuted matrices are well suited for block iterative methods that find the corresponding probability distribution, as well as for block diagonal preconditioners of Krylov-based methods. Also, if the partition obtained from the ordering algorithm is used as an aggregation scheme, an iterative aggregation method performs better with this partition than with others found in the literature. Numerical experiments illustrate the performance of the iterative methods with the new orderings

Published in:

Computer Performance and Dependability Symposium, 1996., Proceedings of IEEE International

Date of Conference:

4-6 Sep 1996