Wavelet frames on Vilenkin groups and their approximation properties
classification
🧮 math.CA
math.GR
keywords
waveletframesapproximationtightfunctionspropertieswalshalgorithm
read the original abstract
An explicit description of all Walsh polynomials generating tight wavelet frames is given. An algorithm for finding the corresponding wavelet functions is suggested, and a general form for all wavelet frames generated by an appropriate Walsh polynomial is described. Approximation properties of tight wavelet frames are also studied. In contrast to the real setting, it appeared that a wavelet tight frame decomposition has an arbitrary large approximation order whenever all wavelet functions are compactly supported.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.