Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
Publication:1582300
DOI10.1006/JSCO.1999.0353zbMath0965.65137OpenAlexW2119763521WikidataQ29012983 ScholiaQ29012983MaRDI QIDQ1582300
Andreas Weber, M'hammed El Kahoui
Publication date: 6 February 2001
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1999.0353
Hopf bifurcationquantifier eliminationsymbolic methodssymmetry methodsGroebner basis methodsHurwitz determinants criterionJava-based software architectureODEs with polynomial vector fields
Symbolic computation and algebraic computation (68W30) Computational methods for bifurcation problems in dynamical systems (37M20) Numerical bifurcation problems (65P30)
Related Items (20)
Uses Software
Cites Work
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Formal solutions of differential equations
- Perturbation methods, bifurcation theory and computer algebra
- Partial cylindrical algebraic decomposition for quantifier elimination
- Galois groups of second and third order linear differential equations
- Nonlinear control system design by quantifier elimination
- Testing stability by quantifier elimination
- Epidemiological models with varying population size and dose-dependent latent period
- Deterministic Nonperiodic Flow
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Deciding Hopf bifurcations by quantifier elimination in a software-component architecture