Related papers: Viskovatov algorithm for Hermite-Pad\'e polynomial…
Given a system of functions $\textup{\textbf{F}}=(F_1,\ldots,F_d),$ analytic on a neighborhood of some compact subset $E$ of the complex plane with simply connected complement, we define a sequence of vector rational functions with common…
We study the convergence of sequences of type I and type II Hermite-Pad\'e approximants for certain systems of meromorphic functions made up of rational modifications of Nikishin systems of functions.
This paper provides an algorithmic generalization of Dickson's method of classifying permutation polynomials (PPs) of a given degree $d$ over finite fields. Dickson's idea is to formulate from Hermite's criterion several polynomial…
A class of generalized complex polynomials of Hermite type, suggested by a special magnetic Schrodinger operator, is introduced and some related basic properties are discussed.
In [3] it was shown that four seemingly different algorithms for computing low-rank approximate solutions $X_j$ to the solution $X$ of large-scale continuous-time algebraic Riccati equations (CAREs) $0 = \mathcal{R}(X) :=…
In this work, based on quantum operator Hermite polynomials and Weyl's mapping rule, we find a generation function of the two-variable Hermite polynomials. And then, noting that the Weyl ordering is invariant under the similar…
In this work we present new results on the convergence of diagonal sequences of certain mixed type Hermite-Pad\'e approximants of a Nikishin system. The study is motivated by a mixed Hermite-Pad\'e approximation scheme used in the…
This paper presents new fast algorithms for Hermite interpolation and evaluation over finite fields of characteristic two. The algorithms reduce the Hermite problems to instances of the standard multipoint interpolation and evaluation…
We study the computation of canonical bases of sets of univariate relations $(p_1,\ldots,p_m) \in \mathbb{K}[x]^{m}$ such that $p_1 f_1 + \cdots + p_m f_m = 0$; here, the input elements $f_1,\ldots,f_m$ are from a quotient…
Pad\'e approximation has two natural extensions to vector rational approximation through the so called type I and type II Hermite-Pad\'e approximants. The convergence properties of type II Hermite-Pad\'e approximants have been studied. For…
Let $p$ be an odd prime. The factorization of the polynomial $x^{p+1}-1$ over the integer residue ring $\mathbb{Z}_{p^e}$ is pivotal for constructing cyclic codes with Hermitian symmetry, a critical resource for Linear Complementary Dual…
Fixing a positive integer $r$ and $0 \le k \le r-1$, define $f^{\langle r,k \rangle}$ for every formal power series $f$ as $ f(x) = f^{\langle r,0 \rangle}(x^r)+xf^{\langle r,1 \rangle}(x^r)+ \cdots +x^{r-1}f^{\langle r,r-1 \rangle}(x^r).$…
We investigate the asymptotic behavior of the polynomials p, q, r of degrees n in type I Hermite-Pade approximation to the exponential function, defined by p(z)e^{-z}+q(z)+r(z)e^{z} = O(z^{3n+2}) as z -> 0. These polynomials are…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
We introduce a family of piecewise-exponential functions that have the Hermite interpolation property. Our design is motivated by the search for an effective scheme for the joint interpolation of points and associated tangents on a curve…
We consider multiple orthogonal polynomials corresponding to two Macdonald functions (modified Bessel functions of the second kind), with emphasis on the polynomials on the diagonal of the Hermite-Pad\'e table. We give some properties of…
Motivated by classical results of approximation theory, we define an Hermite-type interpolation in terms of $n$-dimensional subspaces of the space of $n$ times continuously differentiable functions. In the main result of this paper, we…
Our starting point is a basic problem in Hermite interpolation theory, namely determining the least degree of a homogeneous polynomial that vanishes to some specified order at every point of a given finite set. We solve this problem if the…
Following several decades of successive algorithmic improvements, works from the 2010s have showed how to compute the Hermite normal form (HNF) of a univariate polynomial matrix within a complexity bound which is essentially that of…
Let $\omega_0,\dots,\omega_M$ be complex numbers. If $H_0,\dots,H_M$ are polynomials of degree at most $\rho_0,\dots,\rho_M$, and $G(z)=\sum_{m=0} ^M H_m(z) (1-z)^{\omega_m}$ has a zero at $z=0$ of maximal order (for the given…