Related papers: Fast Multipoint-Evaluation of Bivariate Polynomial…
For a large class of polynomials, the standard method of polynomial evaluation, Horner's method, can be very inaccurate. The alternative method given here is on average 100 to 1000 times more accurate than Horner's Method. The number of…
The resultant of two univariate polynomials is an invariant of great importance in commutative algebra and vastly used in computer algebra systems. Here we present an algorithm to compute it over Artinian principal rings with a modified…
We investigate the variation in the total number of points in a random $p\times p$ square in $\mathbb{Z}^2$ where the $p$-adic valuation of a given polynomial in two variables is precisely $1$. We establish that this quantity follows a…
Evaluating or finding the roots of a polynomial $f(z) = f_0 + \cdots + f_d z^d$ with floating-point number coefficients is a ubiquitous problem. By using a piecewise approximation of $f$ obtained with a careful use of the Newton polygon of…
Multivariate orthogonal polynomials can be introduced by using a moment functional defined on the linear space of polynomials in several variables with real coefficients. We study the so-called Uvarov and Christoffel modifications obtained…
This paper investigates the p-adic valuation trees of degree-2 and degree-3 polynomials in two variables over any prime p, building upon prior research outlined in [14].
We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced…
We describe a set of new estimators for the N-point correlation functions of point processes. The variance of these estimators is calculated for the Poisson and binomial cases. It is shown that the variance of the unbiased estimator…
We revisit certain problems of pose estimation based on 3D--2D correspondences between features which may be points or lines. Specifically, we address the two previously-studied minimal problems of estimating camera extrinsics from $p \in…
We design nearly-linear time numerical algorithms for the problem of multivariate multipoint evaluation over the fields of rational, real and complex numbers. We consider both \emph{exact} and \emph{approximate} versions of the algorithm.…
In this paper we compute the 2-adic valuations of some polynomials associated with the definite integral $\int_{0}^{\infty} \frac{dx}{(x^4+2*a*x^2+1)^(m+1)}$
We study the problem of counting the total number of affine solutions of a system of n binomials in n variables over an algebraically closed field of characteristic zero. We show that we may decide in polynomial time if that number is…
A polynomial f (multivariate over a field) is decomposable if f = g(h) with g univariate of degree at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and an approximation to their number…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…
We investigate Newton's method for complex polynomials of arbitrary degree $d$, normalized so that all their roots are in the unit disk. For each degree $d$, we give an explicit set $\mathcal{S}_d$ of $3.33d\log^2 d(1 + o(1))$ points with…
Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. Theoretically, extreme points of certain cost functions can be found iteratively along the directions of the…
The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…
Bi-objective optimization problems on matroids are in general intractable and their corresponding decision problems are in general NP-hard. However, if one of the objective functions is restricted to binary cost coefficients the problem…
We investigate the minimum cost of a wide class of combinatorial optimization problems over random bipartite geometric graphs in $\mathbb{R}^d$ where the edge cost between two points is given by a $p$-th power of their Euclidean distance.…
We compare the yields of two methods to obtain Bernstein type pointwise estimates for the derivative of a multivariate polynomial in points of some domain, where the polynomial is assumed to have sup norm at most 1. One method, due to…