International Mathematics Research Papers · 2006 · 94 citations · 17 references
ComputingComputer ScienceAlgorithmsComputational GeometryTheory Of ComputationApproximation MethodsMatrix ComputationNumerical AnalysisNumerical Methods For Differential EquationsAsymptotic TheoryOrthogonal PolynomialsRiemann - Hilbert ProblemsRiemann-hilbert ProblemsSteepest DescentUniform ConvergenceZeros
We develop a new asymptotic method for the analysis of matrix Riemann-Hilbert problems. Our method is a generalization of the steepest descent method first proposed by Deift and Zhou; however our method systematically handles jump matrices that need not be analytic. The essential technique is to introduce nonanalytic extensions of certain functions appearing in the jump matrix, and to therefore convert the Riemann-Hilbert problem into a δ problem. We use our method to study several asymptotic problems of polynomials orthogonal with respect to a measure given on the unit circle, obtaining new detailed uniform convergence results, and for some classes of nonanalytic weights, complete information about the asymptotic behavior of the individual zeros.
17
Percy Deift, T. Kriecherbauer, K. T-R McLaughlin et al. · Communications on Pure and Applied Mathematics · 1999 · 850 citations