Abstract
Recently, a general approach to solving Riemann–Hilbert problems numerically has been developed. We review this numerical framework and apply it to the calculation of orthogonal polynomials on the real line. Combining this numerical algorithm with the approach of Bornemann to compute Fredholm determinants, we are able to calculate spectral densities and gap statistics for a broad class of finite-dimensional unitary invariant ensembles. We show that the accuracy of the numerical algorithm for approximating orthogonal polynomials is uniform as the degree grows, extending the existing theory to handle g-functions. As another example, we compute the Hastings–McLeod solution of the homogeneous Painlevé II equation.
Similar content being viewed by others
Notes
Instead of scaling Ω, one can also scale the matrix itself in the statement of the universality law; cf. [3, Theorem 3.1.1]. Alternatively, one can rescale the kernel of the operator through a change of variables [8, Chap. 8]. We choose the convention of scaling only Ω and leaving the kernel unchanged.
We are not imposing the bulk scaling introduced below, to demonstrate that the numerical approach does not depend on choosing the scalings correctly.
This was demonstrated in [8, Chap. 8] for an equivalent, rescaled kernel acting on (−s,s). Here, we leave the kernel unmodified and scale only Ω.
Not to be confused with the Hadamard finite-part integral.
References
Ablowitz, M.J., Segur, H.: Asymptotic solutions of the Korteweg–de Vries equation. Stud. Appl. Math. 57, 13–44 (1977)
Akemann, G., Baik, J., Di Francesco, P.: The Oxford Handbook of Random Matrix Theory. Oxford University Press, London (2011)
Anderson, G., Guionnet, A., Zeitouni, O.: Introduction to Random Matrices. Studies in Advanced Mathematics, Vol. 118. Cambridge University Press, Cambridge (2009)
Bornemann, F.: On the numerical evaluation of distributions in random matrix theory. Markov Process. Relat. Fields 16, 803–866 (2010)
Bornemann, F.: On the numerical evaluation of Fredholm determinants. Maths. Comp. 79, 871–915 (2010)
Claeys, T., Krasovsky, I., Its, A.: Higher-order analogues of the Tracy–Widom distribution and the Painlevé II hierarchy. Commun. Pure Appl. Math. 63, 362–412 (2010)
Claeys, T., Olver, S.: Numerical study of higher order analogues of the Tracy–Widom distribution. Cont. Maths 578, 83–99 (2011)
Deift, P.: Orthogonal Polynomials and Random Matrices: A Riemann–Hilbert Approach. Am. Math. Soc., Providence (2000)
Deift, P., Gioev, D.: Universality at the edge of the spectrum for unitary, orthogonal, and symplectic ensembles of random matrices. Commun. Pure Appl. Math. 60(6), 867–910 (2007)
Deift, P., Gioev, D.: Random Matrix Theory: Invariant Ensembles and Universality, vol. 18. Am. Math. Soc., Providence (2009)
Deift, P., Kriecherbauer, T., McLaughlin, K.T.-R.: New results on the equilibrium measure for logarithmic potentials in the presence of an external field. J. Approx. Theory 95(3), 388–475 (1998)
Deift, P., Kriecherbauer, T., McLaughlin, K.T.-R., Venakides, S., Zhou, X.: Asymptotics for polynomials orthogonal with respect to varying exponential weights. Int. Math. Res. Not. 1997(16), 759–782 (1997)
Deift, P., Kriecherbauer, T., McLaughlin, K.T.-R., Venakides, S., Zhou, X.: Strong asymptotics of orthogonal polynomials with respect to exponential weights. Commun. Pure Appl. Math. 52(12), 1491–1552 (1999)
Deift, P., Kriecherbauer, T., McLaughlin, K.T.-R., Venakides, S., Zhou, X.: Uniform asymptotics for polynomials orthogonal with respect to varying exponential weights and applications to universality questions in random matrix theory. Commun. Pure Appl. Math. 52(11), 1335–1425 (1999)
Edelman, A., Rao, N.R.: Random matrix theory. Acta Numer. 14(1), 233–297 (2005)
Fokas, A.S., Its, A.R., Kapaev, A.A., Novokshenov, V.Y.: Painlevé Transcendents: The Riemann–Hilbert Approach. AMS, Providence (2006)
Fokas, A.S., Its, A.R., Kitaev, A.V.: The isomonodromy approach to matric models in 2d quantum gravity. Commun. Math. Phys. 147(2), 395–430 (1992)
Fornberg, B., Weideman, J.A.C.: A numerical methodology for the Painlevé equations. J. Comput. Phys. (2011)
Gautschi, W.: Orthogonal Polynomials: Applications and Computation. Oxford University Press, London (2004)
Hastings, S.P., McLeod, J.B.: A boundary value problem associated with the second Painlevé transcendent and the Korteweg–de Vries equation. Arch. Ration. Mech. Anal. 73, 31–51 (1980)
Mehta, M.L.: Random Matrices. Academic Press, San Diego (2004)
Mhaskar, H.N., Saff, E.B.: Extremal problems for polynomials with exponential weights. Trans. Am. Math. Soc. 285(1), 203–234 (1984)
Olver, F.W.J., Lozier, D.W., Boisvert, R.F., Clark, C.W.: NIST Handbook of Mathematical Functions. Cambridge University Press, Cambridge (2010)
Olver, S.: Computation of equilibrium measures. J. Approx. Theory 163, 1185–1207 (2011)
Olver, S.: Computing the Hilbert transform and its inverse. Math. Comput. 80, 1745–1767 (2011)
Olver, S.: Numerical solution of Riemann–Hilbert problems: Painlevé II. Found. Comput. Math. 11, 153–179 (2011)
Olver, S.: A general framework for solving Riemann–Hilbert problems numerically. Numer. Math. 122, 305–340 (2012)
Olver, S., Trogdon, T.: Nonlinear steepest descent and the numerical solution of Riemann–Hilbert problems. Commun. Pure Appl. Math. (2012, to appear)
Prähofer, M., Spohn, H.: Exact scaling functions for one-dimensional stationary KPZ growth. http://www-m5.ma.tum.de/KPZ/
Prähofer, M., Spohn, H.: Exact scaling functions for one-dimensional stationary KPZ growth. J. Stat. Phys. 115, 255–279 (2004)
Rakhmanov, E.A.: On asymptotic properties of polynomials orthogonal on the real axis. Mat. Sb. 161(2), 163–203 (1982)
Saff, E.B., Totik, V.: Logarithmic Potentials with External Fields. Springer, Berlin (1997)
Tracy, C.A., Widom, H.: Level-spacing distributions and the Airy kernel. Commun. Math. Phys. 159, 151–174 (1994)
Wechslberger, G., Bornemann, F.: Automatic deformation of Riemann–Hilbert problems with applications to the Painlevé II transcendents. Constr. Approx. (2014). doi:10.1007/s00365-013-9199-x
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Percy Deift and Alexander Its.
Appendix A: Computing a Hastings–McLeod Solution of the Painlevé II Transcendent
Appendix A: Computing a Hastings–McLeod Solution of the Painlevé II Transcendent
Here we focus on the (homogeneous) Painlevé II ODE, which is as follows:
(For brevity we refer to the homogeneous Painlevé II simply as Painlevé II.) There are many important applications of this equation. As mentioned above, the Tracy–Widom distribution [33] is written in terms of the Hastings–McLeod solution q [20]:
Furthermore, it has also been shown that asymptotic solutions to the Korteweg–de Vries and modified Korteweg–de Vries equations can be written in terms of Ablowitz–Segur solutions [1]. The aim of this section is to demonstrate that the RH formulation can indeed be used effectively to compute solutions to Painlevé II, even in the asymptotic regime.
Solutions to differential equations such as (22) are typically defined by initial conditions: at a point x we are given u(x) and u′(x). In the RH formulation, however, we do not specify initial conditions. Rather, the solution is specified by the Stokes’ constants; constants s 1,s 2,s 3 which satisfy the following condition:
We treat the Stokes’ constants as given, as in many applications they arise naturally while initial conditions do not. Given such constants, we denote the associated solution to (22) by
P II and its derivative can be viewed as the special functions that map Stokes’ constants to initial conditions.
At first glance, computing solutions to (22) appears trivial: given initial conditions, simply use one’s favourite time-stepping algorithm, e.g., input it into an ODE toolbox such as Matlab’s ode45 or Mathematica’s NDSolve. Unfortunately, several difficulties immediately become apparent. In Fig. 15, we plot several solutions to (22) (computed using the approach we are advocating): the Hastings–McLeod solution and perturbations of the Hastings–McLeod solution. Note that the solution is inherently unstable, and small perturbations cause oscillations—which make standard ODE solvers inefficient—and poles—which completely breaks such ODE initial value problem solvers (the issue of poles can be resolved using the methodology of [18]).
Remark
There are many other methods for computing the Tracy–Widom distribution itself as well as the Hastings–McLeod solution [4, 5], based on the Fredholm determinant formulation or solving a boundary value problem. Moreover, accurate data values have been tabulated using high precision arithmetic with a Taylor series method [29, 30]. However, we see that there is a whole family of solutions to Painlevé II which exhibit similar sensitivity to initial conditions, and thus a reliable, general numerical method is needed even for this case. We note that the approach [18], which combines boundary value problem solvers with initial value problem solvers, may also be successful for calculating such solutions. However, it only works with initial conditions, not with Stokes’ constants.
Let Φ(x;λ) solve the RH problem depicted in Fig. 16: let Γ=Γ 1∪⋯∪Γ 6 for \(\varGamma_{\kappa}\{ s \mathrm{e}^{\mathrm{i}\pi(\kappa/3-1/6)}: s \in\mathbb{R}^{+}\}\), i.e., Γ consists of six rays emanating from the origin, as seen in Fig. 16. Then the jump matrix is defined by G(x;λ)=G κ (x;λ) for z∈Γ κ , where
with s 4=−s 1, s 5=−s 2, and s 6=−s 3. This is the RH problem that was solved numerically in [26]. We recover the corresponding solution to Painlevé II from Φ by [16]:
As |x| becomes large, the jump matrices G are increasingly oscillatory. We combat this issue by deforming the contour so that these oscillations become exponential decay. To simplify this procedure, we first rescale the RH problem. Note that if we let \(z = \sqrt{|x|} \lambda\), then the jump contour Γ remains unchanged, and
where \(\tilde{G}(z) = G_{\kappa}(z/\sqrt{|x|})\) on Γ κ for
and
Then
1.1 A.1 Positive x with s 2=0
We deform the RH problem for Painlevé II so that numerics are asymptotically stable for positive x. The deformation is extremely simple under the following special case:
We remark that, unlike other deformations, the following deformation can be easily extended to achieve asymptotic stability for x in the complex plane such that \(-\frac{\pi}{3} < \arg x < \frac{\pi}{6}\).
On the undeformed contour, the terms \(\mathrm{e}^{\pm \mathrm{i} |x|^{3/2} \theta(z)}\) become oscillatory as |x| becomes large. However, with the right choice of curve h(t), e±iθ(h(t)) has no oscillations; instead, it decays exponentially fast as t→∞. But h is precisely the path of steepest descent, which passes through the stationary points of θ, i.e., the points where the derivative of θ vanishes. We readily find that
and the stationary points are z=±i/2.
We note that, since G 2=I, when we deform Γ 1 and Γ 3 through i/2, they become completely disjoint from Γ 4 and Γ 6, which we then deform through −i/2. We also point out that \(G_{3}^{-1} = G_{1}\) and \(G_{6}^{-1} = G_{4}\); thus we reverse the orientation of Γ 3 and Γ 4. Define Γ ↑ to be the curve G 1 is defined on and Γ ↓ to be the contour G 4 is defined on, as seen in Fig. 17.
Now recall that
However, we only have Γ ↑ emanating from i/2, with jump matrix
This is exponentially decaying to the identity along Γ ↑, as is G 4 along Γ ↓. We employ the approach of Sect. 3.2. We first use Lemma 3 to truncate the contours near the stationary point. What remains is to determine what near means. Because θ behaves like \(\mathcal {O}(z \pm \mathrm{i}/2)^{2}\) near the stationary points, Assumption 2 implies that we should choose the shifting of β 1=i/2 and β 2=−i/2, the scalings α 1=α 2=r|x|−3/4, and the canonical domains Ω 1=Ω 2=[−1,1]. Here r is chosen so that what is truncated is negligible in the sense of Lemma 3. G 6 is similar. The complete proof of asymptotic stability follows from Theorem 2.
1.2 A.2 Negative x with s 1=−s 3=±i and s 2=0
We now develop deformations for the Hastings–McLeod solution for negative x, which corresponds to s 1=±i, s 2=0, and s 3=∓i [16]. We realise numerical asymptotic stability in the aforementioned sense for the following special case:
We begin by deforming the RH problem (Fig. 16) to the one shown in Fig. 18. The horizontal contour extends from −α to α for α>0. We determine α below. Define
Note that the assumption s 2=0 simplifies the form of the RH problem substantially, see Fig. 18(b). We use an approach similar to that of the equilibrium measure to replace θ with a function possessing more desirable properties. Define
The branch cut for g(z) is chosen along [−α,α]. If we set \(\alpha= 1/\sqrt{2}\), the branch of g is chosen so that \(g(z) -\theta (z) \sim \mathcal {O}(z^{-1})\). Furthermore, g +(z)+g −(z)=0, and Im(g −(z)−g +(z))>0 on (−α,α). Define \(\hat{G}_{i} = \varTheta^{-1}_{-}G_{i} \varTheta_{+}\), and note that
As x→−∞, G 0 tends to the matrix
The solution of the RH problem
is given by
Here β has a branch cut on [−α,α] and satisfies β(z)→1 as z→∞. It is clear that \((\varPsi _{\mathrm {HM}}^{\text {out}})_{+} \hat{G}_{0} (\varPsi _{\mathrm {HM}}^{\text {out}})^{-1}_{-} \rightarrow I\) uniformly on every closed subinterval of (−α,α).
We define local parametrises near ±α:
We are ready to define the global parametrix. Given r>0, define
It follows that Ψ HM satisfies the RH problem shown in Fig. 19.
Let \(\hat{\varPhi}\) be the solution of the RH problem shown in Fig. 20(a). It follows that \(\varDelta = \hat{\varPhi} \varPsi _{\mathrm {HM}}^{-1}\) solves the RH problem shown in Fig. 20(b). The RH problem for Δ has jump matrices that decay to the identity away from ±α. We use Assumption 2 to determine that we should use r=|x|−1. We solve the RH problem for Δ numerically. To compute the solution of Painlevé II, we use the formula
See Fig. 15 for a plot of the Hastings–McLeod solution with s 1=−i. To verify our computations, we may we use the asymptotics [16]:
We use
as an indicator of the relative error, which should tend to zero for x large and negative. We demonstrate this in Fig. 21.
Remark
Since β has unbounded singularities, we expect that a similar issue as in Sect. 5.2.2 will arise. We do not go though the details of this, but this approach produces accurate numerics for all x on the real line.
Rights and permissions
About this article
Cite this article
Olver, S., Trogdon, T. Numerical Solution of Riemann–Hilbert Problems: Random Matrix Theory and Orthogonal Polynomials. Constr Approx 39, 101–149 (2014). https://doi.org/10.1007/s00365-013-9221-3
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00365-013-9221-3
Keywords
- Random matrix theory
- Invariant ensembles
- Orthogonal polynomials
- Riemann–Hilbert problems
- Equilibrium measures
- Universality