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,
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Amestoy P.R., Duff I.S.: Vectorization of a multiprocessor multifrontal code. International Journal of Supercomputer Applications and High Performance Computing 3 (1989) 41–59
Barnard S.T., Simon H.D.: Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience6 (1994) 101–117.
Camarda K.V., Stadtherr M.A.: Matrix ordering strategies for process engineering: graph partitioning algorithms for parallel computation, Computers & Chemical Engineering, to appear.
Çatalyürek U.V., Aykanat C.: Decomposing Irregularly Sparse Matrices for Parallel Matrix-Vector Multiplication. Lecture Notes in Computer Science 1117 (1996) 75–86.
Choi H., Szyld D.B.: Application of threshold partitioning of sparse matrices to Markov chains. Technical Report 96-21, Dept. of Mathematics, Temple Univ., Philadephia, PA. (1996). Available from http://www.math.temple.edu/_szyld.
Coon A.B., M.A.Stadtherr M.A.: Generalized block-tridiagonal matrix orderings for parallel computation in-process flowsheeting. Computers & Chemical Engineering 19 (1995) 787–805.
Fiduccia C.M., Mattheyses R.M.: A linear time heuristic for improving network partitions. in Proc. 19th ACM-IEEE Design Automation Conf., Las Vegas, ACM (1982).
Gupta A., Karypis G., Kumar V.: Highly scalable parallel algorithms for sparse matrix factorization. IEEE Transactions on Parallel and Distributed Systems 5 (1997) 502–520.
Hendrickson B., Leland R.: A multilevel algorithm for partitioning graphs. Technical Report SAND93-1301, Sandia National Laboratories, Allbuquerque, NM (1993).
Hendrickson B., Kolda T.G.: Partitioning Rectangular and Structurally Nonsymmetric Sparse Matrices for Parallel Processing, submitted to SIAM Journal of Scientific Computing, available from http://www.cs.sandia.gov/_bahendr/papers.html
Hu Y. F., Blake R.J.: Numerical experiences with partitioning of unstructured meshes. Parallel Computing 20 (1994) 815–829.
Hu Y.F., Maguire K.C.M., Blake R.J.: A multilevel unsymmetric matrix ordering algorithm for parallel process simulation, in prepartion.
Karypis G., Kumar V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing 20 (1999) 359–392.
Kernighan B.W., Lin S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Tech. J. 49 (1970), pp. 291–308.
Mallya J.U., Zitney S.E., Choudhary S., Stadtherr M.A.: A parallel frontal solver for large-scale process simulation and optimization. AICHE JOURNAL 43 (1997) 1032–1040.
Mallya J.U., Zitney S.E., Choudhary S., Stadtherr M.A.: A parallel block frontal solver for large scale process simulation: Reordering effects. Computers & Chemical Engineering 21 (1997) 439–s444.
Vegeais J.A., Stadtherr M.A.: Parallel processing strategies for chemical process flowsheeting. AICHE Journal 38 (1992) 1399–1407.
Walshaw C., Cross M., Everett M.G.: Parallel dynamic graph partitioning for adaptive unstructured meshes. Journal of Parallel and Distributed Computing 47 (1997) 102–108.
Zitney S.E., Mallya J., Davis T.A., Stadtherr M.A.: Multifrontal vs frontal techniques for chemical process simulation on supercomputers Computers & Chemical Engineering 20 (1996) 641–646.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, Y.F., Maguire, K.C.F., Blake, R.J. (1999). Ordering Unsymmetric Matrices into Bordered Block Diagonal Form for Parallel Processing. In: Amestoy, P., et al. Euro-Par’99 Parallel Processing. Euro-Par 1999. Lecture Notes in Computer Science, vol 1685. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48311-X_38
Download citation
DOI: https://doi.org/10.1007/3-540-48311-X_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66443-7
Online ISBN: 978-3-540-48311-3
eBook Packages: Springer Book Archive