QEPCAD
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Combining logical and algebraic techniques for natural style proving in elementary analysis
- Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem
- A semi-algebraic approach for asymptotic stability analysis
- Computing differential invariants of hybrid systems as fixed points
- Differential dynamic logic for hybrid systems
- Real zeros of the zero-dimensional parametric piecewise algebraic variety
- Partial cylindrical algebraic decomposition for quantifier elimination
- Bounds for absolute positiveness of multivariate polynomials
- Algorithms for trigonometric curves (simplification, implicitization, parameterization)
- A new approach for automatic theorem proving in real geometry
- A note on observability tests for general polynomial and simple Wiener-Hammerstein systems
- Aligator
- A computational method for determining strong stabilizability of \(n\)-D systems
- A complete discrimination system for polynomials with complex coefficients and its automatic generation
- Reasoning over networks by symbolic methods
- FGb
- Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach
- Kronecker
- Maple
- MetiTarski
- RAGlib
- REDUCE
- RegularChains
- SACLIB
- SARAG
- SingSurf
- Sostools
- SumCracker
- SYNRAC
- Nonlinear control system design by quantifier elimination
- Simulation and optimization by quantifier elimination
- Simplification of quantifier-free formulae over ordered fields
- Heuristic search and pruning in polynomial constraints satisfaction
- Computational complexity and feasibility of data processing and interval computations
- LINLBF
- BarcelogicTools
- MARCO
- 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
- Approximate quantified constraint solving by cylindrical box decomposition
- Paradox
- KeYmaera
- JavaView
- PHAVer
- HyTech
- SMV
- REDLOG
- RSOLVER
- An obstacle avoidance model predictive control scheme for mobile robots subject to nonholonomic constraints: a sum-of-squares approach
- Polynomial constraints and unsat cores in \textsc{Tarski}
- Benchmarks
- SPASS+T
- On the robustness and optimality of algebraic multilevel methods for reaction-diffusion type problems
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
- Open weak CAD and its applications
- Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL
- PENBMI
- Global optimization of polynomials over real algebraic sets
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
- Application of quantifier elimination to inverse buckling problems
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Validity proof of Lazard's method for CAD construction
- Orbital library
- On the algebraic boundaries among typical ranks for real binary forms
- Positive solutions of systems of signed parametric polynomial inequalities
- Recent advances on determining the number of real roots of parametric polynomials
- PoCaB
- Interval arithmetic in cylindrical algebraic decomposition
- Binomials.m2
- modpn
- Analysis and optimization of inner products for mimetic finite difference methods on a triangular grid
- Application of quantifier elimination to a simple elastic beam finite element below a straight rigid obstacle
- Computing GCDs of polynomials over algebraic number fields
- dReal
- Juno-2
- HSolver
- DISCOVERER
- REACH
- ISOLATE
- Solving systems of strict polynomial inequalities
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
- Multistationarity in the space of total concentrations for systems that admit a monomial parametrization
- Using machine learning to improve cylindrical algebraic decomposition
- AQCS
- Efficiently and effectively recognizing toricity of steady state varieties
- A logic based approach to finding real singularities of implicit ordinary differential equations
- The impact on the properties of the EFGM copulas when extending this family
- Algorithmic reduction of biological networks with multiple time scales
- VSDITLU
- PolyPaver
- Paramotopy
- Symbolic computation for the qualitative theory of differential equations
- Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure
- A comparison of algorithms for proving positivity of linearly recurrent sequences
- FIDE
- SymProve3
- BOTTEMA
- Characterizing positively invariant sets: inductive and topological methods
This page was built for software: QEPCAD
