Trigonometric interpolation on lattice grids

DOI10.1007/S10543-015-0562-0MaRDI QIDQ285296zbMATH OpenOpenAlexWikidataFDO

Authors Tor Sørevik, Morten A. Nome

Publication date 19 May 2016

Published in BIT (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10543-015-0562-0

zbMATH Keywords

numerical examplesgreedy algorithmfast Fourier transformLebesgue constantsparse gridhyperbolic crossintegration latticeLagrange functionslattice gridsmultivariate trigonometric interpolationmultivariate trigonometric polynomials

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Fourier series and coefficients in several variables (42B05) Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Interpolation lattices for hyperbolic cross trigonometric polynomials
• A Class of Periodic Function Spaces and Interpolation on Sparse Grids
• Fast discrete Fourier transform on generalized sparse grids
• Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
• Generalized sparse grid interpolation based on the fast discrete Fourier transform

Cites work

• scientific article; zbMATH DE number 4015366 (Why is no real title available?)
• scientific article; zbMATH DE number 66109 (Why is no real title available?)
• An Introduction to Lattice Rules and their Generator Matrices
• Application of the Smith Normal Form to the Structure of Lattice Rules
• Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
• Auswertung der Normen von Interpolationsoperatoren
• Component-by-component construction of good lattice rules
• Fast discrete Fourier transform on generalized sparse grids
• Four-dimensional lattice rules generated by skew-circulant matrices
• Fourier transform on sparse grids: Code design and the time dependent Schrödinger equation
• Fouriertransform on sparse grids with hierarchical bases
• Interpolation lattices for hyperbolic cross trigonometric polynomials
• Lattice methods for multiple integration
• Lattice rule algorithms for multivariate approximation in the average case setting
• Minimal cubature formulae of trigonometric degree
• Multidimensional pseudo-spectral methods on lattice grids
• On the stability of the hyperbolic cross discrete Fourier transform
• Polyhedral summability of multiple Fourier series (and explicit formulas for Dirichlet kernels on $
• Reconstructing hyperbolic cross trigonometric polynomials by sampling along rank-1 lattices
• Sparse grids

Cited in

(5)

• scientific article; zbMATH DE number 1505872 (Why is no real title available?)
• Generalized sparse grid interpolation based on the fast discrete Fourier transform
• A discrete trigonometric interpolation method
• Recovery of Surfaces and Functions in High Dimensions: Sampling Theory and Links to Neural Networks
• A Lobatto interpolation grid over the triangle

Describes a project that uses

Uses Software

• NHCFFT

This page was built for publication: Trigonometric interpolation on lattice grids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285296)