Related papers: Interpolation by polynomials with symmetries on th…
Starting with univariate polynomial interpolation we arrive to a natural generalization of fundamental theorem of algebra for certain systems of multivariate algebraic equations.
Due to properties such as interpolation, smoothness, and spline connections, Hermite subdivision schemes employ fast iterative algorithms for geometrically modeling curves/surfaces in CAGD and for building Hermite wavelets in numerical…
We review our recent results on pseudo-hermitian random matrix theory which were hitherto presented in various conferences and talks. (Detailed accounts of our work will appear soon in separate publications.) Following an introduction of…
Let $\delta(\Pc) = (\delta_0, \delta_1,..., \delta_d)$ be the $\delta$-vector of an integral polytope $\Pc \subset \RR^N$ of dimension $d$. Following the previous work of characterizing the $\delta$-vectors with $\sum_{i=0}^d \delta_i \leq…
Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…
We give an estimate of the general divided differences $[x_0,\dots,x_m;f]$, where some of the $x_i$'s are allowed to coalesce (in which case, $f$ is assumed to be sufficiently smooth). This estimate is then applied to significantly…
Multipoint polynomial evaluation and interpolation are fundamental for modern symbolic and numerical computing. The known algorithms solve both problems over any field of constants in nearly linear arithmetic time, but the cost grows to…
In the space of all entire functions it is solved the problem of interpolation taking into account multiplicities by sums of the series of exponentials with the exponents from a given set. It is found a criterion of solubility of the…
We define a convex-polynomial to be one that is a convex combination of the monomials $\{1, z, z^2, \ldots\}$. This paper explores the intimate connection between peaking convex-polynomials, interpolating convex-polynomials, invariant…
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…
In this paper, we introduce some difference sequence spaces in bigeometric calculus. We determine the $\alpha$-duals of these sequence spaces and study their matrix transformations. We also develop an interpolating polynomial in bigeometric…
Leja points on a compact $K \subset \mathbb{C}$ are known to provide efficient points for interpolation, but their actual implementation can be computationally challenging. So-called pseudo Leja points are a more tractable solution, yet…
This work is divided into three parts. The first part concerns polynomials in one variable with all real roots. We consider linear transformations that preserve real rootedness, as well as matrices that preserve interlacing. The second part…
We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on…
Let a and x denote tuples of (jointly) freely noncommuting variables. A square matrix valued polynomial p in these variables is naturally evaluated at a tuple (A,X) of symmetric matrices with the result p(A,X) a square matrix. The…
A new class of univariate stationary interpolatory subdivision schemes of dual type is presented. As opposed to classical primal interpolatory schemes, these new schemes have masks with an even number of elements and are not step-wise…
Every real hyperbolic form in three variables can be realized as the determinant of a linear net of Hermitian matrices containing a positive definite matrix. Such representations are an algebraic certificate for the hyperbolicity of the…
An algorithm for generating interpolants for formulas which are conjunctions of quadratic polynomial inequalities (both strict and nonstrict) is proposed. The algorithm is based on a key observation that quadratic polynomial inequalities…
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we…
Let I=<f_1, ..., f_m> be a zero dimensional radical ideal Q[x_1,...,x_n]. Assume that we are given approximations {z_1,...,z_k} in C^n for the common roots V(I)={xi_1,...,xi_k}. In this paper we show how to construct and certify the…