Pages that link to "Item:Q1203427"
From MaRDI portal
The following pages link to Fouriertransform on sparse grids with hierarchical bases (Q1203427):
Displaying 26 items.
- Trigonometric interpolation on lattice grids (Q285296) (← links)
- Sparse high-dimensional FFT based on rank-1 lattice sampling (Q326763) (← links)
- Orthogonal polynomial expansions on sparse grids (Q457562) (← links)
- Fast sparse nonlinear Fourier expansions of high dimensional functions (Q488526) (← links)
- On the stability of the hyperbolic cross discrete Fourier transform (Q629898) (← links)
- Interpolation lattices for hyperbolic cross trigonometric polynomials (Q657653) (← links)
- Speeding up the flash calculations in two-phase compositional flow simulations - the application of sparse grids (Q729051) (← links)
- Multidimensional pseudo-spectral methods on lattice grids (Q765263) (← links)
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials (Q1704862) (← links)
- Fourier pseudospectral method on generalized sparse grids for the space-fractional Schrödinger equation (Q2001333) (← links)
- Generalized sparse grid interpolation based on the fast discrete Fourier transform (Q2091290) (← links)
- Efficiently transforming from values of a function on a sparse grid to basis coefficients (Q2091301) (← links)
- An ultra-fast smoothing algorithm for time-frequency transforms based on Gabor functions (Q2252184) (← links)
- Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform (Q2330933) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form (Q2347961) (← links)
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling (Q2349094) (← links)
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation (Q2369947) (← links)
- Fast evaluation of trigonometric polynomials from hyperbolic crosses (Q2498993) (← links)
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions (Q2655801) (← links)
- Sparse grid approximation in weighted Wiener spaces (Q2686579) (← links)
- Sparse Grids for the Vlasov–Poisson Equation (Q2808023) (← links)
- Fast computation of the multidimensional discrete Fourier transform and discrete backward Fourier transform on sparse grids (Q3189425) (← links)
- Fourier spectral method on sparse grids for computing ground state of many-particle fractional Schrödinger equations (Q5031321) (← links)
- A Method for Dimensionally Adaptive Sparse Trigonometric Interpolation of Periodic Functions (Q5132042) (← links)
- Fast Discrete Fourier Transform on Generalized Sparse Grids (Q5254892) (← links)
- On computing high-dimensional Riemann theta functions (Q6163181) (← links)
