Computing all sparse kinetic structures for a Lorenz system using optimization

DOI10.1142/S0218127413501411MaRDI QIDQ2864976zbMATH OpenWikidataFDO

Authors Zoltán András Tuza, Gábor Szederkényi, Antonio A. Alonso, Julio R. Banga, Katalin Hangos

Publication date 27 November 2013

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

zbMATH Keywords

optimizationLorenz systemkinetic systemsstructural nonuniqueness

Mathematics Subject Classification ID

Qualitative investigation and simulation of ordinary differential equation models (34C60) Kinetics in biochemical problems (pharmacokinetics, enzyme kinetics, etc.) (92C45) Classical flows, reactions, etc. in chemistry (92E20)

Recommendations

• Computing sparse and dense realizations of reaction kinetic systems
• A computational approach to the structural analysis of uncertain kinetic systems
• Computing zero deficiency realizations of kinetic systems
• A new efficient algorithm for determining all structurally different realizations of kinetic systems
• Computing all possible graph structures describing linearly conjugate realizations of kinetic systems

Cites work

• A tutorial on chemical reaction network dynamics
• Another Chemical Chaotic Attractor for Chua's Equation
• Computing sparse and dense realizations of reaction kinetic systems
• Cooperative catalysis and chemical chaos: A chemical model for the Lorenz equations
• Dynamic modeling of complex biological systems: a link between metabolic and macroscopic description
• Finding complex balanced and detailed balanced realizations of chemical reaction networks
• Identifiability of chemical reaction networks
• Modeling and analysis of mass-action kinetics
• ON MULTITASKING IN PARALLEL CHEMICAL PROCESSORS: EXPERIMENTAL FINDINGS
• On the time-reparametrization of quasi-polynomial systems
• STOCHASTIC SIMULATION OF CHEMICAL CHUA SYSTEM
• Stability properties of a general class of nonlinear dynamical systems
• Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction

Cited in

(5)

• Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems
• A computational approach to the structural analysis of uncertain kinetic systems
• Computing sparse and dense realizations of reaction kinetic systems
• Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
• Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks

This page was built for publication: Computing all sparse kinetic structures for a Lorenz system using optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864976)