
Summary: We describe here the application of a new parallel interval Newton/generalized bisection algorithm for solving the large, sparse, nonlinear algebraic equation systems arising in chemical process flowsheeting. The algorithm is based on the simultaneous application of root inclusion tests to multiple interval regions, and it is designed for implementation on MIMD computers with a combination of local and shared memory. The algorithm was tested successfully on several relatively small flowsheeting problems. The tests were performed using between 2 and 32 nodes of a BBN TC2000 parallel computer.
large, sparse, nonlinear algebraic equation systems, MIMD computers, Numerical computation of solutions to systems of equations, Interval and finite arithmetic, root inclusion tests, interval Newton method, chemical process flowsheeting, interval bisection method, Parallel numerical computation, Nonlinear ordinary differential equations and systems, parallel computation, Numerical methods for initial value problems involving ordinary differential equations, Chemically reacting flows
large, sparse, nonlinear algebraic equation systems, MIMD computers, Numerical computation of solutions to systems of equations, Interval and finite arithmetic, root inclusion tests, interval Newton method, chemical process flowsheeting, interval bisection method, Parallel numerical computation, Nonlinear ordinary differential equations and systems, parallel computation, Numerical methods for initial value problems involving ordinary differential equations, Chemically reacting flows
