Related papers: Efficient computation of Laguerre polynomials

We present a number of identities involving standard and associated Laguerre polynomials. They include double-, and triple-lacunary, ordinary and exponential generating functions of certain classes of Laguerre polynomials.

In this paper, we construct families of polynomials defined by recurrence relations related to mean-zero random walks. We show these families of polynomials can be used to approximate $z^n$ by a polynomial of degree $\sim \sqrt{n}$ in…

This paper presents a new approach in application of the Fourier transform to the complex error function resulting in an efficient rational approximation. Specifically, the computational test shows that with only $17$ summation terms the…

We study the bispectrality of Laguerre type polynomials, which are defined by taking suitable linear combinations of a fixed number of consecutive Laguerre polynomials. These Laguerre type polynomials are eigenfunctions of higher-order…

Matrix valued Laguerre polynomials are introduced via a matrix weight function involving several degrees of freedom using the matrix nature. Under suitable conditions on the parameters the matrix weight function satisfies matrix Pearson…

This paper introduces a very fast method for the computation of the resolvent of fractional powers of operators. The analysis is kept in the continuous setting of (potentially unbounded) self adjoint positive operators in Hilbert spaces.…

This paper analyzes a method to approximate the first passage time probability density function which turns to be particularly useful if only sample data are available. The method relies on a Laguerre-Gamma polynomial approximation and…

The Volterra series can be used to model a large subset of nonlinear, dynamic systems. A major drawback is the number of coefficients required model such systems. In order to reduce the number of required coefficients, Laguerre polynomials…

In this paper we propose a general strategy for rapidly computing sparse Legendre expansions. The resulting methods yield a new class of fast algorithms capable of approximating a given function $f:[-1,1] \rightarrow \mathbb{R}$ with a…

A new Las Vegas algorithm is presented for the composition of two polynomials modulo a third one, over an arbitrary field. When the degrees of these polynomials are bounded by $n$, the algorithm uses $O(n^{1.43})$ field operations, breaking…

Expressions for the summation of the series involving the Laguerre polynomials \[S_m(\pm\nu, \pm p)\equiv e^{-x}\sum_{n=0}^\infty \frac{x^n\,L_n^{(\nu)}(x)}{(1\pm \nu\pm p)_n}\frac{(f+m)_n}{(f)_n}\] for any non-negative integers $m$ and $p$…

We prove that the generalised Laguerre polynomials $L_{n}^{(\alpha)}(x)$ with $0\le \al\le 50$ are irreducible except for finitely many pairs $(n, \al)$ and that these exceptions are necessary. In fact it follows from a more general…

Previous analyses of Laguerre's method have provided results on the convergence and properties of this popular method when applied to the polynomials $p_n(z)=z^n-1$, $n\in\mathbb{N}$. While these analyses appear to provide a fairly complete…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

In this paper we give efficient algorithms for computing second-, third-, and fourth-order linear recurrences. We also present an algorithm scheme for computing terms with the indices $N,\ldots,N+n-1$ of an $n$th-order linear recurrence.…

The 3-term recurrence relation for Hermite polynomials was recently generalized to a recurrence relation for Wronskians of Hermite polynomials. In this note, a similar generalization for Laguerre polynomials is obtained.

Three specializations of a set of orthogonal polynomials with ``8 different q's'' are given. The polynomials are identified as $q$-analogues of Laguerre polynomials, and the combinatorial interpretation of the moments give infinitely many…

In this paper we give a criterion to prove boundedness results for several operators from $H^1((0,\infty),\gamma_\alpha)$ to $L^1((0,\infty),\gamma_\alpha)$ and also from $L^\infty((0,\infty),\gamma_\alpha)$ to…

We present the Polar framework for fully automating the analysis of classical and probabilistic loops using algebraic reasoning. The central theme in Polar comes with handling algebraic recurrences that precisely capture the loop semantics.…

The explicit double sum for the associated Laguerre polynomials is derived combinatorially. The moments are described using certain statistics on permutations and permutation tableaux. Another derivation of the double sum is provided using…