Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6931490 | Journal of Computational Physics | 2015 | 24 Pages |
Abstract
We present efficient algorithmic methods to detect Hopf bifurcation fixed points in chemical reaction networks with symbolic rate constants, thereby yielding information about the oscillatory behavior of the networks. Our methods use the representations of the systems on convex coordinates that arise from stoichiometric network analysis. One of our methods then reduces the problem of determining the existence of Hopf bifurcation fixed points to a first-order formula over the ordered field of the reals that can be solved using computational logic packages. The second method uses ideas from tropical geometry to formulate a more efficient method that is incomplete in theory but worked very well for the examples that we have attempted; we have shown it to be able to handle systems involving more than 20 species.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science Applications
Authors
Hassan Errami, Markus Eiswirth, Dima Grigoriev, Werner M. Seiler, Thomas Sturm, Andreas Weber,