Access Restriction

Author Nauta, M. ♦ Weiland, S. ♦ Back, T.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2007
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations ♦ Other branches of engineering
Subject Keyword Kinetic theory ♦ Atmospheric modeling ♦ Biological system modeling ♦ Equations ♦ USA Councils ♦ Optimization methods ♦ Algorithm design and analysis ♦ Application software ♦ Combustion ♦ Biological systems
Abstract Simplification of models of complex kinetic networks is essential for purposes of optimization and control. A common technique for complexity reduction is to use equilibrium assumptions for reactions and species to eliminate species from the network. For models of larger kinetic networks and multiple equilibrium relations, the manifold that characterizes the response of the model subject to the equilibrium relations can only be approximated. We introduce a greedy-type algorithm to select a set of equilibrium relations in such a manner this manifold can be expressed analytically. This algorithm uses the interaction graph that represents the dependencies between equilibrium relations. If the equilibrium relations are selected such that the interdependency is minimized, analytical expressions for decoupled groups of equilibrium relations can be found. An objective function characterizes the trade-off between the order, the accuracy and the complexity of the reduced model. This objective function is maximized through the selection of equilibrium relations.
Description Author affiliation: Eindhoven Univ. of Technol., Eindhoven (Nauta, M.; Weiland, S.; Back, T.)
ISBN 9781424414970
ISSN 01912216
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2007-12-12
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 219.56 kB
Page Count 6
Starting Page 3345
Ending Page 3350

Source: IEEE Xplore Digital Library