Construction and implementation of asymptotic expansions for Jacobi-type orthogonal polynomials

DOI10.1007/S10444-015-9442-ZzbMATH Open1347.33021arXiv1502.07191OpenAlexW2135858531MaRDI QIDQ314451FDOQ314451

Alfredo Deaño, Daan Huybrechs, Peter Opsomer

Publication date: 16 September 2016

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

Abstract: We are interested in the asymptotic behavior of orthogonal polynomials of the generalized Jacobi type as their degree $n$ goes to $infty$. These are defined on the interval $[-1,1]$ with weight function $$, $$ and $h(x)$ a real, analytic and strictly positive function on $[-1,1]$. This information is available in the work of Kuijlaars, McLaughlin, Van Assche and Vanlessen, where the authors use the Riemann--Hilbert formulation and the Deift--Zhou non-linear steepest descent method. We show that computing higher-order terms can be simplified, leading to their efficient construction. The resulting asymptotic expansions in every region of the complex plane are implemented both symbolically and numerically, and the code is made publicly available. The main advantage of these expansions is that they lead to increasing accuracy for increasing degree of the polynomials, at a computational cost that is actually independent of the degree. In contrast, the typical use of the recurrence relation for orthogonal polynomials in computations leads to a cost that is at least linear in the degree. Furthermore, the expansions may be used to compute Gaussian quadrature rules in $mathcalO(n)$ operations, rather than $mathcalO(n^2)$ based on the recurrence relation.

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

Recommendations

• Asymptotic expansions of Jacobi polynomials and of the nodes and weights of Gauss-Jacobi quadrature for large degree and parameters in terms of elementary functions
• Construction and implementation of asymptotic expansions for Laguerre-type orthogonal polynomials
• Asymptotic computation of classical orthogonal polynomials
• Noniterative computation of Gauss-Jacobi quadrature
• Strong asymptotics of the recurrence coefficients of orthogonal polynomials associated to the generalized Jacobi weight.

zbMATH Keywords

asymptotic analysisRiemann-Hilbert problemsJacobi polynomialsnumerical software

Mathematics Subject Classification ID

Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Algorithms for approximation of functions (65D15) Real polynomials: analytic properties, etc. (26C05) Approximation in the complex plane (30E10)

Cites Work

• Title not available (Why is that?)
• A steepest descent method for oscillatory Riemann-Hilbert problems
• The isomonodromy approach to matrix models in 2D quantum gravity
• The Riemann--Hilbert approach to strong asymptotics for orthogonal polynomials on [-1,1]
• Strong asymptotics for Jacobi polynomials with varying nonstandard parameters
• Orthogonal polynomials and random matrices: a Riemann-Hilbert approach.
• Decision procedure for indefinite hypergeometric summation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Orthogonality of Jacobi polynomials with general parameters
• A fast and well-conditioned spectral method
• \(\mathcal{O}(1)\) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
• A Fast Algorithm for the Calculation of the Roots of Special Functions
• Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
• The Exponentially Convergent Trapezoidal Rule
• Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals
• Asymptotics of orthogonal polynomials for a weight with a jump on \([-1,1]\)
• On Zeilberger's algorithm and its \(q\)-analogue
• A Riemann-Hilbert approach to Jacobi operators and Gaussian quadrature
• Fast computation of Gauss quadrature nodes and weights on the whole real line
• Iteration-free computation of Gauss-Legendre quadrature nodes and weights
• On the Fourier Extension of Nonperiodic Functions
• A general framework for solving Riemann-Hilbert problems numerically
• Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials
• A Fast, Simple, and Stable Chebyshev--Legendre Transform Using an Asymptotic Formula
• Nonlinear Steepest Descent and Numerical Solution of Riemann‐Hilbert Problems
• Painlevé V and time-dependent Jacobi polynomials
• Robust reprojection methods for the resolution of the Gibbs phenomenon
• On a conjecture of A. Magnus concerning the asymptotic behavior of the recurrence coefficients of the generalized Jacobi polynomials

Cited In (5)

• Asymptotic computation of classical orthogonal polynomials
• Jacobi polynomials on the Bernstein ellipse
• High-order asymptotic expansions of Gaussian quadrature rules with classical and generalized weight functions
• On a conjecture of A. Magnus concerning the asymptotic behavior of the recurrence coefficients of the generalized Jacobi polynomials
• Fast, reliable and unrestricted iterative computation of Gauss-Hermite and Gauss-Laguerre quadratures

Uses Software

• Digital Library of Mathematical Functions
• OPQ
• FastGaussQuadrature

This page was built for publication: Construction and implementation of asymptotic expansions for Jacobi-type orthogonal polynomials

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