Referenced Items are not available for this document.
The objective of this paper is to present a recursive algorithm for permuting sparse matrices into the bordered block diagonal form. An outstanding feature of this algorithm is the resulting balance between the border size and the size of the diagonal blocks, which gives rise to an efficient multilevel scheme for parallel matrix factorization. This scheme is characterized by good load balancing and low interprocessor communications. In addition, it is specifically designed to minimize fill in within the factored matrix in order to preserve the original sparsity. Applications to power transmission systems are presented, together with a discussion of relevant parallelization and sparsity issues
Published in:
Circuits and Systems I: Fundamental Theory and Applications, IEEE Transactions on
(Volume:41
,
Issue:
3
)
Date of Publication: Mar 1994
- Page(s):
- 220 - 233
- ISSN :
- 1057-7122
- INSPEC Accession Number:
- 4680780
- Digital Object Identifier :
- 10.1109/81.273921
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Mar 1994
- Sponsored by :
- IEEE Circuits and Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
