Testing stability by quantifier elimination
From MaRDI portal
Publication:1368692
DOI10.1006/jsco.1997.0121zbMath0886.65087OpenAlexW1974021382MaRDI QIDQ1368692
Richard Liska, Hoon Hong, Stanly L. Steinberg
Publication date: 20 April 1998
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1997.0121
complexitystabilityquantifier eliminationdifference equationscomputer algebraRouth-Hurwitz criterionpartial algebraic decomposition algorithm
Symbolic computation and algebraic computation (68W30) Stability in context of PDEs (35B35) Structural stability and analogous concepts of solutions to ordinary differential equations (34D30) Numerical investigation of stability of solutions to ordinary differential equations (65L07)
Related Items
Robustly stable multivariate polynomials, Stability analysis for discrete biological models using algebraic methods, Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential Systems, Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions, Recurrences for quadrilateral high-order finite elements, Variant quantifier elimination, A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications, Discovering polynomial Lyapunov functions for continuous dynamical systems, Cylindrical decomposition for systems transcendental in the first variable, Deciding polynomial-transcendental problems, Analysis of Snapback Repellers Using Methods of Symbolic Computation, Cylindrical algebraic decomposition using validated numerics, Algorithmic methods for investigating equilibria in epidemic modeling, Algebraic stability criteria and symbolic derivation of stability conditions for feedback control systems, Analysis of codimension 2 bifurcations for high-dimensional discrete systems using symbolic computation methods, Quantifier elimination supported proofs in the numerical treatment of fluid flows, Automatic generation of bounds for polynomial systems with application to the Lorenz system, A local Fourier convergence analysis of a multigrid method using symbolic computation, Validity proof of Lazard's method for CAD construction, Algorithmic global criteria for excluding oscillations, Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk), Optimally-stable second-order accurate difference schemes for nonlinear conservation laws in 3D, Symbolic reachability computation for families of linear vector fields, Computer algebra and problems of motion stability, Improved projection for cylindrical algebraic decomposition, Identifying the parametric occurrence of multiple steady states for some biological networks, Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition, Algebraic Approach to the Computation of the Defining Polynomial of the Algebraic Riccati Equation, Symbolic computation for the qualitative theory of differential equations, Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition, Deciding Hopf bifurcations by quantifier elimination in a software-component architecture, A computational method for determining strong stabilizability of \(n\)-D systems, Algebraic Analysis of Bifurcations and Chaos for Discrete Dynamical Systems, Special algorithm for stability analysis of multistable biological regulatory systems, Quantified constraints under perturbation
