Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling

DOI10.1016/j.jco.2015.02.004zbMath1320.65204OpenAlexW2015368696MaRDI QIDQ2349094

Toni Volkmer, Lutz Kämmerer, Daniel Potts

Publication date: 16 June 2015

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2015.02.004

zbMATH Keywords

fast Fourier transformtrigonometric polynomialsTaylor approximationhyperbolic crossapproximation of multivariate functionslattice rule

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for trigonometric approximation and interpolation (65T40)

Related Items (32)

\(s\)-numbers of embeddings of weighted Wiener algebras ⋮ Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions ⋮ Sparse high-dimensional FFT based on rank-1 lattice sampling ⋮ Grouped Transformations and Regularization in High-Dimensional Explainable ANOVA Approximation ⋮ Rhodonea curves as sampling trajectories for spectral interpolation on the unit disk ⋮ Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness ⋮ Rate-optimal sparse approximation of compact break-of-scale embeddings ⋮ Sampling numbers of smoothness classes via \(\ell^1\)-minimization ⋮ Best \(n\)-term approximation of diagonal operators and application to function spaces with mixed smoothness ⋮ A literature survey of matrix methods for data science ⋮ On the reconstruction of functions from values at subsampled quadrature points ⋮ A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals ⋮ Fast component-by-component construction of lattice algorithms for multivariate approximation with POD and SPOD weights ⋮ Notes on \((s,t)\)-weak tractability: a refined classification of problems with (sub)exponential information complexity ⋮ Approximation of High-Dimensional Periodic Functions with Fourier-Based Methods ⋮ Worst-case recovery guarantees for least squares approximation using random samples ⋮ Efficient multivariate approximation on the cube ⋮ A framework for FFT-based homogenization on anisotropic lattices ⋮ High-dimensional sparse Fourier algorithms ⋮ FFT-based homogenization on periodic anisotropic translation invariant spaces ⋮ A fully discrete fast Fourier-Galerkin method solving a boundary integral equation for the biharmonic equation ⋮ Almost periodic functions and their applications: a survey of results and perspectives ⋮ Transformed rank-1 lattices for high-dimensional approximation ⋮ Fast approximation by periodic kernel-based lattice-point interpolation with application in uncertainty quantification ⋮ A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size ⋮ Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables ⋮ Function integration, reconstruction and approximation using rank-$1$ lattices ⋮ Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices ⋮ Fast cross-validation in harmonic approximation ⋮ Lattice algorithms for multivariate approximation in periodic spaces with general weight parameters ⋮ Constructing spatial discretizations for sparse multivariate trigonometric polynomials that allow for a fast discrete Fourier transform ⋮ Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form

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
• Interpolation lattices for hyperbolic cross trigonometric polynomials
• Multidimensional pseudo-spectral methods on lattice grids
• Numerical stability of nonequispaced fast Fourier transforms
• Tractability of multivariate problems. Volume II: Standard information for functionals.
• Fouriertransform on sparse grids with hierarchical bases
• Optimized tensor-product approximation spaces
• A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives
• 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
• Approximation numbers of Sobolev embeddings-sharp constants and tractability
• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• Component-by-component construction of good lattice rules
• Reconstructing Hyperbolic Cross Trigonometric Polynomials by Sampling along Rank-1 Lattices
• Reconstructing Multivariate Trigonometric Polynomials from Samples Along Rank-1 Lattices
• Nonequispaced Hyperbolic Cross Fast Fourier Transform
• Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
• Reconstruction Algorithms in Irregular Sampling
• A Class of Periodic Function Spaces and Interpolation on Sparse Grids
• Nonequispaced fast Fourier transforms without oversampling
• Rapid Computation of the Discrete Fourier Transform
• Fast Discrete Fourier Transform on Generalized Sparse Grids
• Nearly optimal sparse fourier transform
• High-dimensional integration: The quasi-Monte Carlo way

This page was built for publication: Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling