Construction and implementation of asymptotic expansions for Laguerre-type orthogonal polynomials
Daan Huybrechs, Peter Opsomer

TL;DR
This paper develops a method to efficiently compute high-order asymptotic expansions of Laguerre-type orthogonal polynomials, enhancing their computational utility and applications in areas like quadrature and random matrix theory.
Contribution
It extends Vanlessen's Riemann-Hilbert analysis to systematically compute arbitrary higher-order terms for Laguerre and Laguerre-type polynomials.
Findings
Explicit asymptotic expansions in four complex plane regions
Implementation for efficient computation of polynomials
Potential applications in quadrature and random matrix theory
Abstract
Laguerre and Laguerre-type polynomials are orthogonal polynomials on the interval with respect to a weight function of the form . The classical Laguerre polynomials correspond to . The computation of higher-order terms of the asymptotic expansions of these polynomials for large degree becomes quite complicated, and a full description seems to be lacking in literature. However, this information is implicitly available in the work of Vanlessen, based on a non-linear steepest descent analysis of an associated so-called Riemann--Hilbert problem. We will extend this work and show how to efficiently compute an arbitrary number of higher-order terms in the asymptotic expansions of Laguerre and Laguerre-type polynomials. This effort is similar to the case of Jacobi and Jacobi-type polynomials in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
