Testing stability by quantifier elimination
From MaRDI portal
Recommendations
Cited in
(43)- A computational method for determining strong stabilizability of \(n\)-D systems
- Stability analysis by quantifier elimination.
- Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition
- Deciding Hopf bifurcations by quantifier elimination in a software-component architecture
- Quantified constraints under perturbation
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Validity proof of Lazard's method for CAD construction
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
- Symbolic computation for the qualitative theory of differential equations
- A local Fourier convergence analysis of a multigrid method using symbolic computation
- Identifying the parametric occurrence of multiple steady states for some biological networks
- Special algorithm for stability analysis of multistable biological regulatory systems
- Discovering polynomial Lyapunov functions for continuous dynamical systems
- Cylindrical algebraic decomposition using validated numerics
- Algorithmic methods for investigating equilibria in epidemic modeling
- Optimally-stable second-order accurate difference schemes for nonlinear conservation laws in 3D
- Applying Quantifier Elimination to Stability Analysis of Difference Schemes
- Robustly stable multivariate polynomials
- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)
- Stability analysis for discrete biological models using algebraic methods
- Algebraic Approach to the Computation of the Defining Polynomial of the Algebraic Riccati Equation
- Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions
- Variant quantifier elimination
- Analysis of Snapback Repellers Using Methods of Symbolic Computation
- scientific article; zbMATH DE number 934502 (Why is no real title available?)
- Algebraic stability criteria and symbolic derivation of stability conditions for feedback control systems
- Algebraic Analysis of Bifurcations and Chaos for Discrete Dynamical Systems
- Algorithmic global criteria for excluding oscillations
- Symbolic reachability computation for families of linear vector fields
- Computer algebra and problems of motion stability
- Improved projection for cylindrical algebraic decomposition
- Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential Systems
- Recurrences for quadrilateral high-order finite elements
- Cylindrical decomposition for systems transcendental in the first variable
- Deciding polynomial-transcendental problems
- Analysis of codimension 2 bifurcations for high-dimensional discrete systems using symbolic computation methods
- Jacobi stability analysis for systems of ODEs with symbolic computation
- Qualitative investigation of the Lorenz-84 system using computer algebra methods
- Jacobi stability analysis for systems of ODEs using symbolic computation
- Algorithmic detection of Jacobi stability for systems of second order differential equations. Jacobi stability of systems of second order ODEs
- Algorithmic analysis of Jacobi stability for systems of second order ordinary differential equations
- Quantifier elimination supported proofs in the numerical treatment of fluid flows
This page was built for publication: Testing stability by quantifier elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1368692)
