Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
From MaRDI portal
Publication:2655801
Recommendations
- Computational methods for the Fourier analysis of sparse high-dimensional functions
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- Fast sparse nonlinear Fourier expansions of high dimensional functions
- Fast evaluation of trigonometric polynomials from hyperbolic crosses
Cites work
- scientific article; zbMATH DE number 4015366 (Why is no real title available?)
- scientific article; zbMATH DE number 4129404 (Why is no real title available?)
- scientific article; zbMATH DE number 4205063 (Why is no real title available?)
- scientific article; zbMATH DE number 5190601 (Why is no real title available?)
- scientific article; zbMATH DE number 66109 (Why is no real title available?)
- scientific article; zbMATH DE number 3481186 (Why is no real title available?)
- scientific article; zbMATH DE number 1301767 (Why is no real title available?)
- scientific article; zbMATH DE number 1049042 (Why is no real title available?)
- scientific article; zbMATH DE number 783551 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- A Fast Fourier–Galerkin Method for Solving Singular Boundary Integral Equations
- A construction of interpolating wavelets on invariant sets
- A construction of refinable sets for interpolating wavelets
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Efficient quadrature of highly oscillatory integrals using derivatives
- Fast Algorithms for Periodic Spline Wavelets on Sparse Grids
- Fast Algorithms for Spherical Harmonic Expansions
- Fast Boolean approximation methods for solving integral equations in high dimensions
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Fouriertransform on sparse grids with hierarchical bases
- High dimensional polynomial interpolation on sparse grids
- Higher order sparse grid methods for elliptic partial differential equations with variable coefficients
- Hyperbolic cross and the complexity of the approximate solution of Fredholm integral equations of the second kind with differentiable kernels
- Information complexity of multivariate Fredholm integral equations in Sobolev classes
- Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
- On quadrature methods for highly oscillatory integrals and their implementation
- On the numerical quadrature of highly-oscillating integrals I: Fourier transforms
- On the numerical quadrature of highly-oscillating integrals II: Irregular oscillators
- Optimized tensor-product approximation spaces
- Procedures for Computing One- and Two-Dimensional Integrals of Functions with Rapid Irregular Oscillations
- Sparse approximation of singularity functions
- Sparse grids
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
- Two‐Scale Boolean Galerkin Discretizations for Fredholm Integral Equations of the Second Kind
Cited in
(27)- 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 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
- From high oscillation to rapid approximation. III: Multivariate expansions
- Grouped transformations and regularization in high-dimensional explainable ANOVA approximation
- 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
- Fast discrete Fourier transform on generalized sparse grids
- A fast numerical solution for the first kind boundary integral equation for the Helmholtz equation
- A fully discrete high-order fast multiscale Galerkin method for solving boundary integral equations in a domain with corners
- The numerical integration scheme for a fast Petrov-Galerkin method for solving the generalized airfoil equation
- Fast sparse nonlinear Fourier expansions of high dimensional functions
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Fast Fourier-Galerkin methods for nonlinear boundary integral equations
- A fast discrete spectral method for stochastic partial differential 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
- Computational methods for the Fourier analysis of sparse high-dimensional functions
- 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)
