[LIVRE][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques

MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Differential elimination for dynamical models via projections with applications to structural identifiability

R Dong, C Goodbrake, HA Harrington… - SIAM Journal on Applied …, 2023 - SIAM
Elimination of unknowns in a system of differential equations is often required when
analyzing (possibly nonlinear) dynamical systems models, where only a subset of variables …

Delay-independent stability test for systems with multiple time-delays

II Delice, R Sipahi - IEEE Transactions on Automatic Control, 2011 - ieeexplore.ieee.org
Delay-independent stability (DIS) of a general class of linear time-invariant (LTI) multiple
time-delay system (MTDS) is investigated in the entire delay-parameter space. Stability of …

[HTML][HTML] Cylindrical algebraic decomposition with equational constraints

M England, R Bradford, JH Davenport - Journal of Symbolic Computation, 2020 - Elsevier
Abstract Cylindrical Algebraic Decomposition (CAD) has long been one of the most
important algorithms within Symbolic Computation, as a tool to perform quantifier elimination …

Data augmentation for mathematical objects

T del Río, M England - arxiv preprint arxiv:2307.06984, 2023 - arxiv.org
This paper discusses and evaluates ideas of data balancing and data augmentation in the
context of mathematical objects: an important topic for both the symbolic computation and …

A poly-algorithmic approach to quantifier elimination

JH Davenport, ZP Tonks… - 2023 25th International …, 2023 - ieeexplore.ieee.org
Cylindrical Algebraic Decomposition (CAD) was the first practical means for doing Real
Quantifier Elimination (QE), and is still a major method. Nevertheless, its complexity is …

[HTML][HTML] Validity proof of Lazard's method for CAD construction

S McCallum, A Parusiński, L Paunescu - Journal of Symbolic Computation, 2019 - Elsevier
In 1994 Lazard proposed an improved method for cylindrical algebraic decomposition
(CAD). The method comprised a simplified projection operation together with a generalized …

The complexity of cylindrical algebraic decomposition with respect to polynomial degree

M England, JH Davenport - … 2016, Bucharest, Romania, September 19-23 …, 2016 - Springer
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial
systems, particularly quantifier elimination. However, it has complexity doubly exponential in …

Iterated resultants and rational functions in real quantifier elimination

JH Davenport, M England, S McCallum… - arxiv preprint arxiv …, 2023 - arxiv.org
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 …

On the equations of the moving curve ideal of a rational algebraic plane curve

L Busé - Journal of Algebra, 2009 - Elsevier
Given a parametrization of a rational plane algebraic curve C, some explicit adjoint pencils
on C are described in terms of determinants. Moreover, some generators of the Rees …