Solution of stiff ordinary differential equations by decomposition and orthogonal collocation
- 1 January 1982
- journal article
- research article
- Published by Wiley in AIChE Journal
- Vol. 28 (1) , 11-20
- https://doi.org/10.1002/aic.690280104
Abstract
A fast and accurate method was developed for the integration of large sparse systems of stiff initial value ordinary differential equations. The system is ordered, decoupled and, if necessary, torn into subsystems (also called blocks) which are then solved by orthogonal collocation on finite elements. The size of these elements, or steps, is different for each subsystem and is a function of the stiffness of the set of equations constituting the subsystem. The steps are overlapped for maximum computational efficiency.Keywords
This publication has 16 references indexed in Scilit:
- Some A -Stable and L -Stable Methods for the Numerical Integration of Stiff Ordinary Differential EquationsJournal of the ACM, 1979
- Semi-Implicit Runge-Kutta Procedures with Error Estimates for the Numerical Integration of Stiff Systems of Ordinary Differential EquationsJournal of the ACM, 1976
- An efficient general purpose method for the intergration of stiff ordinary differential equationsAIChE Journal, 1976
- A Class of Implicit Runge-Kutta Methods for the Numerical Integration of Stiff Ordinary Differential EquationsJournal of the ACM, 1975
- Optimal decomposition of process networksAIChE Journal, 1975
- Selection of decompositions for chemical process simulationAIChE Journal, 1975
- The steady‐state approximation: Fact or fiction?International Journal of Chemical Kinetics, 1974
- An efficient algorithm for optimum decomposition of recycle systemsAIChE Journal, 1972
- Structuring design computationsAIChE Journal, 1969
- Design variable selection to simplify process calculationsAIChE Journal, 1966