Ordering Unsymmetric Matrices into Bordered Block Diagonal Form for Parallel Processing

Authors:
Y. F. Hu;K. C. F. Maguire;R. J. Blake
Affiliations:
-;-;-
Venue:
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Year:
1999

Citing 7
Cited 0

Numerical experiences with partitioning of unstructured meshes

Parallel Computing
Highly Scalable Parallel Algorithms for Sparse Matrix Factorization

IEEE Transactions on Parallel and Distributed Systems
Parallel dynamic graph partitioning for adaptive unstructured meshes

Journal of Parallel and Distributed Computing - Special issue on dynamic load balancing
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

SIAM Journal on Scientific Computing
Partitioning Rectangular and Structurally Unsymmetric Sparse Matrices for Parallel Processing

SIAM Journal on Scientific Computing
Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication

IRREGULAR '96 Proceedings of the Third International Workshop on Parallel Algorithms for Irregularly Structured Problems
A linear-time heuristic for improving network partitions

DAC '82 Proceedings of the 19th Design Automation Conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

Large, sparse, unsymmetric systems of linear equations appear frequently in areas such as chemical engineering. One way of speeding up the solution of these linear systems is to solve them in parallel by reordering the unsymmetric matrix into a bordered block-diagonal (BBD) form. A multilevel ordering algorithm is presented in this paper. Numerical results of the algorithm are given to demonstrate that this algorithm gives better orderings than existing algorithms.