On the fast Fourier transform of functions with singularities

From MaRDI portal
Publication:1907304

DOI10.1006/acha.1995.1026zbMath0838.65142OpenAlexW1997096414MaRDI QIDQ1907304

Gregory Beylkin

Publication date: 20 February 1996

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

Full work available at URL: https://doi.org/10.1006/acha.1995.1026



Related Items

Approximate factorizations of Fourier matrices with nonequispaced knots, Fast algorithms for discrete polynomial transforms on arbitrary grids, An NFFT based approach to the efficient computation of dipole-dipole interactions under various periodic boundary conditions, A COOLEY-TUKEY MODIFIED ALGORITHM IN FAST FOURIER TRANSFORM, Fast convolution with radial kernels at nonequispaced knots, Total Variation-Based Reconstruction and Phase Retrieval for Diffraction Tomography, A geometric nonuniform fast Fourier transform, Approximation properties of the sampling Kantorovich operators: regularization, saturation, inverse results and Favard classes in \(L^p\)-spaces, Automated parameter tuning based on RMS errors for nonequispaced FFTs, Fast and accurate polar Fourier transform, Fast Algorithms and Efficient GPU Implementations for the Radon Transform and the Back-Projection Operator Represented as Convolution Operators, A solution to certain polynomial equations with applications to nonlinear fitting, Non-uniform FFT for the finite element computation of the micromagnetic scalar potential, Unnamed Item, On the computation of the polar FFT, Aliasing error of the \(\exp(\beta\sqrt{1-z^2})\) kernel in the nonuniform fast Fourier transform, NFFT based Ewald summation for electrostatic systems with charges and dipoles, How does two-way coupling modify particle settling and the role of multiscale preferential sweeping?, Direct inversion of the nonequispaced fast Fourier transform, A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees, A new theoretical derivation of NFFT and its implementation on GPU, NFFT.jl: Generic and Fast Julia Implementation of the Nonequidistant Fast Fourier Transform, On the representation of functions with Gaussian wave packets, Fast SGL Fourier transforms for scattered data, Efficient calculations of 3-D FFTs on spiral contours, An extra-component method for evaluating fast matrix-vector multiplication with special functions, Fast spherical Fourier algorithms., Accelerating the calculation of dipolar interactions in particle based simulations with open boundary conditions by means of the P\(^{2}\)NFFT method, Bandlimited implicit Runge-Kutta integration for astrodynamics, Efficient Fourier basis particle simulation, Fast numerical method for the Boltzmann equation on non-uniform grids, The Chebyshev fast Gauss and nonuniform fast Fourier transforms and their application to the evaluation of distributed heat potentials, Exploring the turbulent velocity gradients at different scales from the perspective of the strain-rate eigenframe, On the numerical solution of the heat equation. I: Fast solvers in free space, The Fourier approximation of smooth but non-periodic functions from unevenly spaced data, Fast algorithms for Helmholtz Green's functions, Numerical solutions of the Boltzmann equation: Comparison of different algorithms, Fast Laplace transforms for the exponential Radon transform, The AAAtrig Algorithm for Rational Approximation of Periodic Functions, Numerical stability of nonequispaced fast Fourier transforms, Algorithms for unequally spaced fast Laplace transforms, On approximation of functions by exponential sums, The EPS method: A new method for constructing pseudospectral derivative operators, The fast Gauss transform with complex parameters, Approximation by exponential sums revisited, Convolution-thresholding methods for interface motion, Nonlinear approximation of functions in two dimensions by sums of wave packets, Fast evaluation of trigonometric polynomials from hyperbolic crosses, The type 3 nonuniform FFT and its applications, Fast Gauss transforms with complex parameters using NFFTs, Fast transform from an adaptive multi-wavelet representation to a partial Fourier representation, Fast ewald summation based on NFFT with mixed periodicity, Direct Inversion of the Three-Dimensional Pseudo-polar Fourier Transform, On the approximation of singular source terms in differential equations, Continuous window functions for NFFT, Fast convolution with the free space Helmholtz Green's function, On the choice of an auxiliary function in the \(M/G/\infty\) estimation, Fast Fourier transforms of piecewise polynomials, Fast and accurate propagation of coherent light, Uniform error estimates for nonequispaced fast Fourier transforms, Adaptive integral method with fast Gaussian gridding for solving combined field integral equations, A Parallel Nonuniform Fast Fourier Transform Library Based on an “Exponential of Semicircle" Kernel, Efficient thermal field computation in phase-field models, Efficient algorithms for diffusion-generated motion by mean curvature, A fast algorithm for nonequispaced Fourier transforms on the rotation group, Multiscale fluid–particle thermal interaction in isotropic turbulence, Spectral approximation of the free-space heat kernel, On the implementation of the Dirichlet-to-Neumann radiation condition for iterative solution of the Helmholtz equation, Learning in high-dimensional feature spaces using ANOVA-based fast matrix-vector multiplication, On generalized Gaussian quadratures for exponentials and their applications, Numerical analysis of non-uniform sampling problem, Convolution-generated motion as a link between cellular automata and continuum pattern dynamics, Fourier reconstruction for diffraction tomography of an object rotated into arbitrary orientations, Fourier series approximation of separable models, Fast Directional Computation of High Frequency Boundary Integrals via Local FFTs, Highly effective stable evaluation of bandlimited functions on the sphere