Computing sparse and dense realizations of reaction kinetic systems
From MaRDI portal
Publication:848181
DOI10.1007/S10910-009-9525-5zbMATH Open1198.92052OpenAlexW2016440384MaRDI QIDQ848181FDOQ848181
Authors: Gábor Szederkényi 
Publication date: 2 March 2010
Published in: Journal of Mathematical Chemistry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10910-009-9525-5
Recommendations
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- Sparse grids and hybrid methods for the chemical master equation
- Efficient numerical methods for the optimisation of large kinetic reaction mechanisms
- An efficient computational method for simulations of reaction-diffusion processes
- Computing all sparse kinetic structures for a Lorenz system using optimization
- Efficient simulation of discrete stochastic reaction systems with a splitting method
- Kinetical-Consistent Algorithms for Simulation of Reactive Flows
- Computation with finite stochastic chemical reaction networks
- A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry
- Efficient simulation of complex patterns in reaction-diffusion systems
Applications of mathematical programming (90C90) Mixed integer programming (90C11) Classical flows, reactions, etc. in chemistry (92E20)
Cites Work
- Control of systems integrating logic, dynamics, and constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiple Equilibria in Complex Chemical Reaction Networks: I. The Injectivity Property
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Title not available (Why is that?)
- Understanding bistability in complex enzyme-driven reaction networks
- Multiple Equilibria in Complex Chemical Reaction Networks: II. The Species-Reaction Graph
- Structure and stability of certain chemical networks and applications to the kinetic proofreading model of T-cell receptor signal transduction
- Local controllability of reactions
- On local observability of chemical systems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identifiability of chemical reaction networks
- Local dissipative Hamiltonian description of reversible reaction networks
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Modeling and integer programming techniques applied to propositional calculus
- Alternative integer-linear-programming formulations of the Clar problem in hexagonal systems
Cited In (33)
- Complex Balancing Reconstructed to the Asymptotic Stability of Mass-Action Chemical Reaction Networks with Conservation Laws
- A new efficient algorithm for determining all structurally different realizations of kinetic systems
- Reachability analysis of low-order discrete state reaction networks obeying conservation laws
- Engineering model reduction and entropy-based Lyapunov functions in chemical reaction kinetics
- Efficient numerical methods for the optimisation of large kinetic reaction mechanisms
- Conditions for extinction events in chemical reaction networks with discrete state spaces
- Optimal Reaction Coordinates: Variational Characterization and Sparse Computation
- Parametric uniqueness of deficiency zero reaction networks
- An Algorithm for Finding Weakly Reversible Deficiency Zero Realizations of Polynomial Dynamical Systems
- Realizations of quasi-polynomial systems and application for stability analysis
- Realizations of kinetic differential equations
- A computational approach to the structural analysis of uncertain kinetic systems
- A linear programming approach to dynamical equivalence, linear conjugacy, and the deficiency one theorem
- Linear conjugacy in biochemical reaction networks with rational reaction rates
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- Reaction network realizations of rational biochemical systems and their structural properties
- Finding complex balanced and detailed balanced realizations of chemical reaction networks
- Computing all sparse kinetic structures for a Lorenz system using optimization
- Linear conjugacy of chemical reaction networks
- A convex optimization framework for the identification of homogeneous reaction systems
- On classes of reaction networks and their associated polynomial dynamical systems
- A computational approach to steady state correspondence of regular and generalized mass action systems
- Computing zero deficiency realizations of kinetic systems
- A computational approach to persistence, permanence, and endotacticity of biochemical reaction systems
- An inverse problem in reaction kinetics
- Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
- Analysis of mass-action systems by split network translation
- Rigorously proven chaos in chemical kinetics
- A Sparse Interpolation Algorithm for Dynamical Simulations in Computational Chemistry
- Quadratic first integrals of kinetic differential equations
- A computational approach to linear conjugacy in a class of power law kinetic systems
- Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks
- A computational approach to extinction events in chemical reaction networks with discrete state spaces
Uses Software
This page was built for publication: Computing sparse and dense realizations of reaction kinetic systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848181)
