A note on transformed Fourier systems for the approximation of non-periodic signals

02/01/2021
by   Robert Nasdala, et al.
0

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 ℓ_2-approximation errors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2019

Efficient multivariate approximation on the cube

For the approximation of multivariate non-periodic functions h on the hi...
research
01/03/2023

Notes on Correspondence Analysis of Power Transformed Data Sets

We prospect for a clear simple picture on CA of power transformed or the...
research
08/03/2019

Function integration, reconstruction and approximation using rank-1 lattices

We consider rank-1 lattices for integration and reconstruction of functi...
research
10/14/2021

Interpretable transformed ANOVA approximation on the example of the prevention of forest fires

The distribution of data points is a key component in machine learning. ...
research
03/22/2022

Bringing Linearly Transformed Cosines to Anisotropic GGX

Linearly Transformed Cosines (LTCs) are a family of distributions that a...
research
10/24/2021

Conditional Generation of Periodic Signals with Fourier-Based Decoder

Periodic signals play an important role in daily lives. Although convent...
research
01/12/2021

Statistical analysis of periodic data in neuroscience

Many experimental paradigms in neuroscience involve driving the nervous ...

Please sign up or login with your details

Forgot password? Click here to reset