QEPCAD

swMATH752MaRDI QIDQ13503FDOQ13503

Author name not available (Why is that?)

Described by source

• QEPCAD B

Cited In (only showing first 100 items - show all)

• An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
• Quantifier elimination on real closed fields and differential equations
• Editorial: Symbolic computation and satisfiability checking
• Title not available (Why is that?)
• Parametric toricity of steady state varieties of reaction networks
• A parameter space approach to fixed-order robust controller synthesis by quantifier elimination
• Optimizing a particular real root of a polynomial by a special cylindrical algebraic decomposition
• Title not available (Why is that?)
• Building bridges between symbolic computation and satisfiability checking
• Global optimization of polynomials over real algebraic sets
• Geometry and topology of parameter space: Investigating measures of robustness in regulatory networks
• A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications
• Multistationarity in the space of total concentrations for systems that admit a monomial parametrization
• A logic based approach to finding real singularities of implicit ordinary differential equations
• Quantified constraints under perturbation
• Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
• Applied Algebraic Geometry in Model Based Design for Manufacturing
• Efficiently and effectively recognizing toricity of steady state varieties
• Algorithmic reduction of biological networks with multiple time scales
• Plane partitions. VI: Stembridge's TSPP theorem
• Title not available (Why is that?)
• Inequality constraints in rectangular finite/boundary elements
• Computer Algebra in Scientific Computing
• A linear programming relaxation based approach for generating barrier certificates of hybrid systems
• Identifying the parametric occurrence of multiple steady states for some biological networks
• Title not available (Why is that?)
• Fully incremental cylindrical algebraic decomposition
• A computational method for determining strong stabilizability of \(n\)-D systems
• Constructing a single cell in cylindrical algebraic decomposition
• The TPTP typed first-order form with arithmetic
• Stabilisability and stability for explicit and implicit polynomial systems: A symbolic computation approach
• A revisited perspective on symbolic mathematical computing and artificial intelligence
• A class of mechanically decidable problems beyond Tarski's model
• An SMT-based approach to weak controllability for disjunctive temporal problems with uncertainty
• Real Algebraic Strategies for MetiTarski Proofs
• Combining logical and algebraic techniques for natural style proving in elementary analysis
• Using computer algebra to certify the global convergence of a numerical optimization process
• Title not available (Why is that?)
• Analysis and optimization of inner products for mimetic finite difference methods on a triangular grid
• Change-of-bases abstractions for non-linear hybrid systems
• Combinatorial Representation of Parameter Space for Switching Networks
• Reasoning over networks by symbolic methods
• Tarski’s Influence on Computer Science
• A poly-algorithmic approach to simplifying elementary functions
• Parametric optimization in control using the sum of roots for parametric polynomial spectral factorization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stability analysis by quantifier elimination.
• Heuristic search and pruning in polynomial constraints satisfaction
• On multivariate Hermitian quadratic forms
• Quantifier elimination for trigonometric polynomials by cylindrical trigonometric decomposition
• Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
• Thirty Years of Virtual Substitution
• Cylindrical algebraic decomposition using local projections
• Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates
• Title not available (Why is that?)
• Quantifier elimination supported proofs in the numerical treatment of fluid flows
• Testing elementary function identities using CAD
• Validity proof of Lazard's method for CAD construction
• Title not available (Why is that?)
• Solving Dynamic Geometric Constraints Involving Inequalities
• Optimally-stable second-order accurate difference schemes for nonlinear conservation laws in 3D
• Polyhedral and algebraic methods in computational geometry
• Title not available (Why is that?)
• An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions
• Solution formulas for cubic equations without or with constraints
• Optimising Problem Formulation for Cylindrical Algebraic Decomposition
• A Symbolic Approach to Generation and Analysis of Finite Difference Schemes of Partial Differential Equations
• Some geometric properties of successive difference substitutions
• Computing integrals over polynomially defined regions and their boundaries in 2 and 3 dimensions
• Application of quantifier elimination to a simple elastic beam finite element below a straight rigid obstacle
• Computational Science - ICCS 2004
• An obstacle avoidance model predictive control scheme for mobile robots subject to nonholonomic constraints: a sum-of-squares approach
• Simple CAD construction and its applications
• On quantified linear implications
• On the algebraic boundaries among typical ranks for real binary forms
• Proof and Computation in Geometry
• Visually dynamic presentation of proofs in plane geometry. II: Automated generation of visually dynamic presentations with the full-angle method and the deductive database method
• Parametric optimization and optimal control using algebraic geometry methods
• Nonlinear control system design by quantifier elimination
• Reachability and optimal control for linear hybrid automata: a quantifier elimination approach
• Formal Modelling, Analysis and Verification of Hybrid Systems
• Title not available (Why is that?)
• Computing differential invariants of hybrid systems as fixed points
• Solving parametric piecewise polynomial systems
• Polynomial function intervals for floating-point software verification
• Computing equilibria of semi-algebraic economies using triangular decomposition and real solution classification
• Symbolic reachability computation for families of linear vector fields
• Algorithmic global criteria for excluding oscillations
• Computing Differential Invariants of Hybrid Systems as Fixedpoints
• Title not available (Why is that?)
• Verification of Hybrid Systems
• Applications of real number theorem proving in PVS
• Solving polynomial systems over semialgebraic sets represented by cylindrical algebraic formulas
• Differential-algebraic Dynamic Logic for Differential-algebraic Programs
• Verification and synthesis using real quantifier elimination
• Dead beat controllability of polynomial systems: symbolic computation approaches
• The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for software: QEPCAD