Reliability of iterative linear equation solvers in chemical process simulation

Computers and Chemical Engineering

Volumn 20, Issue 9, 1996, Pages 1123-1132

  Cofer, H N ^a   Stadtherr, M A ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ITERATIVE METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; RELIABILITY;

CHEMICAL PROCESS SIMULATION; ITERATIVE LINEAR EQUATION SOLVERS;

CHEMICAL REACTIONS;

EID: 0030241209     PISSN: 00981354     EISSN: None     Source Type: Journal    
DOI: 10.1016/0098-1354(95)00074-7     Document Type: Article

References (50)

1. Anderson E., Z. Bai, C. Bischof, J. Demmel, J. Dongarra, J. Du Croz, A. Greenbaum, S. Hammarling, A. McKenney, S. Ostrouchov and D. Sorensen, LAPACK Users Guide. SIAM, Philadelphia, Penn. (1992).
2. Axelsson O., A survey of preconditioned iterative methods for linear systems of algebraic equations. BIT 25, 116-187 (1985).
3. Barrett R., M. Berry, T. Chan, J. Demmel, J. Donato, J. Dongarra, V. Eijkhout, R. Pozo, C. Romine and H. van der Vorst, Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods. SIAM, Philadelphia, Penn. (1994).
4. Brussino G. and V. Sonnad, A comparison of direct and preconditioned iterative techniques for sparse, unsymmetric systems of linear equations. Int. J. Numer. Meth. Engng 28, 801-815 (1989).
5. Chen H. S. and M. A. Stadtherr, On solving large sparse nonlinear equation systems. Computers Chem. Engng 8, 1-7 (1984).
6. Coon A. B. and M. A. Stadtherr, Generalized block-tridiagonal matrix orderings for parallel computation in process flowsheeting. Computers Chem. Engng 19, 787-805 (1995).
7. Craig E. J., The N-step iteration procedures. J. Math. Phys. 34, 64-73 (1955).
8. Duff I. S., On algorithms for obtaining a maximum transversal. ACM Trans. Math. Softw. 7, 315-330 (1981a).
9. Duff I. S., Algorithm 575: permuations for a zero-free diagonal. ACM Trans. Math. Softw. 7, 387-390 (1981b).
10. Duff I. S. and G. Meurant, The effect of ordering on preconditioned conjugate gradients. BIT 29, 635-657 (1989).
11. Dupont T., R. P. Kendall and H. H. Rachford Jr, An approximate factorization procedure for solving self-adjoint elliptic difference equations. SIAM J. Numer. Anal. 5, 559-573 (1968).
12. Eijkhout V., Analysis of parallel incomplete point factorizations. Linear Algebra Appl. 154/156, 723-740 (1991).
13. Elman H., Iterative methods for large, sparse, nonsymmetric systems of linear equations. Research Report 229, Yale University, New Haven, Conn. (1982).
14. Evans D. J., On preconditioned iterative methods for partial differential equations. In Preconditioning Methods: Theory and Applications (Edited by Evans D. J.), Gordon & Breach, New York (1983).
15. Fletcher R., Conjugate gradient methods for indefinite systems. In Lecture Notes in Mathematics 506 (Edited by Watson G. S.), pp. 73-89. Springer, New York (1976).
16. Freund R. W., A transpose-free quasi-minimal residual algorithm for non-Hermitian linear systems. SIAM J. Sci. Comput. 14, 470-482 (1993).
17. Goheen C. H., Equation-based chemical process optimization on advanced architecture computers. Ph.D. Thesis, University of Illinois at Urbana-Champaign, Urbana, Ill. (1992).
18. Golub G. H. and C. F. Van Loan, Matrix Computations. Johns Hopkins University Press, Baltimore, Md (1989).
19. Gustafsson I., A class of first order factorizations. BIT 18, 142-156 (1978).
20. Gustafsson I., Modified incomplete Cholesky (MIC) methods. In Preconditioning Methods: Analysis and Applications (Edited by Evans D. J.). Gordon & Breach, New York (1983).
21. 4). In Sparse Matrices and Their Applications (Edited by Rose D. J. and R. A. Willoughby). Plenum Press, New York (1972).
22. Hestenes M. R., The conjugate-gradient method for solving linear systems. In Numerical Analysis (Proc. 6th Symp. in Appl. Math.), pp. 83-102. McGraw-Hill, New York (1956).
23. Hestenes M. R. and E. Stiefel, Methods of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Stand. 49, 409-436 (1952).
24. Il'in V. P., Iterative Incomplete Factorization Methods, World Scientific, River Edge, N.J. (1992).
25. Lanczos C., Solution of systems of linear equations by minimized iterations. J. Res. Nat. Bur. Stand. 49, 33-53 (1952).
26. Lefkopoulos A., Studies on the dynamics of equation-based chemical process flowsheeting systems. Ph.D. Thesis, University of Illinois at Urbana-Champaign, Urbana, Ill. (1990).
27. Manteuffel T. A., An incomplete factorization technique for positive definite linear systems, Math. Comput. 34, 473-497 (1980).
28. Meier U., G. Skinner and J. Gunnels, A collection of tools for sparse matrix computations. CSRD Technical Report 1134, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, Ill. (1991).
29. Meijerink J. A. and H. A. van der Vorst, An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comput. 31, 148-162 (1977).
30. Onana A. and A. M. Hikolo, SOR method for multistaged separation columns computations. Computers Chem. Engng 17, 799-805 (1993).
31. Paloschi J. R., Steps towards steady state simulation on MIMD machines - I. Solving linear systems. Presented at AIChE National Meeting, Atlanta, Ga, April (1994).
32. Reid J. K., On the method of conjugate gradients for the solution of large sparse systems of linear equations. In Large Sparse Sets of Linear Equations (Edited by J. K. Reid), pp. 231-254. Academic Press, New York (1971).
33. Saad Y., Krylov subspace methods on supercomputers. SIAM J. Sci. Statist. Comput. 10, 1200-1232 (1989).
34. Saad Y., SPARSKIT: a basic tool kit for sparse matrix computation. CSRD Technical Report 1029, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign, Urbana, Ill. (1990).
35. Saad Y. and M. H. Schultz, Conjugate gradient-like algorithms for solving nonsymmetric linear systems. Math. Comput. 44, 417-424 (1985).
36. Saad Y. and M. H. Schultz, GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 7, 856-869 (1986).
37. Scientific Computing Associates Inc., PCGPAK/Cray Optimized Version Users Guide (1987).
38. Stadtherr M. A. and C. M. Hilton, Development of a new equation-based process flowsheeting system: numerical studies. In Selected Topics on Computer-Aided Process Design and Analysis (Edited by Mah R. S. H. and G. V. Rekliatis). AIChE Symposium Series, 78 (214), 12-28 (1982).
39. Stadtherr M. A. and E. S. Wood, Sparse matrix methods for equation-based chemical process flowsheeting: I. Reordering phase. Computers Chem. Engng 8, 9-18 (1984a).
40. Stadtherr M. A. and E. S. Wood, Sparse matrix methods for equation-based chemical process flowsheeting: II. Numerical phase. Computers Chem. Engng 8, 19-23 (1984b).
41. Sonneveld P., CGS, A fast Lanczos-type solver for nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 10, 36-52 (1989).
42. van der Vorst H. A., BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems. SIAM J. Sci. Statist. Comput. 13, 631-644 (1992).
43. Vinsome P. K. W., Orthomin, an iterative method for solving sparse sets of simultaneous linear equations. In Proc. Fourth Symp. on Reservoir Simulation, pp. 149-159. Society of Petroleum Engineers, Los Angeles, Calif. (1976).
44. Westerberg A. W. and F, C. Edie, Computer-aided design, part 2: an approach to convergence and tearing in the solution of sparse equation sets. Chem. Engng J. 2, 17-24 (1971).
45. Yang U. M., Preconditioned conjugate gradient-like methods for nonsymmetric linear systems. CSRD Technical Report 1210, Center for Supercomputing Research and Devlopment, University of Illinois at Urbana-Champaign, Urbana, Ill. (1991).
46. Zitney S. E. and M. A. Stadtherr, Computational experiments in equation-based chemical process flowsheeting. Computers Chem. Engng 12, 1171-1186 (1988).
47. Zitney S. E. and M. A. Stadtherr, Frontal algorithms for equation-based chemical process flowsheeting on vector and parallel computers. Computers Chem. Engng 17, 319-338 (1993).
48. Zitney S. E., R. J. Amarger and P. Winter, The impact of supercomputing on dynamic simulation using the SPEEDUP system. Presented at AIChE National Meeting, New Orleans, March (1992).
49. Zitney S. E., K. V. Camarda and M. A. Stadtherr, Impact of supercomputing in simulaton and optimization of process operations. In Proc. Second International Conference on Foundations of Computer-Aided Process Operations (Edited by Rippin D. W. T., J. C. Hale and J. F. Davis), pp. 463-468. CACHE Corp. Austin, Tex. (1994a).
50. Zitney S. E., L. Brüll, L. Lang and R. Zeller, Plantwide dynamic simulation on supercomputers: modeling a Bayer distillation process. Presented at Foundations of Computer Aided Process Design, Snowmass Village, Colorado, July (1994b).