Related papers: Viskovatov algorithm for Hermite-Pad\'e polynomial…
Given a full column rank $M \in \Z^{\ell \times m}$ and an $F \in \Z^{n \times m}$ we present an algorithm to compute the $n \times n$ basis in Hermite form of the integer lattice comprised of all rows $p \in \Z^{1 \times n}$ such that $pF…
In this paper, we consider methods to compute the coefficients of interpolants relative to a basis of polynomials satisfying a three-term recurrence relation. Two new algorithms are presented: the first constructs the coefficients of the…
The main purpose of this paper is to compare the convergence properties of Pad\'e approximants and rational Hermite-Pad\'e approximants for some model class of multivalued analytic functions based of the inverse Zhoukovsky transform. We…
Inverse Vandermonde matrix calculation is a long-standing problem to solve nonsingular linear system $Vc=b$ where the rows of a square matrix $V$ are constructed by progression of the power polynomials. It has many applications in…
We sum multivariate generating functions composed of products of Chebyshev polynomials of the first and the second kind. That is, we find closed forms of expressions of the type $\sum_{j\geq0}\rho^{j}\prod_{m=1}^{k}T_{j+t_{m}}%…
We obtain strong and uniform asymptotics in every domain of the complex plane for the scaled polynomials $a (3nz)$, $b (3nz)$, and $c (3nz)$ where $a$, $b$, and $c$ are the type II Hermite-Pad\'e approximants to the exponential function of…
Let $d>m>1$ be integers, let $c_1,\dots, c_{m+1}$ be distinct complex numbers, and let $\mathbf{f}(z):=z^d+t_1z^{m-1}+t_2z^{m-2}+\cdots + t_{m-1}z+t_m$ be an $m$-parameter family of polynomials. We prove that the set of $m$-tuples of…
We propose a general method to construct symmetric tensor polynomials in the D-dimensional Euclidean space which are orthonormal under a general weight. The D-dimensional Hermite polynomials are a particular case of the present ones for the…
The effective formulas reducing the two-dimensional Hermite polynomials to the classical (one-dimensional) orthogonal polynomials are given. New one-parameter generating functions for these polynomials are derived. Asymptotical formulas for…
We design a new algorithm for solving parametric systems having finitely many complex solutions for generic values of the parameters. More precisely, let $f = (f_1, \ldots, f_m)\subset \mathbb{Q}[y][x]$ with $y = (y_1, \ldots, y_t)$ and $x…
Given a square, nonsingular matrix of univariate polynomials $\mathbf{F} \in \mathbb{K}[x]^{n \times n}$ over a field $\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\mathbf{F}$ with complexity…
Recently there has been a renewed interest in an extension of the notion of orthogonal polynomials known as multiple orthogonal polynomials. This notion comes from simultaneous rational approximation (Hermite-Pade approximation) of a system…
We present a FFT-based algorithm for the computation of a polynomial's coefficients from its roots, and apply it to obtain the coefficients of interpolation polynomials, to invert Vandermondians and to evaluate the symmetric functions of a…
We present a brief introduction to the theory of multiple orthogonal polynomials on the basis of known results for an important class of measures known as Nikishin systems. For type I and type II multiple orthogonal polynomials with respect…
We here specialize the standard matrix-valued polynomial interpolation to the case where on the imaginary axis the interpolating polynomials admit various symmetries: Positive semidefinite, Skew-Hermitian, $J$-Hermitian, Hamiltonian and…
We investigate generalized Laurent multiple orthogonal polynomials on the unit circle satisfying simultaneous orthogonality conditions with respect to $r$ probability measures or linear functionals on the unit circle. We show that these…
We propose and study the properties of a set of polynomials $M_{n\alpha, H\ }^{s}(z)$, $C_{n\alpha, H}^{s}(z)$ $W_{n\alpha, H}^{s}(z)$ with $n,s\in N$ $;\alpha =\pm 1;$and where $H$ stands for Hermite ; the ''root '' polynomial >.These…
We compute minimal bases of solutions for a general interpolation problem, which encompasses Hermite-Pad\'e approximation and constrained multivariate interpolation, and has applications in coding theory and security. This problem asks to…
In the least-squares fitting framework, the Vandermonde with Arnoldi (V+A) method presented in [Brubeck, Nakatsukasa, and Trefethen, {SIAM Review}, 63 (2021), pp. 405-415] is an effective approach to compute a polynomial that approximates…
In this paper we present a generalization of the classical Hermite polynomials to the framework of Clifford-Dunkl operators. Several basic properties, such as orthogonality relations, recurrence formulae and associated differential…