English
Related papers

Related papers: Enhanced CAD-Based Quantifier Elimination With Mul…

200 papers

When using cylindrical algebraic decomposition (CAD) to solve a problem with respect to a set of polynomials, it is likely not the signs of those polynomials that are of paramount importance but rather the truth values of certain quantifier…

Symbolic Computation · Computer Science 2016-02-23 Russell Bradford , James H. Davenport , Matthew England , Scott McCallum , David Wilson

Partial differential equation (PDE) models with multiple temporal/spatial scales are prevalent in several disciplines such as physics, engineering, and many others. These models are of great practical importance but notoriously difficult to…

Numerical Analysis · Mathematics 2023-04-17 Junpeng Hu , Shi Jin , Lei Zhang

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications within algebraic geometry and beyond. We recently reported on a new implementation of CAD in Maple which…

Symbolic Computation · Computer Science 2013-06-14 Matthew England

Cylindrical algebraic decompositions (CADs) are a key tool in real algebraic geometry, used primarily for eliminating quantifiers over the reals and studying semi-algebraic sets. In this paper we introduce cylindrical algebraic…

Symbolic Computation · Computer Science 2014-06-27 D. J. Wilson , R. J. Bradford , J. H. Davenport , M. England

This paper introduces the use of tailored variational forms for variational quantum eigensolver that have properties of representing certain constraints on the search domain of a linear constrained quadratic binary optimization problem…

Quantum Physics · Physics 2020-11-30 Miguel Paredes Quinones , Catarina Junqueira

Abstraction layers are of paramount importance in software architecture, as they shield the higher-level formulation of payload computations from lower-level details. Since quantum computing (QC) introduces many such details that are often…

Quantum Physics · Physics 2024-09-04 Lukas Schmidbauer , Karen Wintersperger , Elisabeth Lobe , Wolfgang Mauerer

We consider the Quantifier Elimination (QE) problem for propositional CNF formulas with existential quantifiers. QE plays a key role in formal verification. Earlier, we presented an approach based on the following observation. To perform…

Logic in Computer Science · Computer Science 2018-10-16 Eugene Goldberg

Cylindrical Algebraic Decomposition (CAD) is a key proof technique for formal verification of cyber-physical systems. CAD is computationally expensive, with worst-case doubly-exponential complexity. Selecting an optimal variable ordering is…

Formal Languages and Automata Theory · Computer Science 2023-02-28 John Hester , Briland Hitaj , Grant Passmore , Sam Owre , Natarajan Shankar , Eric Yeh

Applying proper orthogonal decomposition to a usual finite element (FE) formulation for space fractional partial differential equation, we get a reduced FE model, which greatly reduces the complexity of computation. Then, the stability…

Numerical Analysis · Mathematics 2019-01-04 Jing Sun , Daxin Nie , Weihua Deng

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets, with applications in algebraic geometry and beyond. We have previously reported on an implementation of CAD in Maple which offers…

Symbolic Computation · Computer Science 2015-03-24 Matthew England , David Wilson

Earlier, we introduced Partial Quantifier Elimination (PQE). It is a $\mathit{generalization}$ of regular quantifier elimination where one can take a $\mathit{part}$ of the formula out of the scope of quantifiers. We apply PQE to CNF…

Logic in Computer Science · Computer Science 2024-07-16 Eugene Goldberg

The Cylindrical Algebraic Decomposition (CAD) method is currently the only complete algorithm used in practice for solving real-algebraic problems. To ameliorate its doubly-exponential complexity, different exploration-guided adaptations…

Symbolic Computation · Computer Science 2025-08-04 Jasper Nalbach , Erika Ábrahám

Inspired by applications in optimal control of semilinear elliptic partial differential equations and physics-integrated imaging, differential equation constrained optimization problems with constituents that are only accessible through…

Optimization and Control · Mathematics 2020-08-26 Guozhi Dong , Michael Hintermueller , Kostas Papafitsoros

Simplifying the geometry of a CAD model using defeaturing techniques enables more efficient discretisation and subsequent simulation for engineering analysis problems. Understanding the effect this simplification has on the solution helps…

Numerical Analysis · Mathematics 2019-10-15 Navid Rahimi , Pierre Kerfriden , Frank C Langbein , Ralph R Martin

The Cylindrical Algebraic Decomposition (CAD) algorithm is a comprehensive tool to perform quantifier elimination over real closed fields. CAD has doubly exponential running time, making it infeasible for practical purposes. We propose to…

Discrete Mathematics · Computer Science 2013-01-22 Hari Krishna Malladi , Ambedkar Dukkipati

We consider a modification of the Quantifier Elimination (QE) problem called Partial QE (PQE). In PQE, only a small part of the formula is taken out of the scope of quantifiers. The appeal of PQE is that many verification problems, e.g.…

Logic in Computer Science · Computer Science 2019-07-16 Eugene Goldberg

We provide efficient and intuitive tools for deriving bounds on achievable precision in quantum enhanced metrology based on the geometry of quantum channels and semi-definite programming. We show that when decoherence is taken into account,…

Quantum Physics · Physics 2012-09-19 Rafal Demkowicz-Dobrzanski , Jan Kolodynski , Madalin Guta

Mixed dimensional partial differential equations (PDEs) are equations coupling unknown fields defined over domains of differing topological dimension. Such equations naturally arise in a wide range of scientific fields including geology,…

Mathematical Software · Computer Science 2019-11-05 Cécile Daversin-Catty , Chris N. Richardson , Ada J. Ellingsrud , Marie E. Rognes

Cylindrical algebraic decomposition (CAD) is an important tool for the investigation of semi-algebraic sets. Originally introduced by Collins in the 1970s for use in quantifier elimination it has since found numerous applications within…

Symbolic Computation · Computer Science 2013-02-27 Matthew England

Cylindrical algebraic decomposition (CAD) is a key tool for solving problems in real algebraic geometry and beyond. In recent years a new approach has been developed, where regular chains technology is used to first build a decomposition in…

Symbolic Computation · Computer Science 2014-08-28 Matthew England , Russell Bradford , James H. Davenport , David Wilson