Global Preordering for Newton Equations Using Model Hierarchy

AIChE Journal

Volumn 43, Issue 12, 1997, Pages 3193-3204

  Abbott, Kirk A ^a   Allan, Benjamin A ^a   Westerberg, Arthur W ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHEMICAL PLANTS; COMPUTER SIMULATION; MATRIX ALGEBRA; PROBLEM SOLVING;

FACTORIZATION; NEWTON EQUATIONS;

NONLINEAR EQUATIONS;

EID: 0031335854     PISSN: 00011541     EISSN: None     Source Type: Journal    
DOI: 10.1002/aic.690431207     Document Type: Article

References (41)

1. Abbott, K. A., "Very Large Scale Modeling," Dept. of Chemical Engineering, PhD thesis, Carnegie Mellon University (1996).
2. Barkley, R. W., and R. L. Motard, "Decomposition of Nets," Chem. Eng. J., 3, 265 (1972).
3. Barton, P. I., "The Modeling and Simulation of Combined Discrete/Continuous Processes," PhD thesis, Dept. of Chemical Engineering, Imperial College of Science, Technology, and Medicine, London (1992).
4. Camarda, J. V., and M. A. Stadtherr, "Frontal Solvers for Process Simulation - Local Row Ordering Strategies," AIChE Meeting, Miami (1995).
5. Coon, A., and M. A. Stadtherr, "Generalized Block-Tridiagonal Matrix Orderings for Parallel Computation in Process Flowsheeting," Comp. Chem. Eng., 19, 787 (1995).
6. Davis, T. A., and I. S. Duff, "An Unsymmetric Multifrontal Method for Sparse LU Factorization," Technical Report TR-93-018, Computer and Information Sciences Dept., University of Florida, Gainesville, FL (Mar. 1993).
7. Duff, I. S., A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, New York (1989).
8. Duff, I. S., R. G. Grimes, and J. G. Lewis, "User's Guide for the Harwell-Boeing Sparse Matrix Collection, Release I," Technical report Rutherford Appleton Laboratory (1992).
9. Duff, I. S., and J. K. Reid, "MA48, a Fortran Code for Direct Solution of Sparse Unsymmetric Linear Systems of Equations," Technical report, Rutherford Appleton Laboratory, Oxfordshire, U.K. (1993).
10. Duff, I. S., "MA28 - a Set of Fortran Subroutines for Sparse Unsymmetric Linear Equations," Report r8730, AERE, HM-SO, London (1977).
11. Edie, F. C., and A. W. Westerberg, "A Potpourri of Convergence and Tearing," Chem. Eng. Comput., 1, 35 (1971).
12. George, A., "Nested Dissection of a Regular Finite-element Mesh," SIAM J. Numer. Anal., 10, 345 (1973).
13. George, A., "On Block Elimination for Sparse Linear Systems," SIAM J. Numer. Anal., 11, 585 (1974).
14. George, A., and W. H. Liu, "A Fast Implementation of the Minimum Degree Algorithm Using Quotient Graphs," ACM Transactions on Mathematical Software, 6, 337 (1980).
15. Hajj, I. N., "Sparsity Considerations in Network Solution by Tearing," IEEE Trans. on Circuits and Systems, 27, 357 (1980).
16. Hellerman, E., and D. C. Rarick, "The Partitioned Preassigned Pivot Procedure (p4)," D. J. Rose and R. A. Willoughby, eds., in Sparse Matrices and their Applications, Vol. 67-76, Plenum Press, New York (1972).
17. Iordache, M., "On the Analysis of Large-Scale Circuits," Bull. Scientific Electrical Eng., 52, 71 (1990).
18. Karypis, G., and V. Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs," Technical Report 95-035, University of Minnesota, Departmentt of Computer Science (1995).
19. Karypis, G., and V. Kumar, "Metis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 2.0." Technical report, Dept. of Computer Science, University of Minnesota (1995).
20. Karypis, G., and V. Kumar, "Multilevel k-way Partitioning Scheme for Irregular Graphs," Technical Report 95-064, Dept. of Computer Science, University of Minnesota, (1995).
21. Kron, G., Diakoptics, Macdonald, London (1963).
22. Mallya, J., Personal Communication (1994).
23. Mallya, J. U., and M. A. Stadtherr, "A New Multifrontal Solver for Process Simulation on Parallel/Vector Supercomputers," AIChE Meeting, Miami (1995).
24. Marquardt, W., "An Object-Oriented Representation of Structured Process Models," Comp. Chem. Eng., 165, 5329 (1992).
25. Moriyama, S., "Large Scale Circuit Simulation," Trans. IEICE, E72, 1326 (1989).
26. Nilsson, B., "Object-Oriented Modeling of Chemical Processes," PhD Thesis, Dept. of Automatic Control, Lund Institute of Technology, Lund, Sweden (1993).
27. Nishigaki, M., T. Nobuyuki, and H. Asai, "Hierarchical Decomposition for Circuit Simulation by Direct Method," Trans, of IEICE, E73, 1948 (1990).
28. Nishigaki, M. T. Nobuyuki, and H. Asai, "Availability of Hierachical Node Tearing for MOS Circuits," Trans. IEICE (Japan), J74A, 1176 (1991).
29. Papalombros, P., Personal Communication (1996).
30. Piela, P. C., T. G. Epperly, K. M. Westerberg, and A. W. Westerberg, "ASCEND: An Object Oriented Computer Environment for Modeling and Analysis. Part 1 - The Modeling Language," Comput. Chem. Eng., 15, 53 (1991).
31. Sangiovanni-Vincentelli, A., and Chen Li-Kuan, "An Efficient Heuristic Cluster Algorithm for Tearing Large-Scale Networks," IEEE Trans. Circuits and Systems, 24, 709-717 (1977).
32. Sargent, R. W. H., and A. W. Westerberg, "Speed-Up in Chemical Engineering Design," Trans. Inst. Chem. Engrgs., 42, 190 (1964).
33. Stadtherr, M. A., and E. S. Wood, "Sparse Matrix Methods for Equation-Based Chemical Process Flowsheeting I, Reordering Phase," Comp. Chem. Eng., 8, 9 (1984a).
34. Stadtherr, M. A., and E. S. Wood, "Sparse Matrix Methods for Equation-Based Chemical Process Flowsheeting II, Numerical Phase," Comp. Chem. Eng., 8, 19 (1984b).
35. Tarjan, R. E., "Depth-First Search and Linear Graph Algorithms," SIAM J. Computing, 1, 146 (1972).
36. Upadhye, R. S., and E. A. Grens, "Selection of Decompositions for Process Simulation," AIChE J., 21, 136 (1975).
37. Vlach, M., "LU Decomposition and Forward and Backward Substitution of Recursively Bordered Block Diagonal Matrices," IEEE Proceedings, 132 Pt.G(1), 24 (1985).
38. Westerberg, A. W., H. P. Hutchinson, R. L. Motard, and P. Winter, Process Flowsheeting, Cambridge University, Press, New York (1979).
39. Westerberg, K. M., "Development of Software for Solving Systems of Linear Equations," Technical Report EDRC 05-35-89, Engineering Design Research Center, Carnegie Mellon University, Pittsburgh (1989).
40. Wood, E. S., "Two-Pass Strategies of Sparse Matrix Computations in Chemical Process Flowsheeting Problems," PhD thesis, University of Illinois at Urbana-Champaign, IL (1982).
41. Zecevic, A. I., and D. D. Siljak, "Balanced Decompositions of Sparse Systems for Multilevel Parallel Processing," IEEE Trans. Circuits and Systems, I: Fundamental Theory and Applications, 41, 220 (1994).