Cylindrical algebraic decomposition using validated numerics
From MaRDI portal
Publication:2457384
DOI10.1016/j.jsc.2006.06.004zbMath1124.68123OpenAlexW2075348750MaRDI QIDQ2457384
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2006.06.004
quantifier eliminationcylindrical algebraic decompositionCADsemialgebraic setssolving inequalitiesalgebraic inequalities
Symbolic computation and algebraic computation (68W30) Real algebraic and real-analytic geometry (14P99)
Related Items (94)
Variable Ordering Selection for Cylindrical Algebraic Decomposition with Artificial Neural Networks ⋮ Parametric toricity of steady state varieties of reaction networks ⋮ Recent Advances in Real Geometric Reasoning ⋮ Mathematics by machine ⋮ Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers ⋮ Sparse interpolation over finite fields via low-order roots of unity ⋮ Multivariate sparse interpolation using randomized Kronecker substitutions ⋮ Computing the differential Galois group of a parameterized second-order linear differential equation ⋮ A new deterministic algorithm for sparse multivariate polynomial interpolation ⋮ A fast algorithm for computing the characteristic polynomial of the p-curvature ⋮ Computing necessary integrability conditions for planar parametrized homogeneous potentials ⋮ Improved algorithm for computing separating linear forms for bivariate systems ⋮ Solving higher order linear differential equations having elliptic function coefficients ⋮ Parallel telescoping and parameterized Picard-Vessiot theory ⋮ A generalized Apagodu-Zeilberger algorithm ⋮ The asymptotic analysis of some interpolated nonlinear recurrence relations ⋮ Fast arithmetic for the algebraic closure of finite fields ⋮ On the computation of the topology of plane curves ⋮ Essentially optimal interactive certificates in linear algebra ⋮ Root counts of semi-mixed systems, and an application to counting nash equilibria ⋮ Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation) ⋮ Sub-cubic change of ordering for Gröbner basis ⋮ Sparse Gröbner bases ⋮ The MMO problem ⋮ Factoring linear differential operators in n variables ⋮ Online order basis algorithm and its impact on the block Wiedemann algorithm ⋮ On isomorphisms of modules over non-commutative PID ⋮ Radical solutions of first order autonomous algebraic ordinary differential equations ⋮ Computing low-degree factors of lacunary polynomials ⋮ Maximum likelihood geometry in the presence of data zeros ⋮ Constructing fewer open cells by GCD computation in CAD projection ⋮ An a posteriori certification algorithm for Newton homotopies ⋮ Evaluating parametric holonomic sequences using rectangular splitting ⋮ Equivariant lattice generators and Markov bases ⋮ Sparse polynomial interpolation codes and their decoding beyond half the minimum distance ⋮ Sparse multivariate function recovery with a high error rate in the evaluations ⋮ Bounds for D-finite closure properties ⋮ Powers of tensors and fast matrix multiplication ⋮ Reduction among bracket polynomials ⋮ Formal solutions of a class of Pfaffian systems in two variables ⋮ On the reduction of singularly-perturbed linear differential systems ⋮ High performance implementation of the TFT ⋮ Randomized detection of extraneous factors ⋮ Toric border basis ⋮ On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases ⋮ A near-optimal algorithm for computing real roots of sparse polynomials ⋮ LLL reducing with the most significant bits ⋮ Covering of surfaces parametrized without projective base points ⋮ Linear independence oracles and applications to rectangular and low rank linear systems ⋮ Faster relaxed multiplication ⋮ Unimodular completion of polynomial matrices ⋮ Applied Algebraic Geometry in Model Based Design for Manufacturing ⋮ Real quantifier elimination for the synthesis of optimal numerical algorithms (case study: square root computation) ⋮ Computer algebra for guaranteed accuracy. How does it help? ⋮ A deterministic algorithm for isolating real roots of a real polynomial ⋮ An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination ⋮ Faster real root decision algorithm for symmetric polynomials ⋮ Trading order for degree in creative telescoping ⋮ CAD and topology of semi-algebraic sets ⋮ On the topology of real algebraic plane curves ⋮ Explainable AI insights for symbolic computation: a case study on selecting the variable ordering for cylindrical algebraic decomposition ⋮ Variant quantifier elimination ⋮ Computing with Tarski formulas and semi-algebraic sets in a web browser ⋮ Open weak CAD and its applications ⋮ Matrix-F5 algorithms over finite-precision complete discrete valuation fields ⋮ Cylindrical decomposition for systems transcendental in the first variable ⋮ Deciding polynomial-transcendental problems ⋮ Deciding univariate polynomial problems using untrusted certificates in Isabelle/HOL ⋮ Cylindrical algebraic sub-decompositions ⋮ Approximation via Correlation Decay When Strong Spatial Mixing Fails ⋮ Symbolic analysis of multiple steady states in a MAPK chemical reaction network ⋮ From approximate factorization to root isolation with application to cylindrical algebraic decomposition ⋮ On the complexity of computing with planar algebraic curves ⋮ Algorithmic global criteria for excluding oscillations ⋮ Using machine learning to improve cylindrical algebraic decomposition ⋮ Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk) ⋮ Precise numerical computation ⋮ Real World Verification ⋮ An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions ⋮ Truth table invariant cylindrical algebraic decomposition ⋮ Cylindrical algebraic decomposition using local projections ⋮ Quantifier elimination by cylindrical algebraic decomposition based on regular chains ⋮ Logspace computations in graph products ⋮ Tame decompositions and collisions ⋮ Need Polynomial Systems Be Doubly-Exponential? ⋮ Cylindrical algebraic decomposition with equational constraints ⋮ The Complexity of Cylindrical Algebraic Decomposition with Respect to Polynomial Degree ⋮ Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms ⋮ An efficient algorithm for the stratification and triangulation of an algebraic surface ⋮ Problem Formulation for Truth-Table Invariant Cylindrical Algebraic Decomposition by Incremental Triangular Decomposition ⋮ Applying Machine Learning to the Problem of Choosing a Heuristic to Select the Variable Ordering for Cylindrical Algebraic Decomposition ⋮ Choosing better variable orderings for cylindrical algebraic decomposition via exploiting chordal structure ⋮ Special algorithm for stability analysis of multistable biological regulatory systems ⋮ Improved inapproximability results for counting independent sets in the hard-core model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved projection operation for cylindrical algebraic decomposition of three-dimensional space
- Partial cylindrical algebraic decomposition for quantifier elimination
- Nonlinear control system design by quantifier elimination
- Robust multi-objective feedback design by quantifier elimination
- Testing stability by quantifier elimination
- Computing in the field of complex algebraic numbers
- Interval arithmetic in cylindrical algebraic decomposition
- Solving systems of strict polynomial inequalities
- On propagation of equational constraints in CAD-based quantifier elimination
- Applying Linear Quantifier Elimination
- Improved projection for cylindrical algebraic decomposition
This page was built for publication: Cylindrical algebraic decomposition using validated numerics
