Related papers: Viskovatov algorithm for Hermite-Pad\'e polynomial…
We construct a set $H$ of orthogonal polynomial sequences that contains all the families in the Askey scheme and the $q$-Askey scheme. The polynomial sequences in $H$ are solutions of a generalized first-order difference equation which is…
This work formalizes efficient Fast Fourier-based multiplication algorithms for polynomials in quotient rings such as $\mathbb{Z}_{m}[x]/\left<x^{n}-a\right>$, with $n$ a power of 2 and $m$ a non necessarily prime integer. We also present a…
In this paper we study the singularity of multivariate Hermite interpolation of type total degree. We present a method to judge the singularity of the interpolation scheme considered and by the method to be developed, we show that all…
We study the number of real zeros of finite combinations of $K+1$ consecutive normalized Hermite polynomials of the form $$ q_n(x)=\sum_{j=0}^K\gamma_j\tilde H_{n-j}(x),\quad n\ge K, $$ where $\gamma_j$, $j=0,\dots ,K$, are real numbers…
We report on a new variant of the hybrid Monte Carlo algorithm employing a polynomial approximation of the inverse of the non-Hermitian Dirac-Wilson operator. Our approximation relies on simple and stable recurrence relations of complex…
Value iteration is a commonly used and empirically competitive method in solving many Markov decision process problems. However, it is known that value iteration has only pseudo-polynomial complexity in general. We establish a somewhat…
In this article explicit formulas for the recurrence equation p_{n+1}(x) = (A_n x + B_n) p_n(x) - C_n p_{n-1}(x) and the derivative rules sigma(x) p'_n(x) = alpha_n p_{n+1}(x) + beta_n p_n(x) + gamma_n p_{n-1}(x) and sigma(x) p'_n(x) =…
The aim of the paper is to present Hermite-type multiwavelets satisfying the vanishing moment property with respect to elements in the space spanned by exponentials and polynomials. Such functions satisfy a two-scale relation which is…
We consider Vinberg $\theta$-groups associated to a cyclic quiver on $r$ nodes. Let $K$ be the product of general linear groups associated to the nodes, acting naturally on $V = \oplus \text{Hom}(V_i, V_{i+1})$. We study the harmonic…
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…
The paper presents some heuristic results about the distribution of zeros of Hermite-Pade polynomials of first kind for the case of three functions $1,f,f^2$, where $f$ has the form $f(z): = \prod\limits_ {j = 1 } ^3 (z-a_j) ^ {\alpha_j} $,…
Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…
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…
Every matrix polynomial $\mathbf{f}_n$ can be written in the form \[ \mathbf{f}_n(z)=\mathbf{h}(z^2)+z\,\mathbf{g}_n(z^2). \] The matrix polynomial $\mathbf{f}_{2m}$ is said to be of Hurwitz type if the expression…
We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…
The classic algorithm [Papadimitriou, J.ACM '81] for IPs has a running time $n^{O(m)}(m\cdot\max\{\Delta,\|\textbf{b}\|_{\infty}\})^{O(m^2)}$, where $m$ is the number of constraints, $n$ is the number of variables, and $\Delta$ and…
A general family of matrix valued Hermite type orthogonal polynomials is introduced and studied in detail by deriving Pearson equations for the weight and matrix valued differential equations for these matrix polynomials. This is used to…
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…
The numerical construction of polynomials in the product representation (as used for instance in variants of the multiboson technique) can become problematic if rounding errors induce an imprecise or even unstable evaluation of the…
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…