A multilevel unsymmetric matrix ordering algorithm for parallel process simulation

Computers and Chemical Engineering

Volumn 23, Issue 11-12, 2000, Pages 1631-1647

  Hu, Y F ^a   Maguire, K C F ^a   Blake, R J ^a  

^a DARESBURY LABORATORY   (United Kingdom)

Author keywords

Bordered block diagonal; Chemical process simulation; Graph partitioning; Multilevel parallel computation; Sparse unsymmetric matrix ordering

Indexed keywords

ALGORITHMS; CHEMICAL ENGINEERING; COMPUTER SIMULATION; GRAPH THEORY; MATRIX ALGEBRA;

MULTILEVEL PARTITIONING COMPUTATION; SPARSE UNSYMMETRIC MATRIX ORDERING;

PROCESS ENGINEERING;

ALGORITHM; ARTICLE; CHEMICAL INDUSTRY; CHEMICAL PROCEDURES; COMPUTER MODEL; COMPUTER SIMULATION; LINEAR SYSTEM; MATHEMATICAL COMPUTING; TECHNIQUE;

EID: 0034606778     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(99)00314-2     Document Type: Article

References (36)

1. 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.
2. Barnard S. T., Simon H. D. Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience. 6:1994;101-117.
3. Camarda, K. V., & Stadtherr, M. A. (1998). Matrix ordering strategies for process engineering: graph partitioning algorithms for parallel computation. Computers & Chemical Engineering (in press).
4. Çatalyürek U. V., Aykanat C. Decomposing irregularly sparse matrices for parallel matrix-vector multiplication. Lecture Notes in Computer Science. 1117:1996;75-86.
5. Choi, H., & Szyld, D. B. (1996). Application of threshold partitioning of sparse matrices to Markov chains. Technical report 96-21, Department of Mathematics, Temple University, Philadephia, PA. Available from http://www.math.temple.edu/~szyld.
6. Cofer H. N., Stadtherr M. A. Reliability of iterative linear solvers in chemical process simulation. Computers & Chemical Engineering. 20:1996;1123-1132.
7. Coon A. B., Stadtherr M. A. Generalized block-tridiagonal matrix orderings for parallel computation in-process flowsheeting. Computers & Chemical Engineering. 19:1995;787-805.
8. Duff I. S., Reid J. K. The multifrontal solution of indefinite sparse symmetric linear-equations. ACM Transactions on Mathematical Software. 9:1983;302-325.
9. Duff I. S., Reid J. K. The multifrontal solution of unsymmetric sets of linear-equations. SIAM Journal on Scientific and Statistical Computing. 5:1984;633-641.
10. Fiduccia, C. M., & Mattheyses, R. M. (1982). A linear time heuristic for improving network partitions. In: Proceedings of the Nineteenth ACM-IEEE Design Automation Conference, Las Vegas, ACM.
11. 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.
12. Hendrickson, B., & Kolda, T. G. (1998). Partitioning rectangular and structurally nonsymmetric sparse matrices for parallel processing. SIAM Journal of Scientific Computing (in press). Available from http://www.cs.sandia.gov/~bahendr/papers.html.
13. Hendrickson, B., & Leland, R. (1993a). The chaco user's guide, version 1.0. Technical report sand93-2339, Sandia National Laboratories, Albuquerque, NM.
14. Hendrickson, B., & Leland, R. (1993b). A multilevel algorithm for partitioning graphs. Technical report sand93-1301, Sandia National Laboratories, Albuquerque, NM.
15. Hu Y. F., Blake R. J. Numerical experiences with partitioning of unstructured meshes. Parallel Computing. 20:1994;815-829.
16. Karypis, G. & Kumar, V. (1995). Parallel multilevel graph partitioning. Technical report, Department of Computer Science, University of Minnesota, Minneapolis, MN 55455.
17. Karypis G., Kumar V. Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing. 48:1998a;96-129.
18. Karypis G., Kumar V. A parallel algorithm for multilevel graph partitioning and sparse matrix ordering. Journal of Parallel and Distributed Computing. 48:1998b;71-95.
19. Karypis G., Kumar V. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing. 20:1999;359-392.
20. Kernighan B. W., Lin S. An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal. 49:1970;291-308.
21. Mallya J. U., Stadtherr M. A. A multifrontal approach for simulating equilibrium-stage processes on supercomputers. Industrial & Engineering Chemistry Research. 36:1997;144-151.
22. 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:1997a;s439-s444.
23. Mallya J. U., Zitney S. E., Choudhary S., Stadtherr M. A. A parallel frontal solver for large-scale process simulation and optimization. American Institute of Chemical Engineers Journal. 43:1997b;1032-1040.
24. Mayoh B. H. A graph technique for inverting certain matrices. Mathematics of Computation. 19:1965;198-213.
25. Oliker L., Biswas R. Plum: parallel load balancing for adaptive unstructured meshes. Journal of Parallel and Distributed Computing. 52:1998;150-177.
26. Reid, J. K. & Scott, J. A. (1998). Ordering symmetric sparse matrices for small profile and wavefront. Technical report ral-tr-98-016, Rutherford Appleton Laboratory, Oxon OX11 0QX, UK.
27. Simon H. D. Partitioning of unstructured problems for parallel processing. Computer Systems in Engineering. 2:1991;135-148.
28. Simon H. D., Sohn A., Biswas R. Harp: A dynamic spectral partitioner. Journal of Parallel and Distributed Computing. 50:1998;83-103.
29. Tewarson R. P. Sparse matrices. 1973;Academic Press.
30. Vegeais J. A., Stadtherr M. A. Parallel processing strategies for chemical process flowsheeting. American Institute of Chemical Engineers Journal. 38:1992;1399-1407.
31. Walshaw, C., Cross, M., & Everett, M. (1995). Dynamic mesh partitioning: a unified optimisation and load-balancing algorithm. Technical report 95/im/06, University of Greenwich, London SE18 6PF, UK.
32. 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.
33. Westerberg A. W., Berna T. J. Decomposition of very large-scale Newton-Raphson based flowsheeting problems. Computers & Chemical Engineering. 2:1978;61.
34. Zitney S. E., Brull L., Lang L., Zeller R. Plantwide dynamic simulation on supercomputers-modeling a Bayer distillation process. American Institute of Chemical Engineers Symposium Series. 91:1995;313-316.
35. 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.
36. Zitney S. E., Stadtherr M. A. Frontal algorithms for equation-based chemical process flowsheeting on vector and parallel computers. Computers & Chemical Engineering. 17:1993;319-338.