Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)

DOI10.1007/978-3-642-15274-0_24zbMath1290.68140OpenAlexW1665098782MaRDI QIDQ3587714

Andreas Weber, Thomas Sturm, Essam O. Abdel-Rahman, Werner M. Seiler

Publication date: 10 September 2010

Published in: Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15274-0_24

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Bifurcation theory for ordinary differential equations (34C23) Oscillation theory, zeros, disconjugacy and comparison theory for ordinary differential equations (34C10) Theory of limit cycles of polynomial and analytic vector fields (existence, uniqueness, bounds, Hilbert's 16th problem and ramifications) for ordinary differential equations (34C07)

Related Items (3)

PoCaB: A Software Infrastructure to Explore Algebraic Methods for Bio-chemical Reaction Networks ⋮ Discovering polynomial Lyapunov functions for continuous dynamical systems ⋮ Quadratic first integrals of kinetic differential equations

Uses Software

• QEPCAD
• REDLOG

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Investigating algebraic and logical algorithms to solve Hopf bifurcation problems in algebraic biology
• Quantifier elimination for real algebra -- the quadratic case and beyond
• Algebraic approaches to stability analysis of biological systems
• Weak quantifier elimination for the full linear theory of the integers
• A semi-algebraic approach for asymptotic stability analysis
• Nonlinear oscillations, dynamical systems, and bifurcations of vector fields
• The complexity of linear problems in fields
• Real quantifier elimination is doubly exponential
• Testing stability by quantifier elimination
• Simulation and optimization by quantifier elimination
• Simplification of quantifier-free formulae over ordered fields
• Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
• Solving systems of strict polynomial inequalities
• Compound matrices and ordinary differential equations
• Toric ideals and graph theory to analyze Hopf bifurcations in mass action systems
• Cylindrical algebraic decomposition using validated numerics
• A generalization of Bendixson’s criterion
• Weak Integer Quantifier Elimination Beyond the Linear Case
• New Domains for Applied Quantifier Elimination
• Applying a Rigorous Quasi-Steady State Approximation Method for Proving the Absence of Oscillations in Models of Genetic Circuits
• Investigating Generic Methods to Solve Hopf Bifurcation Problems in Algebraic Biology
• Bendixon-Type Theorems with Applications
• Centennial History of Hilbert's 16th Problem
• On Proving the Absence of Oscillations in Models of Genetic Circuits
• Artificial Intelligence and Symbolic Computation

This page was built for publication: Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)