Fetching the paper…
Reading the bibliography…
We describe a suite of fast algorithms for evaluating Jacobi polynomials, applying the corresponding discrete Sturm-Liouville eigentransforms and calculating Gauss-Jacobi quadrature rules.
Higher Transcendental Functions
Erdélyi, A., et al · 1953
Earlier work this paper cites.
Higher Transcendental Functions
Erdélyi, A., et al · 1953
Earlier work this paper cites.
Orthogonal Polynomials
Szegö, G · 1959
Earlier work this paper cites.
Asymptotik bei Jacobi-polynomen und Jacobi-funktionen
Hahn, E · 1980
Earlier work this paper cites.
A uniform asymptotic expansion of the Jacobi polynomials with error bounds
Frenzen, C., and Wong, R · 1985
Earlier work this paper cites.
The bounds for the error term of an asymptotic approximation of Jacobi polynomials
Baratella, P., and Gatteschi, L · 1988
Earlier work this paper cites.
A fast algorithm for the evaluation of Legendre expansions
Alpert, B. K., and Rokhlin, V · 1991
Earlier work this paper cites.
Spectral integration and two-point boundary value problems
Greengard, L · 1991
Earlier work this paper cites.
A Treatise on the Theory of Bessel Functions
Watson, G. N · 1995
Earlier work this paper cites.
Asymptotic approximations for the Jacobi and ultraspherical polynomials, and related functions
Dunster, T. M · 1999
Earlier work this paper cites.
Accelerating the nonuniform fast fourier transform
Greengard, L., and Lee, J.-Y · 2004
Earlier work this paper cites.
On the compression of low rank matrices
Cheng, H., Gimbutas, Z., Martinsson, P., and Rokhlin, V · 2005
Earlier work this paper cites.
The design and implementation of FFTW3
Frigo, M., and Johnson, S. G · 2005
Cited alongside, same era.
Fast computation of fourier integral operators
Candès, E., Demanet, L., and Ying, L · 2007
Cited alongside, same era.
A fast algorithm for the calculation of the roots of special functions
Glaser, A., Liu, X., and Rokhlin, V · 2007
Cited alongside, same era.
A fast directional algorithm for high frequency acoustic scattering in two dimensions
Engquist, B., and Ying, L · 2009
Cited alongside, same era.
Computing with expansions in Gegenbauer polynomials
Keiner, J · 2009
Cited alongside, same era.
An algorithm for the rapid evaluation of special function transforms
O’Neil, M., Woolfe, F., and Rokhlin, V · 2010
Cited alongside, same era.
A fast, simple and stable Chebyshev-Legendre transform using an asymptotic formula
Hale, N., and Townsend, A · 2014
Later among the works it cites.
Completely monotone functions: a digest
Merkle, M · 2014
Later among the works it cites.
Butterfly factorization
Li, Y., Yang, H., Martin, E., Ho, K. L., and Ying, L · 2015
Later among the works it cites.
http://dlmf.nist.gov/, Release 1.0.13 of 2016-09-16
NIST Digital Library of Mathematical Functions · 2016
Later among the works it cites.
A fast FFT-based discrete Legendre transform
Hale, N., and Townsend, A · 2016
Later among the works it cites.
On the numerical calculation of the roots of special functions satisfying second order ordinary differential equations
Bremer, J · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
Halko, N., Martinsson, P. G., and Tropp, J. A · 2011
Cited alongside, same era.
O ( 1 ) O(1) computation of Legendre polynomials and Gauss-Legendre nodes and weights for parallel computing
Bogaert, I., Michiels, B., and Fostier, J · 2012
Cited alongside, same era.
Fast and accurate computation of Gauss-Legendre and Gauss-Jacobi quadrature nodes and weights
Hale, N., and Townsend, A · 2013
Cited alongside, same era.
Approximation Theory and Approximation Practice
Trefethen, N · 2013
Cited alongside, same era.
Iteration-free computation of Gauss-Legendre quadrature nodes and weights
Bogaert, I · 2014
Cited alongside, same era.
Chebfun Guide
Driscoll, T. A., Hale, N., and Trefethen, L. N · 2014
Cited alongside, same era.
Interpolative butterfly factorization
Li, Y., and Yang, H · 2017
Later among the works it cites.
On the use of Hahn’s asymptotic formula and stabilized recurrence for a fast, simple and stable Chebyshev-Jacobi transform
Slevinsky, R · 2017
Later among the works it cites.
Multidimensional butterfly factorization
Li, Y., Yang, H., and Ying, L · 2018
Closest in time.
A nonuniform fast Fourier transform based on low rank approximation
Ruiz-Antolin, D., and Townsend, A · 2018
Closest in time.
A unified framework for oscillatory integral transform: When to use NUFFT or butterfly factorization?
Yang, H · 2018
Closest in time.