Construction and implementation of asymptotic expansions for Jacobi-type orthogonal polynomials
DOI10.1007/s10444-015-9442-zzbMath1347.33021arXiv1502.07191OpenAlexW2135858531MaRDI QIDQ314451
Alfredo Deaño, Daan Huybrechs, Peter Opsomer
Publication date: 16 September 2016
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.07191
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Approximation in the complex plane (30E10) Algorithms for approximation of functions (65D15) Real polynomials: analytic properties, etc. (26C05)
Related Items (4)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general framework for solving Riemann-Hilbert problems numerically
- Numerical solution of Riemann-Hilbert problems: random matrix theory and orthogonal polynomials
- 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\)]
- 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
- The isomonodromy approach to matrix models in 2D quantum gravity
- On Zeilberger's algorithm and its \(q\)-analogue
- The Riemann--Hilbert approach to strong asymptotics for orthogonal polynomials on [-1,1]
- Orthogonality of Jacobi polynomials with general parameters
- Strong asymptotics for Jacobi polynomials with varying nonstandard parameters
- A Riemann–Hilbert approach to Jacobi operators and Gaussian quadrature
- Fast computation of Gauss quadrature nodes and weights on the whole real line
- A Fast and Well-Conditioned Spectral Method
- Iteration-Free Computation of Gauss--Legendre Quadrature Nodes and Weights
- $\mathcal{O}(1)$ Computation of Legendre Polynomials and Gauss--Legendre Nodes and Weights for Parallel Computing
- The Exponentially Convergent Trapezoidal Rule
- On the Fourier Extension of Nonperiodic Functions
- A Fast Algorithm for the Calculation of the Roots of Special Functions
- A steepest descent method for oscillatory Riemann-Hilbert problems
- Decision procedure for indefinite hypergeometric summation
- Fast and Accurate Computation of Gauss--Legendre and Gauss--Jacobi Quadrature Nodes and Weights
- 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
This page was built for publication: Construction and implementation of asymptotic expansions for Jacobi-type orthogonal polynomials