2000 character limit reached
A note on transformed Fourier systems for the approximation of non-periodic signals
Published 1 Feb 2021 in math.NA and cs.NA | (2102.00717v3)
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 $\ell_2$-approximation errors.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.