Related papers: Polar Varieties and Efficient Real Equation Solvin…
We consider parametrized systems of generalized polynomial equations (with real exponents) in $n$ positive variables, involving $m$ monomials with positive parameters; that is, $x\in\mathbb{R}^n_>$ such that ${A \, (c \circ x^B)=0}$ with…
A 1993 result of Alon and F\"uredi gives a sharp upper bound on the number of zeros of a multivariate polynomial over an integral domain in a finite grid, in terms of the degree of the polynomial. This result was recently generalized to…
This paper is the widely extended version of the publication, appeared in Proceedings of ISSAC'2009 conference \citep*{ALM09}. We discuss more details on proofs, present new algorithms and examples. We present a general algorithm for…
We present a new open source C library \texttt{msolve} dedicated to solving multivariate polynomial systems of dimension zero through computer algebra methods. The core algorithmic framework of \texttt{msolve} relies on Gr\''obner bases and…
Multi-homogeneous polynomial systems arise in many applications. We provide bit complexity estimates for solving them which, up to a few extra other factors, are quadratic in the number of solutions and linear in the height of the input…
Student appreciation of a function is enhanced by understanding the graphical representation of that function. From the real graph of a polynomial, students can identify real-valued solutions to polynomial equations that correspond to the…
In this paper, an algorithm to compute a certified $G^1$ rational parametric approximation for algebraic space curves is given by extending the local generic position method for solving zero dimensional polynomial equation systems to the…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
Affine transformations have been recently used for stereo vision. They can be exploited in various computer vision application, e.g., when estimating surface normals, homographies, fundamental and essential matrices. Even full 3D…
We consider applications of a finitary version of the Affine Representability theorem, which follows from recent work of Belov-Kanel, Rowen, and Vishne. Using this result we are able to show that when given a finite set of polynomial…
We present an algorithm for constructing numerical solutions to one--dimensional nonlinear, variable coefficient boundary value problems. This scheme is based upon applying the Homotopy Analysis Method (HAM) to decompose a nonlinear…
The accurate solution of some of the main problems in numerical linear algebra (linear system solving, eigenvalue computation, singular value computation and the least squares problem) for a totally positive Bernstein-Vandermonde matrix is…
We utilize the same technique as in [arXiv:2205.04254 (2022)] to provide some representations of polynomials non-negative on a basic semi-algebraic set, defined by polynomial inequalities, under more general conditions. Based on each…
We explicate a procedure to solve general linear differential equations, which connects the desired solutions to monomials x^m of an appropriate degree m. In the process the underlying symmetry of the equations under study, as well as that…
We consider elliptic partial differential equations with diffusion coefficients that depend affinely on countably many parameters. We study the summability properties of polynomial expansions of the function mapping parameter values to…
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…
We study sum of squares (SOS) relaxations to optimize polynomial functions over a set $V\cap R^n$, where $V$ is a complex algebraic variety. We propose a new methodology that, rather than relying on some algebraic description, represents…
We characterize embeddability of algebraic varieties into smooth toric varieties and prevarieties. Our embedding results hold also in an equivariant context and thus generalize a well known embedding theorem of Sumihiro on quasiprojective…
We design a homotopy continuation algorithm, that is based on numerically tracking Viro's patchworking method, for finding real zeros of sparse polynomial systems. The algorithm is targeted for polynomial systems with coefficients…