The Formula steepest descent method and the asymptotic behavior of polynomials orthogonal on the unit circle with fixed and exponentially varying nonanalytic weights

From MaRDI portal
Publication:3428089

DOI10.1155/IMRP/2006/48673zbMATH Open1133.45001arXivmath/0406484OpenAlexW2113018823MaRDI QIDQ3428089FDOQ3428089


Authors: K. T.-R. McLaughlin, Peter D. Miller Edit this on Wikidata


Publication date: 27 March 2007

Published in: International Mathematics Research Papers (Search for Journal in Brave)

Abstract: 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 dbar 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.


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




Recommendations





Cited In (80)





This page was built for publication: The Formula steepest descent method and the asymptotic behavior of polynomials orthogonal on the unit circle with fixed and exponentially varying nonanalytic weights

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