Results 11 to 20 of about 73,122 (279)
On zeros of discrete orthogonal polynomials [PDF]
Journal of Approximation Theory, 2009 AbstractWe exploit difference equations to establish sharp inequalities on the extreme zeros of the classical discrete orthogonal polynomials, Charlier, Krawtchouk, Meixner and Hahn. We also provide lower bounds on the minimal distance between their consecutive zeros.
Ilia Krasikov, Alexander Zarkh
openaire +6 more sources
A Probablistic Origin for a New Class of Bivariate Polynomials [PDF]
Symmetry, Integrability and Geometry: Methods and Applications, 2008 We present here a probabilistic approach to the generation of new polynomials in two discrete variables. This extends our earlier work on the 'classical' orthogonal polynomials in a previously unexplored direction, resulting in the discovery of an ...
Michael R. Hoare, Mizan Rahman
doaj +3 more sources
Orthogonal polynomials of a discrete variable and Lie algebras of complex-size matrices [PDF]
, 2000 We give a uniform interpretation of the classical continuous Chebyshev's and Hahn's orthogonal polynomials of discrete variable in terms of Feigin's Lie algebra gl(N), where N is any complex number.
Дмитрий Александрович Лейтес +1 more
openalex +3 more sources
Discrete Orthogonal Polynomial Expansions of Averaged Functions
Journal of Mathematical Analysis and Applications, 1995 Abstract Starting from the classical Fourier coefficients of a given function ƒ(x), Boas and Izumi [J. Indian Math. Soc.24 (1960), 191-210] derived an explicit expression for the Fourier coefficients of g(x), or appropriately defined average of ƒ(x). Later, Askey [J. Math. Anal.
Ilse Fischer
openalex +3 more sources
Discrete semi-classical orthogonal polynomials: generalized Charlier
Journal of Computational and Applied Mathematics, 2000 AbstractGeneralized Charlier polynomials are introduced as semi-classical orthogonal polynomials of class 1 with one parameter. Main characteristic data are established from the Laguerre–Freud equations generating the coefficients of the recurrence relation satisfied by the polynomials.
Mahouton Norbert Hounkonnou +2 more
openalex +4 more sources
Moments of discrete orthogonal polynomial ensembles [PDF]
Electronic Journal of Probability, 2020 20 ...
Cohen, Philip +2 more
openaire +4 more sources
A General Method for Generating Discrete Orthogonal Matrices
IEEE Access, 2021 Discrete orthogonal matrices have applications in information coding and cryptography. It is often challenging to generate discrete orthogonal matrices.
Ka-Hou Chan, Wei Ke, Sio-Kei Im
doaj +1 more source
Laguerre–Freud Equations for the Gauss Hypergeometric Discrete Orthogonal Polynomials
Mathematics, 2023 The Cholesky factorization of the moment matrix is considered for the Gauss hypergeometric discrete orthogonal polynomials. This family of discrete orthogonal polynomials has a weight with first moment given by ρ0=2F1a,bc+1;η.
Itsaso Fernández-Irisarri +1 more
doaj +1 more source
Discrete Entropies of Orthogonal Polynomials [PDF]
Constructive Approximation, 2008 26 pages, 6 ...
Aptekarev, A. I. +3 more
openaire +4 more sources
Comparative asymptotics for discrete semiclassical orthogonal polynomials
Bulletin of Mathematical Sciences, 2023 We study the ratio [Formula: see text] asymptotically as [Formula: see text], where the polynomials [Formula: see text] are orthogonal with respect to a discrete linear functional and [Formula: see text] denote the falling factorial polynomials.
Diego Dominici
doaj +1 more source