Interpolation lattices for hyperbolic cross trigonometric polynomials
From MaRDI portal
(Redirected from Publication:657653)
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
Cites work
- scientific article; zbMATH DE number 4129404 (Why is no real title available?)
- scientific article; zbMATH DE number 43504 (Why is no real title available?)
- scientific article; zbMATH DE number 66109 (Why is no real title available?)
- scientific article; zbMATH DE number 1340291 (Why is no real title available?)
- scientific article; zbMATH DE number 914714 (Why is no real title available?)
- scientific article; zbMATH DE number 1421285 (Why is no real title available?)
- scientific article; zbMATH DE number 3390213 (Why is no real title available?)
- scientific article; zbMATH DE number 7538019 (Why is no real title available?)
- A Class of Periodic Function Spaces and Interpolation on Sparse Grids
- A table of good lattice points in three dimensions
- Constructing lattice rules based on weighted degree of exactness and worst case error
- 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
- From quantum to classical molecular dynamics: Reduced models and numerical analysis.
- Lattice Rules by Component Scaling
- Lattice rules for multivariate approximation in the worst case setting
- Lattice rules of minimal and maximal rank with good figures of merit
- Minimal cubature formulae of trigonometric degree
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- On the stability of the hyperbolic cross discrete Fourier transform
- Parameters for Integrating Periodic Functions of Several Variables
- Smolyak's algorithm, sampling on sparse grids and Sobolev spaces of dominating mixed smoothness
- Sparse grids
- Using NFFT 3 -- a software library for various nonequispaced fast Fourier transforms
Cited in
(18)- Trigonometric interpolation on lattice grids
- Nonequispaced Hyperbolic Cross Fast Fourier Transform
- On the stability of the hyperbolic cross discrete Fourier transform
- 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 discrete Fourier transform on generalized sparse grids
- 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
- Function integration, reconstruction and approximation using rank-\(1\) lattices
- Reconstructing hyperbolic cross trigonometric polynomials by sampling along rank-1 lattices
- 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
- Optimal truncations for multivariate Fourier and Chebyshev series: mysteries of the hyperbolic cross. I: bivariate case
- On the fundamental conjecture of HDMR: a Fourier analysis approach
- Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
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)
