Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials (Q485294)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials |
scientific article |
Statements
Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials (English)
0 references
9 January 2015
0 references
The authors develop numerical methods for solving Riemann-Hilbert problems which are applied to the calculation of orthogonal polynomials. Spectral densities and gap statistics for a large family of finite-dimensional unitary invariant ensembles are calculated by applying the suggested approach. The considered techniques are related to the method of nonlinear steepest descent, including contour deformations and the g-function technique. The accuracy of the algorithm is investigated in detail and the results are illustrated in several examples, for example, the Hastings-McLeod solution of the homogeneous Painlevé II equation is computed.
0 references
random matrix theory
0 references
invariant ensembles
0 references
orthogonal polynomials
0 references
Riemann-Hilbert problems
0 references
0 references
0 references
0 references