Numerical solution of Riemann--Hilbert problems: random matrix theory and orthogonal polynomials
classification
🧮 math-ph
cs.NAmath.CVmath.MPmath.NAmath.PR
keywords
numericalapproachcomputegeneralorthogonalpolynomialsproblemsriemann--hilbert
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.