Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
From MaRDI portal
Publication:3189425
DOI10.1090/S0025-5718-2014-02785-3zbMath1312.65233MaRDI QIDQ3189425
Publication date: 10 September 2014
Published in: Mathematics of Computation (Search for Journal in Brave)
numerical examplefast algorithmsmultidimensional discrete Fourier transformmultidimensional backward discrete Fourier transform
Related Items
A fast discrete spectral method for stochastic partial differential equations ⋮ Computing the Newton potential in the boundary integral equation for the Dirichlet problem of the Poisson equation ⋮ A fully discrete fast Fourier-Galerkin method solving a boundary integral equation for the biharmonic equation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- B-spline quasi-interpolation on sparse grids
- Fast matrix-vector multiplication in the sparse-grid Galerkin method
- Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels
- Fast Fourier-Galerkin methods for solving singular boundary integral equations: Numerical integration and precondition
- Fouriertransform on sparse grids with hierarchical bases
- A multigrid algorithm for higher order finite elements on sparse grids
- Multivariate trigonometric polynomial approximations with frequencies from the hyperbolic cross
- Information complexity of multivariate Fredholm integral equations in Sobolev classes
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Fast Fourier-Galerkin methods for first-kind logarithmic-kernel integral equations on open arcs
- Fast Boolean approximation methods for solving integral equations in high dimensions
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Optimized general sparse grid approximation spaces for operator equations
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- A Fast Fourier–Galerkin Method for Solving Singular Boundary Integral Equations
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- Fast Algorithms for Periodic Spline Wavelets on Sparse Grids
- A construction of interpolating wavelets on invariant sets
- The Solution of Multidimensional Real Helmholtz Equations on Sparse Grids
- Efficient Spectral Sparse Grid Methods and Applications to High-Dimensional Elliptic Problems
- An Algorithm for the Machine Calculation of Complex Fourier Series