Frontal solvers for process engineering: Local row ordering strategies

Computers and Chemical Engineering

Volumn 22, Issue 3, 1998, Pages 333-341

  Camarda, Kyle V ^a,c   Stadtherr, Mark A ^b  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b UNIVERSITY OF NOTRE DAME   (United States)

^c The Pennsylvania State University   (United States)

Author keywords

Chemical process simulation; Column degree heuristic; Frontal method

Indexed keywords

ALGORITHMS; CHEMICAL ENGINEERING; COMPUTER SIMULATION; GRAPH THEORY; HEURISTIC METHODS; MATRIX ALGEBRA; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; SUPERCOMPUTERS; VECTORS;

COLUMN DEGREE HEURISTIC METHOD; FRONTAL METHOD; LOCAL ROW ORDERING STRATEGY;

PROCESS ENGINEERING;

EID: 0031706805     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0098-1354(97)00238-X     Document Type: Article

References (29)

1. Cofer, H. N. and Stadtherr, M. A. (1996) Reliability of iterative linear solvers in chemical process simulation. Comput. Chem. Engng. 20, 1123-1132.
2. Cuthill, E. and J. McKee, Reducing the bandwidth of sparse symmetric matrices. In Proc. ACM National Conference, pp. 157-172. Association for Computing Machinery, New York (1969).
3. Davis, T. A., Amestoy, P. and Duff, I. S. (1996) An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. Appl. 17, 886-905.
4. Davis, T. A. and Duff, I. S. (1997) An unsymmetric-pattern multifrontal method for sparse LU factorization. SIAM J. Matrix Anal. Appl. 18, 140-158.
5. Duff, I. S. and Reid, J. K. (1974) A comparison of sparsity orderings for obtaining a pivotal sequence in Gaussian elimination. Int. Inst. Math. Applic. 14, 281-291.
6. Duff, I. S. and Reid, J. K. (1983) The multifrontal solution of indefinite sparse symmetric linear equations. ACM Trans. Math. Softw. 9, 302-325.
7. Duff, I. S., Reid, J. K. and Scott, J. A. (1989) The use of profile reduction algorithms with a frontal code. Int. J. Num. Meth. Eng. 28, 2555-2568.
8. Eisenstat, S. C., Schultz, M. H. and Sherman, A. H. (1981) Algorithms and data structures for sparse symmetric Gaussian elimination. SIAM J. Sci. Stat. Comput. 2, 225-237.
9. Everstine, G. C. (1979) A comparison of three resquencing algorithms for the reduction of matrix profile and wavefront. Int. J. Num. Meth. Eng. 14, 837-853.
10. George, A. and Liu, J. W. H. (1980) A fast implementation of the minimum degree algorithm using quotient graphs . ACM Trans. Math. Softw. 6, 337-358.
11. George, A. and Liu, J. W. H. (1980) A minimal storage implementation of the minimum degree algorithm. SIAM J. Numer. Anal. 17, 282-299.
12. George, A. and Liu, J. W. H. (1989) The evolution of the minimum degree ordering algorithm. SIAM Review 31, 1-19.
13. Gibbs, N. E., Poole, W. G. and Stockmeyer, P. K. (1976) An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 13, 236-250.
14. Gilbert, J. R., Moler, C. and Schreiber, R. (1992) Sparse matrices in MATLAB: design and implementation. SIAM J. Matrix Anal. Appl. 13, 333-356.
15. 4). In Sparse Matrices and Their Applications (Edited by D. J. Rose and R. A. Willoughby) pp. 67-76. Plenum Press, New York (1972).
16. Hood, P. (1976) Frontal solution program for unsymmetric matrices. Int. J. Numer. Meth. Engng. 10, 379
17. Irons, B. M. (1970) A frontal solution program for finite element analysis. Int. J. Numer. Meth. Engng. 2, 5
18. Liu, J. W. H. (1985) Modification of the minimum degree algorithm by multiple elimination. ACM Trans. Math. Softw. 11, 141-153.
19. Mallya, J. U., Zitney, S. E., Choudhary, S. and Stadtherr, M. A. (1997) A parallel frontal solver for large scale process simulation and optimization. AIChE J. 43, 1032-1040.
20. Rose, D. J., A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In Graph Theory and Computing (Edited by R. C. Read), pp. 183-217. Academic Press, New York (1973).
21. Sloan, S. W. (1986) An algorithm for profile and wavefront reduction of sparse matrices. Int. J. Num. Meth. Eng. 23, 239-251.
22. Stadtherr, M. A. and Vegeais, J. A. (1985) Process flowsheeting on supercomputers. IChemE Symp. Ser. 92, 67-77.
23. Stadtherr, M. A. and Wood, E. S. (1984) Sparse matrix methods for equation-based chemical process flowsheeting: I. Reordering phase. Comput. Chem. Engng. 8, 19-23.
24. Tinney, W. F. and Walker, J. W. (1967) Direct solutions of sparse network equations by optimally ordered triangular factorization. Proc. of the IEEE 55, 1801-1809.
25. Vegeais, J. A. and Stadtherr, M. A. (1990) Vector processing strategies for chemical process flowsheeting. AIChE J. 36, 1687-1696.
26. Zitney, S. E., Sparse matrix methods for chemical process separation calculations on supercomputers. In Proc. Supercomputing '92, pp. 414-423. IEEE Press, Los Alamitos, CA (1992).
27. Zitney, S. E., Brüll, L., Lang, L. and Zeller, R. (1995) Plantwide dynamic simulation on supercomputers: modeling a Bayer distillation process. AIChE Symp. Ser. 91(304), 313-316.
28. Zitney, S. E. and Stadtherr, M. A. (1988) Computational experiments in equation-based chemical process flowsheeting. Comput. Chem. Engng. 12, 1171-1186.
29. Zitney, S. E. and Stadtherr, M. A. (1993) Frontal algorithms for equation-based chemical process flowsheeting on vector and parallel computers. Comput. Chem. Engng. 17, 319-338.