Related papers: Efficient computation of Laguerre polynomials
Consider polynomials over ${\rm GF}(2)$. We describe efficient algorithms for finding trinomials with large irreducible (and possibly primitive) factors, and give examples of trinomials having a primitive factor of degree $r$ for all…
We give an algorithm for reversion of formal power series, based on an efficient way to implement the Lagrange inversion formula. Our algorithm requires $O(n^{1/2}(M(n) + MM(n^{1/2})))$ operations where $M(n)$ and $MM(n)$ are the costs of…
In this paper, the conformable Laguerre and associated Laguerre differential equations are solved using the Laplace transform. The solution is found to be in exact agreement with that obtained using the power series. In addition some of…
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…
Interpolation and approximation of functionals with conditionally positive definite kernels is considered on sets of centers that are not determining for polynomials. It is shown that polynomial consistency is sufficient in order to define…
It is well known that, using fast algorithms for polynomial multiplication and division, evaluation of a polynomial $F \in \mathbb{C}[x]$ of degree $n$ at $n$ complex-valued points can be done with $\tilde{O}(n)$ exact field operations in…
Motivated by a use case in theoretical hadron physics, we revisit an application of a pole-sum fit to dressing functions of a confined quark propagator. More precisely, we investigate approaches to determine the number and positions of the…
We consider the computation of the matrix logarithm by using numerical quadrature. The efficiency of numerical quadrature depends on the integrand and the choice of quadrature formula. The Gauss--Legendre quadrature has been conventionally…
If $f\!:\![a,b]\to\R$ such that $f^{(n)}$ is integrable then integration by parts gives the formula \begin{align*} &\intab f(x)\,dx = &\frac{(-1)^n}{n!}\sum_{k=0}^{n-1}(-1)^{n-k-1}\left[ \phi_n^{(n-k-1)}(a)f^{(k)}(a)-…
We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $\mathbb{F}_{q}$ of characteristic $p$ for which the first $l < p$ coefficients…
The works presented in this habilitation concern the algorithmics of polynomials. This is a central topic in computer algebra, with numerous applications both within and outside the field - cryptography, error-correcting codes, etc. For…
We consider the irreducibility of Generalised Laguerre Polynomials for negative integral values given by $L_n^{(-1-n-s)}(x)=\displaystyle\sum_{j=0}^{n}\binom{n-j+s}{n-j}\frac{x^j}{j!}.$ For different values of $s,$ this family gives…
We investigate the intertwining of Laguerre processes of parameter $\alpha$ in different dimensions. We introduce a Feller kernel that depends on $\alpha $ and intertwines the $\alpha$-Laguerre process in $N+1$ dimensions and that in $N$…
A recurrence scheme is defined for the numerical determination of high degree polynomial approximations to functions as, for instance, inverse powers near zero. As an example, polynomials needed in the two-step multi-boson (TSMB) algorithm…
Multiple orthogonal polynomials satisfy a number of recurrence relations, in particular there is a $(r+2)$-term recurrence relation connecting the type II multiple orthogonal polynomials near the diagonal (the so-called step-line recurrence…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
New expressions for Laguerre and Hermite polynomials are shown. They are based on operator algebras commonly used in quantum mechanics.
Matrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited-memory methods for the approximation of the action of…
The transformation of a Laguerre series $f (z) = \sum_{n=0}^{\infty} \lambda_{n}^{(\alpha)} L_{n}^{(\alpha)} (z)$ to a power series $f (z) = \sum_{n=0}^{\infty} \gamma_{n} z^{n}$ is discussed. Many nonanalytic functions can be expanded in…
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…