2014
DOI: 10.1007/978-3-319-06404-8_3
|View full text |Cite
|
Sign up to set email alerts
|

Multivariate Anisotropic Interpolation on the Torus

Abstract: We investigate the error of periodic interpolation, when sampling a function on an arbitrary pattern on the torus. We generalize the periodic Strang-Fix conditions to an anisotropic setting and provide an upper bound for the error of interpolation. These conditions and the investigation of the error especially take different levels of smoothness along certain directions into account

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 17 publications
0
10
0
Order By: Relevance
“…De la Vallée Poussin means. A special case of M-invariant spaces are the ones defined via de la Vallée Poussin means, following the construction of [5]. We call a function g :…”
Section: Translation Invariant Spaces Of Periodic Functionsmentioning
confidence: 99%
“…De la Vallée Poussin means. A special case of M-invariant spaces are the ones defined via de la Vallée Poussin means, following the construction of [5]. We call a function g :…”
Section: Translation Invariant Spaces Of Periodic Functionsmentioning
confidence: 99%
“…However, their corresponding generating sets G(M T n ) differ. This can be interpreted as choosing different directional sine and cosine functions that can be defined on the same set of points in order to analyze given discrete data or employing the periodicity of c M h (f ) with respect to M T that is implied by (6). This introduces the possibility of anisotropic analysis and interpretation even on a usual pixel grid.…”
Section: A Fast Fourier Transform On Patternsmentioning
confidence: 99%
“…Besides the theory of a discrete Fourier transform (DFT) on abelian groups, also known as generalized Fourier transform [1], the DFT has also been generalized to arbitrary sampling lattices, e.g. in order to derive periodic wavelets [16,6] and a corresponding fast Fourier and fast wavelet transform [2]. The computational complexity on these lattices even stays the same as on the usual rectangular or pixel grid.…”
Section: Introductionmentioning
confidence: 99%
“…The wavelet parts g N 1 ∈ V ψ 1 N 1 and g N 2 ∈ V M k , we obtain an approximation f M k in this space, cf. [4].…”
Section: Lemma 52mentioning
confidence: 99%
“…The scaling spaces obtained in this setting can also be used to construct and characterize anisotropic interpolation operators. Corresponding error estimates and function spaces are discussed in [4].…”
Section: Introductionmentioning
confidence: 99%