English
Related papers

Related papers: An implementation of CAD in Maple utilising McCall…

200 papers

Satisfiability Modulo Theories (SMT) solvers check the satisfiability of quantifier-free first-order logic formulas. We consider the theory of non-linear real arithmetic where the formulae are logical combinations of polynomial constraints.…

Symbolic Computation · Computer Science 2024-01-31 Jasper Nalbach , Erika Ábrahám , Philippe Specht , Christopher W. Brown , James H. Davenport , Matthew England

Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…

Algebraic Geometry · Mathematics 2025-06-05 Rizeng Chen

Geometric Deep Learning techniques have become a transformative force in the field of Computer-Aided Design (CAD), and have the potential to revolutionize how designers and engineers approach and enhance the design process. By harnessing…

Computational Geometry · Computer Science 2025-07-08 Negar Heidari , Alexandros Iosifidis

Decomposition techniques for linear programming are difficult to extend to conic optimization problems with general non-polyhedral convex cones because the conic inequalities introduce an additional nonlinear coupling between the variables.…

Optimization and Control · Mathematics 2013-06-04 Yifan Sun , Martin S. Andersen , Lieven Vandenberghe

This paper builds and extends on the authors' previous work related to the algorithmic tool, Cylindrical Algebraic Decomposition (CAD), and one of its core applications, Real Quantifier Elimination (QE). These topics are at the heart of…

Symbolic Computation · Computer Science 2025-11-20 James H. Davenport , Matthew England , Scott McCallum , Ali K. Uncu

We are interested in the application of Machine Learning (ML) technology to improve mathematical software. It may seem that the probabilistic nature of ML tools would invalidate the exact results prized by such software, however, the…

Symbolic Computation · Computer Science 2020-09-10 Dorian Florescu , Matthew England

This paper presents a comprehensive review of geometric constraint solving in parametric computer-aided design (CAD), with the major focus on its advances in the last 15 years. Geometric constraint solving can date back to the very first…

Computational Geometry · Computer Science 2022-08-15 Qiang Zou , Zhihong Tang , Hsi-Yung Feng , Shuming Gao , Chenchu Zhou , Yusheng Liu

We employ chordal decomposition to reformulate a large and sparse semidefinite program (SDP), either in primal or dual standard form, into an equivalent SDP with smaller positive semidefinite (PSD) constraints. In contrast to previous…

Optimization and Control · Mathematics 2020-08-07 Yang Zheng , Giovanni Fantuzzi , Antonis Papachristodoulou , Paul Goulart , Andrew Wynn

We present a new algorithm for determining the satisfiability of conjunctions of non-linear polynomial constraints over the reals, which can be used as a theory solver for satisfiability modulo theory (SMT) solving for non-linear real…

Symbolic Computation · Computer Science 2021-06-17 Erika Ábrahám , James H. Davenport , Matthew England , Gereon Kremer

We introduce an extension of the partitioned local depth (PaLD) algorithm that is adapted to online applications such as semi-supervised prediction. PaLD is best known for unsupervised, parameter-free clustering, but its robustness is based…

Machine Learning · Statistics 2026-05-25 John D. Foley , Justin T. Lee

In this paper we consider disjoint decomposition of algebraic and non-linear partial differential systems of equations and inequations into so-called simple subsystems. We exploit Thomas decomposition ideas and develop them into a new…

Commutative Algebra · Mathematics 2015-05-19 Thomas Bächler , Vladimir Gerdt , Markus Lange-Hegermann , Daniel Robertz

This note shows the equivalence of two projection operators which both can be used in cylindrical algebraic decomposition (CAD) . One is known as Brown's Projection (C. W. Brown (2001)); the other was proposed by Lu Yang in his earlier work…

Symbolic Computation · Computer Science 2014-12-17 Yong Yao , Jia Xu , Lu Yang

We present a novel AI-assisted method for decomposing (segmenting) planar CAD (computer-aided design) models into well shaped rectangular blocks as a proof-of-principle of a general decomposition method applicable to complex 2D and 3D CAD…

Machine Learning · Computer Science 2023-02-23 Benjamin C. DiPrete , Rao V. Garimella , Cristina Garcia Cardona , Navamita Ray

The computation of triangular decompositions are based on two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations relying on modular…

Symbolic Computation · Computer Science 2009-07-25 Xin Li , Marc Moreno Maza , Wei Pan

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

Symbolic Computation · Computer Science 2011-04-06 Changbo Chen , Marc Moreno Maza

Local Fourier analysis is a strong and well-established tool for analyzing the convergence of numerical methods for partial differential equations. The key idea of local Fourier analysis is to represent the occurring functions in terms of a…

Numerical Analysis · Mathematics 2015-03-12 Stefan Takacs

A computer-aided detection (CADe) system for the identification of microcalcification clusters in digital mammograms has been developed. It is mainly based on the application of wavelet transforms for image filtering and neural networks for…

Medical Physics · Physics 2009-04-15 P. Delogu , M. E. Fantacci , A. Retico , A. Stefanini , A. Tata

One of the main challenges in simultaneous localization and mapping (SLAM) is real-time processing. High-computational loads linked to data acquisition and processing complicate this task. This article presents an efficient feature…

We present a new code, named COCAL - Compact Object CALculator, for the computation of equilibriums and quasiequilibrium initial data sets of single or binary compact objects of all kinds. In the cocal code, those solutions are calculated…

General Relativity and Quantum Cosmology · Physics 2013-05-30 Koji Uryu , Antonios Tsokaros

The optimal design of compounds through manipulating properties at the molecular level is often the key to considerable scientific advances and improved process systems performance. This paper highlights key trends, challenges, and…

Biomolecules · Quantitative Biology 2020-07-13 Abdulelah S. Alshehri , Rafiqul Gani , Fengqi You