نتایج جستجو برای: generalized laguerre polynomials

تعداد نتایج: 202447  

2008
Robert C. Griffiths Dario Spanò

Multivariate versions of classical orthogonal polynomials such as Jacobi, Hahn, Laguerre, Meixner are reviewed and their connection explored by adopting a probabilistic approach. Hahn and Meixner polynomials are interpreted as posterior mixtures of Jacobi and Laguerre polynomials, respectively. By using known properties of Gamma point processes and related transformations, an infinite-dimension...

2000
YUAN XU Hal L. Smith

A simple structure of the multiple Laguerre polynomial expansions is used to study the Cesàro summability above the critical index for the convolution type Laguerre expansions. The multiple Laguerre polynomial expansion of an `1-radial function f0(|x|) is shown to be an `1-radial function that coincides with the Laguerre polynomial expansion of f0, which allows us to settle the problem of summa...

2009
Dong Wang

where S is an n × n positive definite Hermitian matrix, dS is equivalent to the dH in (1) restricted in the subset of positive definite Hermitian matrices, and E+ is a subset of R+. The integral H(E) is in some sense the limiting case of L(E+), since H(E) can be evaluated by Hermitian polynomials, while L(E+) by Laguerre polynomials in the same way [8]. It is a classical result that Hermitian p...

2008
Charles F. Dunkl

The radial part of the wave function of an electron in a Coulomb potential is the product of a Laguerre polynomial and an exponential with the variable scaled by a factor depending on the degree. This note presents an elementary proof of the orthogonality of wave functions with differing energy levels. It is also shown that this is the only other natural orthogonality for Laguerre polynomials. ...

Journal: :SIAM journal on applied mathematics 2006
John W. Cain

Consider a typical experimental protocol in which one end of a one-dimensional fiber of cardiac tissue is periodically stimulated, or paced, resulting in a train of propagating action potentials. There is evidence that a sudden change in the pacing period can initiate abnormal cardiac rhythms. In this paper, we analyze how the fiber responds to such a change in a regime without arrhythmias. In ...

2008
K. Parand A. Taghavi

In this paper we propose, a collocation method for solving nonlinear singular Lane-Emden equation which is a nonlinear ordinary differential equation on semi-infnite interval. This approach is based on a generalized Laguerre polynomial collocation method. This method reduces the solution of this problem to the solution of a system of algebraic equations.We also present the comparison of this wo...

2014
Clemente Cesarano

Abstract— The concepts and the related aspects of the monomiality principle are presented in this paper to explore different approaches for some classes of orthogonal polynomials. The associated operational calculus introduced by the monomiality principle allows us to reformulate the theory of Hermite, Laguerre and Legendre polynomials from a unified point of view. They are indeed shown to be p...

2004
FARSHID HAJIR

Using the theory of Newton Polygons, we formulate a simple criterion for the Galois group of a polynomial to be “large.” For a fixed α ∈ Q−Z<0, Filaseta and Lam have shown that the nth degree Generalized Laguerre Polynomial L (α) n (x) = ∑n j=0 ( n+α n−j ) (−x)/j! is irreducible for all large enough n. We use our criterion to show that, under these conditions, the Galois group of L (α) n (x) is...

2004
Farshid Hajir

We study the algebraic properties of Generalized Laguerre Polynomials for negative integral values of the parameter. For integers r, n ≥ 0, we conjecture that L n (x) = Pn j=0 `n− j+r n− j ́ x / j! is a Q-irreducible polynomial whose Galois group contains the alternating group on n letters. That this is so for r = n was conjectured in the 1950’s by Grosswald and proven recently by Filaseta and T...

2009
DAN DRAKE

We show combinatorially that the higher-order matching polynomials of several families of graphs are d-orthogonal polynomials. The matching polynomial of a graph is a generating function for coverings of a graph by disjoint edges; the higher-order matching polynomial corresponds to coverings by paths. Several families of classical orthogonal polynomials—the Chebyshev, Hermite, and Laguerre poly...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید