An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
From MaRDI portal
Publication:384995
DOI10.1016/J.TCS.2012.10.020zbMATH Open1291.68433OpenAlexW2998597040MaRDI QIDQ384995FDOQ384995
Hitoshi Yanami, Hirokazu Anai, Hidenao Iwane, Kazuhiro Yokoyama
Publication date: 29 November 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.020
Recommendations
- An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for optimization problems
- Partial cylindrical algebraic decomposition for quantifier elimination
- scientific article; zbMATH DE number 1263359
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
Symbolic computation and algebraic computation (68W30) Quantifier elimination, model completeness, and related topics (03C10)
Cites Work
- QEPCAD B
- Global optimization with polynomials and the problem of moments
- Partial cylindrical algebraic decomposition for quantifier elimination
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Polynomial algorithms in computer algebra
- Solving systems of strict polynomial inequalities
- Multi-objective optimization using evolutionary algorithms
- Algorithms in real algebraic geometry
- Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares
- Interval arithmetic in cylindrical algebraic decomposition
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved projection for cylindrical algebraic decomposition
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Efficient Pareto frontier exploration using surrogate approximations
- The complexity of linear problems in fields
- Real quantifier elimination is doubly exponential
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Simulation and optimization by quantifier elimination
- An efficient method for analyzing the topology of plane real algebraic curves.
- Approximate quantified constraint solving by cylindrical box decomposition
- Algebraic numbers: An example of dynamic evaluation
- Cylindrical algebraic decomposition using validated numerics
- An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for optimization problems
- Global optimization of polynomials using generalized critical values and sums of squares
- On propagation of equational constraints in CAD-based quantifier elimination
- An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
- Solving Polynomial Strict Inequalities Using Cylindrical Algebraic Decomposition
- Applying Linear Quantifier Elimination
- Improved projection for CAD's of R 3
- Title not available (Why is that?)
- Variant quantifier elimination
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing the global optimum of a multivariate polynomial over the reals
- Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
- Applying quantifier elimination to the Birkhoff interpolation problem
Cited In (62)
- A new idea on the interval-symbol method with correct zero rewriting for reducing exact computations
- Tame decompositions and collisions
- Logspace computations in graph products
- Constructing fewer open cells by GCD computation in CAD projection
- Online order basis algorithm and its impact on the block Wiedemann algorithm
- Maximum likelihood geometry in the presence of data zeros
- Evaluating parametric holonomic sequences using rectangular splitting
- Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers
- High performance implementation of the TFT
- Solving higher order linear differential equations having elliptic function coefficients
- Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
- The asymptotic analysis of some interpolated nonlinear recurrence relations
- Linear independence oracles and applications to rectangular and low rank linear systems
- Computing necessary integrability conditions for planar parametrized homogeneous potentials
- Equivariant lattice generators and Markov bases
- Title not available (Why is that?)
- Matrix-F5 algorithms over finite-precision complete discrete valuation fields
- Toric border basis
- Cylindrical algebraic decomposition using local projections
- Sub-cubic change of ordering for Gröbner basis
- An a posteriori certification algorithm for Newton homotopies
- Faster relaxed multiplication
- Automatic generation of bounds for polynomial systems with application to the Lorenz system
- Multivariate sparse interpolation using randomized Kronecker substitutions
- On the computation of the topology of plane curves
- Applied Algebraic Geometry in Model Based Design for Manufacturing
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
- Recent Advances in Real Geometric Reasoning
- A near-optimal algorithm for computing real roots of sparse polynomials
- Essentially optimal interactive certificates in linear algebra
- Fast arithmetic for the algebraic closure of finite fields
- Bounds for D-finite closure properties
- Powers of tensors and fast matrix multiplication
- Formal solutions of a class of Pfaffian systems in two variables
- On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases
- On the reduction of singularly-perturbed linear differential systems
- Mathematics by machine
- A generalized Apagodu-Zeilberger algorithm
- LLL reducing with the most significant bits
- Randomized detection of extraneous factors
- The MMO problem
- QEPCAD B
- On isomorphisms of modules over non-commutative PID
- Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)
- A fast algorithm for computing the characteristic polynomial of the p-curvature
- Sparse multivariate function recovery with a high error rate in the evaluations
- Root counts of semi-mixed systems, and an application to counting nash equilibria
- A new deterministic algorithm for sparse multivariate polynomial interpolation
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Can an A.I. win a medal in the mathematical olympiad? – Benchmarking mechanized mathematics on pre-university problems1
- Factoring linear differential operators in n variables
- Sparse interpolation over finite fields via low-order roots of unity
- Computing the differential Galois group of a parameterized second-order linear differential equation
- Parallel telescoping and parameterized Picard-Vessiot theory
- Computing low-degree factors of lacunary polynomials
- Improved algorithm for computing separating linear forms for bivariate systems
- Covering of surfaces parametrized without projective base points
- Radical solutions of first order autonomous algebraic ordinary differential equations
- Sparse Gröbner bases
- Race Against the Teens – Benchmarking Mechanized Math on Pre-university Problems
- Reduction among bracket polynomials
- Unimodular completion of polynomial matrices
Uses Software
This page was built for publication: An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q384995)
