Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials

From MaRDI portal
Publication:485294

DOI10.1007/S00365-013-9221-3zbMATH Open1357.60015arXiv1210.2199OpenAlexW2009624315MaRDI QIDQ485294FDOQ485294

Thomas Trogdon, Sheehan Olver

Publication date: 9 January 2015

Published in: Constructive Approximation (Search for Journal in Brave)

Abstract: In recent developments, a general approach for 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 an approach to compute Fredholm determinants, we are able to calculate level densities and gap statistics for general finite-dimensional unitary ensembles. We also include a description of how to compute the Hastings--McLeod solution of the homogeneous Painlev'e II equation.


Full work available at URL: https://arxiv.org/abs/1210.2199




Recommendations




Cites Work


Cited In (14)

Uses Software





This page was built for publication: Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485294)