Interpolation lattices for hyperbolic cross trigonometric polynomials
DOI10.1016/j.jco.2011.05.002zbMath1335.65105OpenAlexW1990197703MaRDI QIDQ657653
Stefan Kunis, Lutz Kämmerer, Daniel Potts
Publication date: 10 January 2012
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2011.05.002
sparse gridtrigonometric polynomialsmultivariate numerical integrationhyperbolic cross fast Fourier transforminterpolation lattices
Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical quadrature and cubature formulas (65D32) Numerical methods for trigonometric approximation and interpolation (65T40)
Related Items (11)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the stability of the hyperbolic cross discrete Fourier transform
- From quantum to classical molecular dynamics: Reduced models and numerical analysis.
- Fouriertransform on sparse grids with hierarchical bases
- A table of good lattice points in three dimensions
- Lattice rules of minimal and maximal rank with good figures of merit
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Constructing lattice rules based on weighted degree of exactness and worst case error
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- Parameters for Integrating Periodic Functions of Several Variables
- Lattice Rules by Component Scaling
- A Class of Periodic Function Spaces and Interpolation on Sparse Grids
- Minimal cubature formulae of trigonometric degree
- Sparse grids
This page was built for publication: Interpolation lattices for hyperbolic cross trigonometric polynomials