Related papers: Efficient computation of Laguerre polynomials
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
We are concerned with the monic orthogonal polynomials with respect to a singularly perturbed Laguerre-type weight. By using the ladder operator approach, we derive a complicated system of nonlinear second-order difference equations…
The paper focuses on an approximation of the first passage time probability density function of a Feller stochastic process by using cumulants and a Laguerre-Gamma polynomial approximation. The feasibility of the method relies on closed…
In this paper we give sufficient conditions on a measurable function $p:(0,\infty)^n\rightarrow [1,\infty)$ in order that harmonic analysis operators (maximal operators, Riesz transforms, Littlewood--Paley functions and multipliers)…
We demonstrate that a modification of the classical index calculus algorithm can be used to factor integers. More generally, we reduce the factoring problem to finding an overdetermined system of multiplicative relations in any factor base…
This paper provides an efficient recursive approach of the spectral Tau method to approximate the solution of system of generalized Abel-Volterra integral equations. In this regards, we first investigate the existence, uniqueness as well as…
We consider polynomials orthogonal on $[0,\infty)$ with respect to Laguerre-type weights $w(x)=x^\alpha e^{-Q(x)}$, where $\alpha>-1$ and where $Q$ denotes a polynomial with positive leading coefficient. The main purpose of this paper is to…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
Based on the work of Chen and Its [{\em J. Approx. Theory} {\bf 162} ({2010}) {270--297}], we further study orthogonal polynomials with respect to the singularly perturbed Laguerre weight $w(x;t,\alpha) = {x^\alpha}{\mathrm e^{-…
We present a new rational approximation algorithm based on the empirical interpolation method for interpolating a family of parametrized functions to rational polynomials with invariant poles, leading to efficient numerical algorithms for…
In a previous paper, we presented conjectures of the recurrence relations with constant coefficients for the multi-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson and Askey-Wilson types. In this paper we present a proof for the…
This paper has a threefold aim. On the one hand, we provide a complete description of Laguerre-Hahn forms of class zero. This fills a gap in the literature: more precisely, up to an affine change of variables, there are ten families,…
We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the…
Associated Legendre polynomials and spherical harmonics are central to calculations in many fields of science and mathematics - not only chemistry but computer graphics, magnetic, seismology and geodesy. There are a number of algorithms for…
We consider the problem of computing the monic gcd of two polynomials over a number field L = Q(alpha_1,...,alpha_n). Langemyr and McCallum have already shown how Brown's modular GCD algorithm for polynomials over Q can be modified to work…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
We show how rational function approximations to the logarithm, such as $\log z \approx (z^2 - 1)/(z^2 + 6z + 1)$, can be turned into fast algorithms for approximating the determinant of a very large matrix. We empirically demonstrate that…
We present a deterministic algorithm which computes the multilinear factors of multivariate lacunary polynomials over number fields. Its complexity is polynomial in $\ell^n$ where $\ell$ is the lacunary size of the input polynomial and $n$…
For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…
Explicit solutions for the three-term recurrence satisfied by associated continuous dual $q$-Hahn polynomials are obtained. A minimal solution is identified and an explicit expression for the related continued fraction is derived. The…