A ggraph-based method to introduce approximations in kinetic networks

K.M. Nauta, S. Weiland, A.C.P.M. Backx

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review


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.
Original languageEnglish
Title of host publication2007 46th IEEE Conference on Decision and Control
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Number of pages6
ISBN (Print)978-1-4244-1497-0
Publication statusPublished - 2007
Event46th IEEE Conference on Decision and Control (CDC 2007) - New Orleans, United States
Duration: 12 Dec 200714 Dec 2007
Conference number: 46


Conference46th IEEE Conference on Decision and Control (CDC 2007)
Abbreviated titleCDC 2007
Country/TerritoryUnited States
CityNew Orleans


Dive into the research topics of 'A ggraph-based method to introduce approximations in kinetic networks'. Together they form a unique fingerprint.

Cite this