Interpolation lattices for hyperbolic cross trigonometric polynomials
DOI10.1016/J.JCO.2011.05.002zbMATH Open1335.65105OpenAlexW1990197703MaRDI QIDQ657653FDOQ657653
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
Recommendations
- Fast evaluation of trigonometric polynomials from hyperbolic crosses
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- On the stability of the hyperbolic cross discrete Fourier transform
- Reconstructing hyperbolic cross trigonometric polynomials by sampling along rank-1 lattices
- Fast discrete Fourier transform on generalized sparse grids
trigonometric polynomialssparse gridmultivariate numerical integrationhyperbolic cross fast Fourier transforminterpolation lattices
Numerical quadrature and cubature formulas (65D32) Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15) Numerical methods for discrete and fast Fourier transforms (65T50)
Cites Work
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
- Sparse grids
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fouriertransform on sparse grids with hierarchical bases
- Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
- Minimal cubature formulae of trigonometric degree
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the stability of the hyperbolic cross discrete Fourier transform
- From quantum to classical molecular dynamics: Reduced models and numerical analysis.
- Title not available (Why is that?)
- Constructing lattice rules based on weighted degree of exactness and worst case error
- Title not available (Why is that?)
- Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
- Title not available (Why is that?)
- Parameters for Integrating Periodic Functions of Several Variables
- Title not available (Why is that?)
- A Class of Periodic Function Spaces and Interpolation on Sparse Grids
- Title not available (Why is that?)
- Title not available (Why is that?)
- A table of good lattice points in three dimensions
- Lattice rules of minimal and maximal rank with good figures of merit
- Lattice Rules by Component Scaling
Cited In (15)
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- Trigonometric interpolation on lattice grids
- Fast Discrete Fourier Transform on Generalized Sparse Grids
- Function integration, reconstruction and approximation using rank-$1$ lattices
- On computing high-dimensional Riemann theta functions
- Fouriertransform on sparse grids with hierarchical bases
- Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
- Rhodonea curves as sampling trajectories for spectral interpolation on the unit disk
- Fast evaluation of trigonometric polynomials from hyperbolic crosses
- Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
- Construction of interlaced polynomial lattice rules for infinitely differentiable functions
- Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
- Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
- On the fundamental conjecture of HDMR: a Fourier analysis approach
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
Uses Software
This page was built for publication: Interpolation lattices for hyperbolic cross trigonometric polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657653)
