Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
From MaRDI portal
Publication:2655801
DOI10.1016/J.JCO.2009.10.001zbMATH Open1184.65124OpenAlexW2027590575MaRDI QIDQ2655801FDOQ2655801
Publication date: 26 January 2010
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2009.10.001
fast algorithmnumerical examplesFourier coefficientssparse gridhyperbolic crossSobolev regularitymultivariate functionquadrature schemeoptimal approximation ordermultiscale Lagrange interpolationsparse Fourier expansion
Numerical methods for trigonometric approximation and interpolation (65T40) Fourier series and coefficients in several variables (42B05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sparse grids
- An Algorithm for the Machine Calculation of Complex Fourier Series
- On quadrature methods for highly oscillatory integrals and their implementation
- Efficient quadrature of highly oscillatory integrals using derivatives
- Fouriertransform on sparse grids with hierarchical bases
- Optimized tensor-product approximation spaces
- High dimensional polynomial interpolation on sparse grids
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Two‐Scale Boolean Galerkin Discretizations for Fredholm Integral Equations of the Second Kind
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- On the numerical quadrature of highly-oscillating integrals I: Fourier transforms
- A Fast Fourier–Galerkin Method for Solving Singular Boundary Integral Equations
- Fast Boolean approximation methods for solving integral equations in high dimensions
- On the numerical quadrature of highly-oscillating integrals II: Irregular oscillators
- A construction of interpolating wavelets on invariant sets
- Fast Algorithms for Spherical Harmonic Expansions
- Procedures for Computing One- and Two-Dimensional Integrals of Functions with Rapid Irregular Oscillations
- Fast Algorithms for Periodic Spline Wavelets on Sparse Grids
- Information complexity of multivariate Fredholm integral equations in Sobolev classes
- Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels
- A construction of refinable sets for interpolating wavelets
- Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
- Sparse approximation of singularity functions
- Higher order sparse grid methods for elliptic partial differential equations with variable coefficients
Cited In (25)
- Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
- Computing the Newton potential in the boundary integral equation for the Dirichlet problem of the Poisson equation
- Fast Discrete Fourier Transform on Generalized Sparse Grids
- Fast Fourier-Galerkin methods for first-kind logarithmic-kernel integral equations on open arcs
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform
- Approximation of high-dimensional kernel matrices by multilevel circulant matrices
- Interpolation lattices for hyperbolic cross trigonometric polynomials
- A fully discrete fast Fourier-Galerkin method solving a boundary integral equation for the biharmonic equation
- A fast Fourier-Galerkin method solving a system of integral equations for the biharmonic equation
- Orthogonal polynomial expansions on sparse grids
- B-spline quasi-interpolation on sparse grids
- A fully discrete high-order fast multiscale Galerkin method for solving boundary integral equations in a domain with corners
- A fast numerical solution for the first kind boundary integral equation for the Helmholtz equation
- The numerical integration scheme for a fast Petrov-Galerkin method for solving the generalized airfoil equation
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Fast sparse nonlinear Fourier expansions of high dimensional functions
- A fast discrete spectral method for stochastic partial differential equations
- Fast Fourier-Galerkin methods for nonlinear boundary integral equations
- A fast solver for boundary integral equations of the modified Helmholtz equation
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Sparse Evaluation of Compositions of Functions Using Multiscale Expansions
- A fast solver for the Hilbert-type singular integral equations based on the direct Fourier spectral method
- Fast Fourier-Galerkin methods for solving singular boundary integral equations: Numerical integration and precondition
This page was built for publication: Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2655801)
