Fast algorithms for Jacobi expansions via nonoscillatory phase functions
Keyword(s):
Abstract We describe a suite of fast algorithms for evaluating Jacobi polynomials, applying the corresponding discrete Sturm–Liouville eigentransforms and calculating Gauss–Jacobi quadrature rules. Our approach, which applies in the case in which both of the parameters $\alpha $ and $\beta $ in Jacobi’s differential equation are of magnitude less than $1/2$, is based on the well-known fact that in this regime Jacobi’s differential equation admits a nonoscillatory phase function that can be loosely approximated via an affine function over much of its domain. We illustrate this with several numerical experiments, the source code for which is publicly available.
2015 ◽
Vol 2015
◽
pp. 1-9
◽
1973 ◽
Vol 10
(1)
◽
pp. 55-68
◽
1970 ◽
Vol 29
(3)
◽
pp. 467-497
◽
Keyword(s):
2019 ◽
Vol 16
(09)
◽
pp. 1950140
◽
2008 ◽
Vol 45
(2)
◽
pp. 347-362
◽