A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals

DOI10.1007/978-3-030-98319-2_13MaRDI QIDQ6154300zbMATH OpenFDO

Authors Robert Nasdala, Daniel Potts

Publication date 14 February 2024

Published in Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2102.00717

zbMATH Keywords

change of variablesfast Fourier transformlattice rule

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: A variety of techniques have been developed for the approximation of non-periodic functions. In particular, there are approximation techniques based on rank-$1$ lattices and transformed rank-$1$ lattices, including methods that use sampling sets consisting of Chebyshev- and tent-transformed nodes. We compare these methods with a parameterized transformed Fourier system that yields similar $el{l}_2$-approximation errors.

Recommendations

• Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
• Nonperiodic trigonometric polynomial approximation
• Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
• The method of odd continuation for Fourier approximations of nonperiodic functions
• Function integration, reconstruction and approximation using rank-\(1\) lattices

Cites work

• Approximation of multivariate periodic functions by trigonometric polynomials based on rank-1 lattice sampling
• Bivariate Lagrange interpolation at the Padua points: the generating curve approach
• Constructing lattice rules based on weighted degree of exactness and worst case error
• Convergence acceleration of modified Fourier series in one or more dimensions
• Efficient multivariate approximation on the cube
• From high oscillation to rapid approximation I: modified Fourier expansions
• From high oscillation to rapid approximation II: expansions in Birkhoff series
• Function integration, reconstruction and approximation using rank-\(1\) lattices
• Integration and approximation in cosine spaces of smooth functions
• Lattice Methods for Multiple Integration: Theory, Error Analysis and Examples
• Lattice rules for nonperiodic smooth integrands
• Lattice rules in non-periodic subspaces of Sobolev spaces
• Multivariate polynomial interpolation on Lissajous-Chebyshev nodes
• Reconstruction and collocation of a class of non-periodic functions by sampling along tent-transformed rank-1 lattices
• Reconstruction of periodic functions of several variables with respect to the values in the nodes of number-theoretic nets
• Spectral methods. Algorithms, analysis and applications.
• Tent-transformed lattice rules for integration and approximation of multivariate non-periodic functions
• Tight error bounds for rank-1 lattice sampling in spaces of hybrid mixed smoothness
• Transformed rank-1 lattices for high-dimensional approximation

Cited in

(1)

• Error guarantees for least squares approximation with noisy samples in domain adaptation

This page was built for publication: A Note on Transformed Fourier Systems for the Approximation of Non-periodic Signals

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