How to use cylindrical algebraic decomposition

MaRDI QIDQ624830zbMATH OpenFDO

Authors M. Kauers

Publication date 9 February 2011

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/SLC/wpapers/s65kauers.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

CADinequalitiesproving and solvingsemialgebraic sets

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Review text

The article is two-fold. First it gives the basic intuition of what Collin's cylindric algebraic decomposition (CAD) is about. Rather than giving all the technical details how a CAD for a semialgebraic set (subset of \(\mathbb R^n\) described by polynomials and inequalities), it presents very nicely the input-output specification from the geometric and logical point of view. In addition, the article serves excellently as an example-oriented tutorial for solving inequality problems and proving typical inequalities.

Recommendations

• On proving inequalities by cylindrical algebraic decomposition
• scientific article; zbMATH DE number 3880114
• Partial cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using local projections
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993

Cited in

(13)

• Smoothing analysis of distributive red-black Jacobi relaxation for solving 2D Stokes flow by multigrid method
• On the robustness and optimality of algebraic multilevel methods for reaction-diffusion type problems
• The impact on the properties of the EFGM copulas when extending this family
• Polynomial bivariate copulas of degree five: characterization and some particular inequalities
• A local Fourier convergence analysis of a multigrid method using symbolic computation
• A hypergeometric inequality
• Stanley's lemma and multiple theta functions
• On proving inequalities by cylindrical algebraic decomposition
• Combinatorial representation of parameter space for switching networks
• A unimodal sequence with mode at a quarter length
• A Unified Approach to Unimodality of Gaussian Polynomials
• The ultra log-concavity of Z -polynomials and γ -polynomials of uniform matroids
• The log-convexity of the n-th root sequence of the Andrews smallest parts function

Describes a project that uses

Uses Software

• REDLOG

This page was built for publication: How to use cylindrical algebraic decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q624830)