Related papers: A Successive Resultant Projection for Cylindrical …
Cylindrical algebraic decomposition (CAD) is an important tool for the study of real algebraic geometry with many applications both within mathematics and elsewhere. It is known to have doubly exponential complexity in the number of…
We study operators that are products of two orthogonal projections. Our results complement some of the classical results of Crimmins and von Neumann. Particular emphasis has been given to projections associated with inner functions defined…
Cylindrical Algebraic Decomposition (CAD) is an important tool within computational real algebraic geometry, capable of solving many problems for polynomial systems over the reals. It has long been studied by the Symbolic Computation…
This thesis is divided into three parts. The first part deals with cylindric plane partitions. The second with lambda-determinants and the third with commutators in semi-circular systems. For more detailed abstract please see inside.…
Cylindrical algebraic decomposition (CAD) plays an important role in the field of real algebraic geometry and many other areas. As is well-known, the choice of variable ordering while computing CAD has a great effect on the time and memory…
In this paper, we build on the work of [T. Hughes, G. Sangalli, VARIATIONAL MULTISCALE ANALYSIS: THE FINE-SCALE GREENS' FUNCTION, PROJECTION, OPTIMIZATION, LOCALIZATION, AND STABILIZED METHODS, SIAM Journal of Numerical Analysis, 45(2),…
Let $p$ be a polynomial in one variable whose roots either all have multiplicity more than 1 or all have multiplicity exactly 1. It is shown that the universal $C^*$-algebra of a relation $p(x)=0$, $\|x\| \le 1$ is semiprojective. In the…
Quasiperiodic arrangements of the constitutive materials in composites result in effective properties with very unusual electromagnetic and elastic properties. The paper discusses the cut-and-projection method that is used to characterize…
The motivation of this work stems from the numerical approximation of bounded functions by polynomials satisfying the same bounds. The present contribution makes use of the recent algebraic characterization found in [B. Despr\'es, Numer.…
Given a compact semialgebraic set S of R^n and a polynomial map f from R^n to R^m, we consider the problem of approximating the image set F = f(S) in R^m. This includes in particular the projection of S on R^m for n greater than m. Assuming…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
The main result of the present theoretical paper is an original decomposition formula for the proximal operator of the sum of two proper, lower semicontinuous and convex functions $f$ and $g$. For this purpose, we introduce a new operator,…
We prove that the Newton product of efficient polynomial projectors is still efficient. Various polynomial approximation theorems are established involving Newton product projectors on spaces of holomorphic functions on a neighborhood of a…
We construct the Calderon projection on the space of Cauchy datas for a twisted Dirac operator in the Mischenko--Fomenko pseudodifferential calculus for operators acting on bundles of finitely generated $C^*$--Hilbert modules on a compact…
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…
Cylindrical Algebraic Decomposition (CAD) is a key tool in computational algebraic geometry, best known as a procedure to enable Quantifier Elimination over real-closed fields. However, it has a worst case complexity doubly exponential in…
Cylindrical algebraic decomposition (CAD) is an important tool, both for quantifier elimination over the reals and a range of other applications. Traditionally, a CAD is built through a process of projection and lifting to move the problem…
We present a divide-and-conquer version of the Cylindrical Algebraic Decomposition (CAD) algorithm. The algorithm represents the input as a Boolean combination of subformulas, computes cylindrical algebraic decompositions of solution sets…
The not necessarily unitary evolution operator of a finite dimensional quantum system is studied with the help of a projection operators technique. Applying this approach to the Schr\"odinger equation allows the derivation of an alternative…