An algorithm for the rapid evaluation of special function transforms

DOI10.1016/j.acha.2009.08.005zbMath1191.65016OpenAlexW2087995885MaRDI QIDQ2268059

Michael O'Neil, Franco Woolfe, Vladimir Rokhlin

Publication date: 10 March 2010

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2009.08.005

zbMATH Keywords

algorithm orthogonal polynomials numerical examples fast algorithms special functions Fourier-Bessel transform matrix fast transform Fourier-Bessel non-equispaced Fourier transform

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20)

Related Items

Efficient Identification of Butterfly Sparse Matrix Factorizations ⋮ Fast wave computation via Fourier integral operators ⋮ Wide-Band Butterfly Network: Stable and Efficient Inversion Via Multi-Frequency Neural Networks ⋮ An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments ⋮ An analysis of a butterfly algorithm ⋮ Fast algorithms for the multi-dimensional Jacobi polynomial transform ⋮ A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions ⋮ Fast Expansion into Harmonics on the Disk: A Steerable Basis with Fast Radial Convolutions ⋮ A pedestrian introduction to fast multipole methods ⋮ Increasing horizontal resolution in numerical weather prediction and climate simulations: illusion or panacea? ⋮ A Fast Butterfly-Compressed Hadamard–Babich Integrator for High-Frequency Helmholtz Equations in Inhomogeneous Media with Arbitrary Sources ⋮ Interpolative Decomposition Butterfly Factorization ⋮ An extra-component method for evaluating fast matrix-vector multiplication with special functions ⋮ A unified framework for oscillatory integral transforms: when to use NUFFT or butterfly factorization? ⋮ A hierarchical butterfly LU preconditioner for two-dimensional electromagnetic scattering problems involving open surfaces ⋮ On the efficient representation of the half-space impedance Green's function for the Helmholtz equation ⋮ Multidimensional butterfly factorization ⋮ Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations ⋮ Butterfly-Net: Optimal Function Representation Based on Convolutional Neural Networks ⋮ Rapid Application of the Spherical Harmonic Transform via Interpolative Decomposition Butterfly Factorization ⋮ Interpolative Butterfly Factorization ⋮ The partial fast Fourier transform ⋮ Fast algorithms for spherical harmonic expansions. III ⋮ The method of polarized traces for the 2D Helmholtz equation ⋮ Fast Fourier transforms of piecewise polynomials ⋮ Multidimensional phase recovery and interpolative decomposition butterfly factorization ⋮ Sparse Approximate Multifrontal Factorization with Butterfly Compression for High-Frequency Wave Equations ⋮ A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation ⋮ Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series ⋮ Butterfly Factorization Via Randomized Matrix-Vector Multiplications ⋮ A Multiscale Butterfly Algorithm for Multidimensional Fourier Integral Operators ⋮ Butterfly Factorization ⋮ How Exponentially Ill-Conditioned Are Contiguous Submatrices of the Fourier Matrix? ⋮ Computing with Functions in Spherical and Polar Geometries II. The Disk

Cites Work