Deaño, Alfredo, Huybrechs, Daan, Opsomer, Peter (2016) Construction and implementation of asymptotic expansions for Jacobitype orthogonal polynomials. Advances in Computational Mathematics, 42 . pp. 791822. ISSN 10197168. EISSN 15729044. (doi:10.1007/s104440159442z) (KAR id:51339)
PDF
Author's Accepted Manuscript
Language: English 

Download (433kB)
Preview

Preview 
This file may not be suitable for users of assistive technology.
Request an accessible format


Official URL http://www.dx.doi.org/10.1007/s104440159442z 
Abstract
We are interested in the asymptotic behavior of orthogonal polynomials of the generalized Jacobi type as their degree n goes to ∞. These are defined on the interval [−1, 1] with weight function: w(x)=(1−x)α(1+x)βh(x),α,β>−1 and h(x) a real, analytic and strictly positive function on [−1, 1]. This information is available in the work of Kuijlaars et al. (Adv. Math. 188, 337–398 2004), where the authors use the Riemann–Hilbert formulation and the Deift–Zhou nonlinear steepest descent method. We show that computing higherorder 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 O(n) operations, rather than O(n2) based on the recurrence relation.
Item Type:  Article 

DOI/Identification number:  10.1007/s104440159442z 
Projects:  Projects 0 not found. Projects 0 not found. Projects 0 not found. 
Additional information:  Full text upload complies with journal requirements 
Uncontrolled keywords:  Asymptotic analysis; Jacobi polynomials; Riemann–Hilbert problems; Numerical software 
Subjects: 
Q Science > QA Mathematics (inc Computing science) > QA297 Numerical analysis Q Science > QA Mathematics (inc Computing science) > QA299 Analysis, Calculus Q Science > QA Mathematics (inc Computing science) > QA351 Special functions 
Divisions:  Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Mathematics, Statistics and Actuarial Science 
Depositing User:  Alfredo Deano Cabrera 
Date Deposited:  02 Nov 2015 11:12 UTC 
Last Modified:  16 Feb 2021 13:29 UTC 
Resource URI:  https://kar.kent.ac.uk/id/eprint/51339 (The current URI for this page, for reference purposes) 
Deaño, Alfredo:  https://orcid.org/000000031704247X 
 Export to:
 RefWorks
 EPrints3 XML
 BibTeX
 CSV
 Depositors only (login required):