相关论文: Linearization coefficients for orthogonal polynomi…
By means of a symbolic method, a new family of time-space harmonic polynomials with respect to L\'evy processes is given. The coefficients of these polynomials involve a formal expression of L\'evy processes by which many identities are…
We generalize Taylor's theorem by introducing a stochastic formulation based on an underlying Poisson point process model. We utilize this approach to propose a novel non-linear regression framework and perform statistical inference of the…
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…
We obtain new explicit formulas for the recurrence coefficients of the q-orthogonal polynomial sequences in a class that extends the q-Askey scheme. Our formulas express the recurrence coefficients in terms of four parameters that determine…
About two dozens of exactly solvable Markov chains on one-dimensional finite and semi-infinite integer lattices are constructed in terms of convolutions of orthogonality measures of the Krawtchouk, Hahn, Meixner, Charlier, $q$-Hahn,…
We present a framework for the construction of linearizations for scalar and matrix polynomials based on dual bases which, in the case of orthogonal polynomials, can be described by the associated recurrence relations. The framework…
Logarithms of determinants of large positive definite matrices appear ubiquitously in machine learning applications including Gaussian graphical and Gaussian process models, partition functions of discrete graphical models, minimum-volume…
In this paper we collect some results about arithmetic progressions of higher order, also called polynomial sequences. Those results are applied to $(m,q)$-isometric maps.
Stochastic processes find applications in modelling systems in a variety of disciplines. A large number of stochastic models considered are Markovian in nature. It is often observed that higher order Markov processes can model the data…
We study Wronskians of Hermite polynomials labelled by partitions and use the combinatorial concepts of cores and quotients to derive explicit expressions for their coefficients. These coefficients can be expressed in terms of the…
$q$-Analogues of the coefficients of $x^a$ in the expansion of $\prod_{j=1}^N (1+x+...+x^j)^{L_j}$ are proposed. Useful properties, such as recursion relations, symmetries and limiting theorems of the ``$q$-supernomial coefficients'' are…
We show that multiple orthogonal polynomials for r measures $(\mu_1,...,\mu_r)$ satisfy a system of linear recurrence relations only involving nearest neighbor multi-indices $\vec{n}\pm \vec{e}_j$, where $\vec{e}_j$ are the standard unit…
Quantum signal processing (QSP) and its extensions are increasingly popular frameworks for developing quantum algorithms. Yet QSP implementations still struggle to complete a classical pre-processing step ('QSP-processing') that determines…
$\bar\partial$-extension of the matrix Riemann-Hilbert method is used to study asymptotics of the polynomials $P_n(z)$ satisfying orthogonality relations \[ \int_{-1}^1 x^lP_n(x)\frac{\rho(x)dx}{\sqrt{1-x^2}}=0, \quad l\in\{0,\ldots,n-1\},…
Burchnall's method to invert the Feldheim-Watson linearization formula for the Hermite polynomials is extended to all polynomial families in the Askey-scheme and its $q$-analogue. The resulting expansion formulas are made explicit for…
Orthogonal polynomials for a family of weight functions on $[-1,1]^2$, $$ \CW_{\a,\b,\g}(x,y) = |x+y|^{2\a+1} |x-y|^{2\b+1} (1-x^2)^\g(1-y^2)^{\g}, $$ are studied and shown to be related to the Koornwinder polynomials defined on the region…
In recent decades, a number of profound theorems concerning approximation of hard counting problems have appeared. These include estimation of the permanent, estimating the volume of a convex polyhedron, and counting (approximately) the…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
We describe various aspects of the Al-Salam-Carlitz $q$-Charlier polynomials. These include combinatorial descriptions of the moments, the orthogonality relation, and the linearization coefficients.
Stochastic expansion-based methods of uncertainty quantification, such as polynomial chaos and separated representations, require basis functions orthogonal with respect to the density of random inputs. Many modern engineering problems…