Lopsided Approximation of Amoebas
نویسندگان
چکیده
The amoeba of a Laurent polynomial is the image of the corresponding hypersurface under the coordinatewise log absolute value map. In this article, we demonstrate that a theoretical amoeba approximation method due to Purbhoo can be used efficiently in practice. To do this, we resolve the main bottleneck in Purbhoo’s method by exploiting relations between cyclic resultants. We use the same approach to give an approximation of the Log preimage of the amoeba of a Laurent polynomial using semi-algebraic sets. We also provide a SINGULAR/SAGE implementation of these algorithms, which shows a significant speedup when our specialized cyclic resultant computation is used, versus a general purpose resultant algorithm.
منابع مشابه
A Nullstellensatz for amoebas
The amoeba of an affine algebraic variety V ⊂ (C∗)r is the image of V under the map (z1, . . . , zr) 7→ (log |z1|, . . . , log |zr|). We give a characterisation of the amoeba based on the triangle inequality, which we call ‘testing for lopsidedness’. We show that if a point is outside the amoeba of V , there is an element of the defining ideal which witnesses this fact by being lopsided. This c...
متن کاملApproximating amoebas and coamoebas by sums of squares
Amoebas and coamoebas are the logarithmic images of algebraic varieties and the images of algebraic varieties under the arg-map, respectively. We present new techniques for computational problems on amoebas and coamoebas, thus establishing new connections between (co-)amoebas, semialgebraic and convex algebraic geometry and semidefinite programming. Our approach is based on formulating the memb...
متن کاملOptimality Functions and Lopsided Convergence
Optimality functions pioneered by E. Polak characterize stationary points, quantify the degree with which a point fails to be stationary, and play central roles in algorithm development. For optimization problems requiring approximations, optimality functions can be used to ensure consistency in approximations, with the consequence that optimal and stationary points of the approximate problems ...
متن کاملAlgorithmic Computation of Polynomial Amoebas
We present algorithms for computation and visualization of amoebas, their contours, compactified amoebas and sections of three-dimensional amoebas by two-dimensional planes. We also provide a method and an algorithm for the computation of polynomials whose amoebas exhibit the most complicated topology among all polynomials with a fixed Newton polytope. The presented algorithms are implemented i...
متن کاملAmoebas of Genus at Most One
The amoeba of a Laurent polynomial f ∈ C[z 1 , . . . , z n ] is the image of its zero set V(f) under the log-absolute-value map. Understanding the space of amoebas (i.e., the decomposition of the space of all polynomials, say, with given support or Newton polytope, with regard to the existing complement components) is a widely open problem. In this paper we investigate the class of polynomials ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1608.08663 شماره
صفحات -
تاریخ انتشار 2016