Fast sparse nonlinear Fourier expansions of high dimensional functions
From MaRDI portal
(Redirected from Publication:488526)
Recommendations
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Fast evaluation of trigonometric polynomials from hyperbolic crosses
- Computational methods for the Fourier analysis of sparse high-dimensional functions
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids
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 5359727 (Why is no real title available?)
- scientific article; zbMATH DE number 1049042 (Why is no real title available?)
- A construction of interpolating wavelets on invariant sets
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Fouriertransform on sparse grids with hierarchical bases
- 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
- On the convergence of multiple Fourier series
- Optimized tensor-product approximation spaces
- Strang Splitting for the Time-Dependent Schrödinger Equation on Sparse Grids
Cited in
(3)
This page was built for publication: Fast sparse nonlinear 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 Q488526)