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

DOI10.1016/J.JCO.2015.02.004zbMATH Open1320.65204OpenAlexW2015368696MaRDI QIDQ2349094FDOQ2349094

Authors: Lutz Kämmerer, Daniel Potts, Toni Volkmer 

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

Recommendations

• Approximation of multivariate periodic functions by trigonometric polynomials based on sampling along rank-1 lattice with generating vector of Korobov form
• Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices
• A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size
• Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials
• Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices

zbMATH Keywords

Taylor approximationtrigonometric polynomialsfast Fourier transformhyperbolic crossapproximation of multivariate functionslattice rule

Mathematics Subject Classification ID

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

Cites Work

• Nonequispaced Hyperbolic Cross Fast Fourier Transform
• Title not available (Why is that?)
• Title not available (Why is that?)
• Rapid Computation of the Discrete Fourier Transform
• Nearly optimal sparse Fourier transform
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Component-by-component construction of good lattice rules
• Reconstructing hyperbolic cross trigonometric polynomials by sampling along rank-1 lattices
• Fast discrete Fourier transform on generalized sparse grids
• Title not available (Why is that?)
• On the stability of the hyperbolic cross discrete Fourier transform
• Interpolation lattices for hyperbolic cross trigonometric polynomials
• Multidimensional pseudo-spectral methods on lattice grids
• Approximation numbers of Sobolev embeddings-sharp constants and tractability
• Fast algorithms for component-by-component construction of rank-1 lattice rules in shift-invariant reproducing kernel Hilbert spaces
• High-dimensional integration: The quasi-Monte Carlo way
• Reconstructing multivariate trigonometric polynomials from samples along rank-1 lattices
• Reconstruction Algorithms in Irregular Sampling
• 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?)
• Title not available (Why is that?)
• Fast discrete algorithms for sparse Fourier expansions of high dimensional functions
• Title not available (Why is that?)
• Numerical stability of nonequispaced fast Fourier transforms
• A Class of Periodic Function Spaces and Interpolation on Sparse Grids
• Nonequispaced fast Fourier transforms without oversampling

Cited In (35)

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

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

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