An algorithm for the rapid evaluation of special function transforms
From MaRDI portal
Recommendations
Cites work
- A Fourier Bessel transform method for efficiently calculating the magnetic field of solenoids
- Computation of the Hankel transform using projections
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Fast Algorithms for Spherical Harmonic Expansions
- Fast algorithms for spherical harmonic expansions. II.
- Fast Fourier Transforms for Nonequispaced Data
- Fast Fourier transforms for nonequispaced data. II
- Generalized discrete spherical harmonic transforms
- scientific article; zbMATH DE number 1966263 (Why is no real title available?)
- scientific article; zbMATH DE number 1528193 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3367521 (Why is no real title available?)
- Mathematical methods in image reconstruction
- On interpolation and integration in finite-dimensional spaces of bounded functions
- On the Compression of Low Rank Matrices
- Prolate Spheroidal Wave Functions, Fourier Analysis and Uncertainty-III: The Dimension of the Space of Essentially Time- and Band-Limited Signals
- Recurrence relations and fast algorithms
Cited in
(46)- Recurrence relations and fast algorithms
- An analysis of a butterfly algorithm
- On the efficient representation of the half-space impedance Green's function for the Helmholtz equation
- Multidimensional butterfly factorization
- The partial fast Fourier transform
- A pedestrian introduction to fast multipole methods
- 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
- Fast Fourier transforms of piecewise polynomials
- Fast and backward stable transforms between spherical harmonic expansions and bivariate Fourier series
- An algorithm for the rapid numerical evaluation of Bessel functions of real orders and arguments
- Fast algorithms for the multi-dimensional Jacobi polynomial transform
- An extra-component method for evaluating fast matrix-vector multiplication with special functions
- Fast wave computation via Fourier integral operators
- A Fast Analysis-Based Discrete Hankel Transform Using Asymptotic Expansions
- Increasing horizontal resolution in numerical weather prediction and climate simulations: illusion or panacea?
- scientific article; zbMATH DE number 3900112 (Why is no real title available?)
- scientific article; zbMATH DE number 4007552 (Why is no real title available?)
- scientific article; zbMATH DE number 4100583 (Why is no real title available?)
- An algorithm for fast Hilbert transform of real functions
- Sparse approximate multifrontal factorization with butterfly compression for high-frequency wave equations
- How exponentially ill-conditioned are contiguous submatrices of the Fourier matrix?
- Wide-band butterfly network: stable and efficient inversion via multi-frequency neural networks
- Interpolative Decomposition 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
- A multiscale butterfly algorithm for multidimensional Fourier integral operators
- Butterfly factorization
- Computing with functions in spherical and polar geometries. II: The disk
- Interpolative butterfly factorization
- Butterfly factorization via randomized matrix-vector multiplications
- Efficient Identification of Butterfly Sparse Matrix Factorizations
- Fast Expansion into Harmonics on the Disk: A Steerable Basis with Fast Radial Convolutions
- A Fast Butterfly-Compressed Hadamard–Babich Integrator for High-Frequency Helmholtz Equations in Inhomogeneous Media with Arbitrary Sources
- Fast adaptive Fourier integration for spectral densities of Gaussian processes
- Butterfly factorization with error guarantees
- Distributed-memory \(\mathcal{H}\)-matrix algebra. I: Data distribution and matrix-vector multiplication
- A linear-complexity tensor butterfly algorithm for compressing high-dimensional oscillatory integral operators
- A dual-space multilevel kernel-splitting framework for discrete and continuous convolution
- A nonuniform fast Hankel transform
- A recursive butterfly factorization with optimality guarantees
- The method of polarized traces for the 2D Helmholtz equation
- Multidimensional phase recovery and interpolative decomposition butterfly factorization
- A fast and accurate algorithm for spherical harmonic analysis on HEALPix grids with applications to the cosmic microwave background radiation
- Fast algorithms for spherical harmonic expansions. III
This page was built for publication: An algorithm for the rapid evaluation of special function transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2268059)
