1999
DOI: 10.1006/jath.1998.3235
|View full text |Cite
|
Sign up to set email alerts
|

Asymptotic Formulas for the Zeros of the Meixner Polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

3
7
0

Year Published

2001
2001
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 14 publications
(10 citation statements)
references
References 8 publications
3
7
0
Order By: Relevance
“…We would like to mention that our results coincide with those obtained in [8,9]. The formulas (6.9) in [8] and (2.35) in [9] are asymptotically equal to (5.1) in the present paper, while the formulas (6.27) in [8] and (4.19) in [9] are asymptotically equal to (5.2).…”
Section: Construction Of Parametrixsupporting
confidence: 89%
“…We would like to mention that our results coincide with those obtained in [8,9]. The formulas (6.9) in [8] and (2.35) in [9] are asymptotically equal to (5.1) in the present paper, while the formulas (6.27) in [8] and (4.19) in [9] are asymptotically equal to (5.2).…”
Section: Construction Of Parametrixsupporting
confidence: 89%
“…Our three term asymptotic approximation for the large zeros is in terms of the zeros of the Airy function Ai(z). When we let λ → 0, that is, a → 1, we obtain a three term asymptotic approximation for the large zeros of the classical Meixner polynomials, and our result agrees with [6], in which a two term asymptotic approximation is given. The additional term in our approximation is surprisingly simple.…”
Section: Introductionsupporting
confidence: 83%
“…In fact, since K 2 multiplies all terms in (2.9) and the contribution of G 1 (t) to the asymptotics of S n (x) will be exponentially small, it follows from Theorem 1 in [5], that the small zeros are located approximately at x = m with an exponentially small error. In [6] the authors make the same observation for the small zeros of the classical Meixner polynomials.…”
Section: Large N and Fixed X Asymptoticsmentioning
confidence: 65%
“…One of the approaches is based on the steepest descend method applied to a generating function and contains many ad hoc arguments. This program was realized (yet under certain restrictions on the corresponding parameters) for Krawtchouk, Meixner and in part for Charlier polynomials, see [1,2,3,8,9]. Methods based on different ideas for bounding zeros of orthogonal polynomials can be found in [5,6,12,13].…”
mentioning
confidence: 99%