ترغب بنشر مسار تعليمي؟ اضغط هنا

Smooth Points on Semi-algebraic Sets

137   0   0.0 ( 0 )
 نشر من قبل Agnes Szanto
 تاريخ النشر 2020
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

Many algorithms for determining properties of real algebraic or semi-algebraic sets rely upon the ability to compute smooth points. Existing methods to compute smooth points on semi-algebraic sets use symbolic quantifier elimination tools. In this paper, we present a simple algorithm based on computing the critical points of some well-chosen function that guarantees the computation of smooth points in each connected compact component of a real (semi)-algebraic set. Our technique is intuitive in principal, performs well on previously difficult examples, and is straightforward to implement using existing numerical algebraic geometry software. The practical efficiency of our approach is demonstrated by solving a conjecture on the number of equilibria of the Kuramoto model for the $n=4$ case. We also apply our method to design an efficient algorithm to compute the real dimension of (semi)-algebraic sets, the original motivation for this research.



قيم البحث

اقرأ أيضاً

162 - Pierre Lairez 2019
Let $Ssubset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defining $S$ and an integer $ pgeq 0$ and returns the $n$-dimensional volume of $S$ at absolute precision $2^{-p}$.Our algorithm relies on the relationship between volumes of semi-algebraic sets and periods of rational integrals. It makes use of algorithms computing the Picard-Fuchs differential equation of appropriate periods, properties of critical points, and high-precision numerical integration of differential equations.The algorithm runs in essentially linear time with respect to~$p$. This improves upon the previous exponential bounds obtained by Monte-Carlo or moment-based methods. Assuming a conjecture of Dimca, the arithmetic cost of the algebraic subroutines for computing Picard-Fuchs equations and critical points is singly exponential in $n$ and polynomial in the maximum degree of the input.
120 - Paolo Lella 2012
Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by a Borel-fi xed ideal. Moreover Borel-fixed ideals have good combinatorial properties, which make them very interesting in an algorithmic perspective. In this paper, we propose an implementation of the algorithm computing all the saturated Borel-fixed ideals with number of variables and Hilbert polynomial assigned, introduced from a theoretical point of view in the paper Segment ideals and Hilbert schemes of points, Discrete Mathematics 311 (2011).
67 - Arthur Forey 2017
Let $k$ be a field of characteristic zero containing all roots of unity and $K=k((t))$. We build a ring morphism from the Grothendieck group of semi-algebraic sets over $K$ to the Grothendieck group of motives of rigid analytic varieties over $K$. It extend the morphism sending the class of an algebraic variety over $K$ to its cohomological motive with compact support. We show that it fits inside a commutative diagram involving Hrushovski and Kazhdans motivic integration and Ayoubs equivalence between motives of rigid analytic varieties over $K$ and quasi-unipotent motives over $k$ ; we also show that it satisfies a form of duality. This allows us to answer a question by Ayoub, Ivorra and Sebag about the analytic Milnor fiber.
61 - Thomas Kahle 2016
Designing experiments for generalized linear models is difficult because optimal designs depend on unknown parameters. The local optimality approach is to study the regions in parameter space where a given design is optimal. In many situations these regions are semi-algebraic. We investigate regions of optimality using computer tools such as yalmip, qepcad, and Mathematica.
We provide a numerical scheme to approximate as closely as desired the Gaussian or exponential measure $mu(om)$ of (not necessarily compact) basic semi-algebraic sets$omsubsetR^n$. We obtain two monotone (non increasing and non decreasing) sequences of upper and lower bounds $(overline{omega}_d)$, $(underline{omega}_d)$, $dinN$, each converging to $mu(om)$ as $dtoinfty$. For each $d$, computing $overline{omega}_d$ or $underline{omega}_d$reduces to solving a semidefinite program whose size increases with $d$. Some preliminary (small dimension) computational experiments are encouraging and illustrate thepotential of the method. The method also works for any measure whose moments are known and which satisfies Carlemans condition.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا