Algorithms for Construction of Recurrence Relations for the Coefficients of the Fourier Series Expansions with Respect to Classical Discrete Orthogonal Polynomials

2021 ◽  
Author(s):  
Hany M. Ahmed
Keyword(s):  
Fourier Series ◽  
Orthogonal Polynomials ◽  
Recurrence Relations ◽  
Series Expansions ◽  
Discrete Orthogonal Polynomials ◽  
Discrete Orthogonal

Stieltjes’ theorem for classical discrete orthogonal polynomials

2020 ◽  
Vol 61 (10) ◽  
pp. 103505
Author(s):  
K. Castillo ◽  
F. R. Rafaeli ◽  
A. Suzuki
Keyword(s):  
Orthogonal Polynomials ◽  
Discrete Orthogonal Polynomials ◽  
Discrete Orthogonal

scholarly journals Bounds for zeros of Meixner and Kravchuk polynomials

2014 ◽  
Vol 17 (1) ◽  
pp. 47-57 ◽  
Author(s):  
A. Jooste ◽  
K. Jordaan
Keyword(s):  
Orthogonal Polynomials ◽  
Recurrence Relations ◽  
Discrete Orthogonal ◽  
Bounds For Zeros ◽  
Set Of Points ◽  
Kravchuk Polynomials

AbstractThe zeros of certain different sequences of orthogonal polynomials interlace in a well-defined way. The study of this phenomenon and the conditions under which it holds lead to a set of points that can be applied as bounds for the extreme zeros of the polynomials. We consider different sequences of the discrete orthogonal Meixner and Kravchuk polynomials and use mixed three-term recurrence relations, satisfied by the polynomials under consideration, to identify bounds for the extreme zeros of Meixner and Kravchuk polynomials.

Sign in / Sign up

Export Citation Format

Share Document