1999
DOI: 10.1002/(sici)1097-0312(199912)52:12<1491::aid-cpa2>3.0.co;2-#
|View full text |Cite
|
Sign up to set email alerts
|

Strong asymptotics of orthogonal polynomials with respect to exponential weights

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

13
846
0
5

Year Published

1999
1999
2008
2008

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 544 publications
(864 citation statements)
references
References 40 publications
13
846
0
5
Order By: Relevance
“…Proof (Theorem 1.9) We will use the following asymptotic formula for the Hermite polynomials, [3], valid for…”
Section: The Mns-modelmentioning
confidence: 99%
“…Proof (Theorem 1.9) We will use the following asymptotic formula for the Hermite polynomials, [3], valid for…”
Section: The Mns-modelmentioning
confidence: 99%
“…This can be easily achieved by setting T(z) = Y(z)z −nσ 3 , but this simple-minded transformation brings the problem at infinity to the origin. What Deift, Zhou and their collaborators have shown (in [8,10,11], etc.) is that normalization can be done by using the logarithmic potential (also called the g-function) defined by…”
Section: Step 1 Y −→ Tmentioning
confidence: 99%
“…A significant development in asymptotic analysis of orthogonal polynomials took place in the 1990s, when Deift, Zhou and their associates introduced the nonlinear steepest descent method; see, e.g., [8][9][10][11]. (The term "nonlinear steepest descent method" appeared in a paper by Deift, Venakides and Zhou [12]; see also Bleher and Its [3], and Its and Kapaev [21].…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…The purpose of this paper is to study the asymptotic behavior of the polynomials L (α) n (z), when α is given by (1.6). As in [11], our method is also based on the Riemann-Hilbert approach introduced by Deift and Zhou in [4] and further developed in [2,5,6,17]; see also [3]. The starting point of this method is a theorem of Fokas, Its and Kitaev [9], which connects orthogonal polynomials and a Riemann-Hilbert problem.…”
Section: Introductionmentioning
confidence: 97%