On sufficient frame conditions for periodic wavelet systems

Author(s):  
Pavel Andrianov

Sufficient frame conditions for periodic dual wavelet are established. These conditions are given in terms of the Fourier coefficients. A way of constructing dual wavelet Riesz bases starting with trigonometric polynomials is provided.

2021 ◽  
Vol 19 (1) ◽  
pp. 1047-1055
Author(s):  
Zhihua Zhang

Abstract Fourier approximation plays a key role in qualitative theory of deterministic and random differential equations. In this paper, we will develop a new approximation tool. For an m m -order differentiable function f f on [ 0 , 1 0,1 ], we will construct an m m -degree algebraic polynomial P m {P}_{m} depending on values of f f and its derivatives at ends of [ 0 , 1 0,1 ] such that the Fourier coefficients of R m = f − P m {R}_{m}=f-{P}_{m} decay fast. Since the partial sum of Fourier series R m {R}_{m} is a trigonometric polynomial, we can reconstruct the function f f well by the combination of a polynomial and a trigonometric polynomial. Moreover, we will extend these results to the case of random processes.


2021 ◽  
Vol 13 (1) ◽  
pp. 68-80
Author(s):  
A.S. Serdyuk ◽  
U.Z. Hrabova

The Zygmund sums of a function $f\in L_{1}$ are trigonometric polynomials of the form $$Z^{s}_{n-1}(f;t):=\frac{a_{0}}{2}+\sum_{k=1}^{n-1}\Big(1-\big(\frac{k}{n}\big)^{s}\Big) \big(a_{k}(f)\cos kt+b_{k}(f)\sin kt\big), s>0,$$ where $a_{k}(f)$ and $b_{k}(f)$ are the Fourier coefficients of $f$. We establish the exact-order estimates of uniform approximations by the Zygmund sums $Z^{s}_{n-1}$ of $2\pi$-periodic continuous functions from the classes $C^{\psi}_{\beta,p}$. These classes are defined by the convolutions of functions from the unit ball in the space $L_{p}$, $1\leq p<\infty$, with generating fixed kernels $$\Psi_{\beta}(t)\sim\sum_{k=1}^{\infty}\psi(k)\cos\left(kt+\frac{\beta\pi}{2}\right), \Psi_{\beta}\in L_{p'}, \beta\in \mathbb{R}, \frac1p+\frac{1}{p'}=1.$$ We additionally assume that the product $\psi(k)k^{s+1/p}$ is generally monotonically increasing with the rate of some power function, and, besides, for $1< p<\infty$ it holds that $\sum_{k=n}^{\infty}\psi^{p'}(k)k^{p'-2}<\infty$, and for $p=1$ the following condition $\sum_{k=n}^{\infty}\psi(k)<\infty$ is true. It is shown, that under these conditions Zygmund sums $Z^{s}_{n-1}$ and Fejér sums $\sigma_{n-1}=Z^{1}_{n-1}$ realize the order of the best uniform approximations by trigonometric polynomials of these classes, namely for $1<p<\infty$ $${E}_{n}(C^{\psi}_{\beta,p})_{C}\asymp{\cal E}\left(C^{\psi}_{\beta,p}; Z_{n-1}^{s}\right)_{C}\asymp\Big(\sum_{k=n}^{\infty}\psi^{p'}(k)k^{p'-2}\Big)^{1/p'}, \ \frac{1}{p}+\frac{1}{p'}=1,$$ and for $p=1$ $$ {E}_{n}(C^{\psi}_{\beta,1})_{C}\asymp{\cal E}\left(C^{\psi}_{\beta,1}; Z_{n-1}^{s}\right)_{C}\asymp {\left\{{\begin{array}{l l} \sum\limits_{k=n}^{\infty}\psi(k), & \cos \frac{\beta\pi}{2}\neq 0,\\ \psi(n)n, &\cos \frac{\beta\pi}{2}= 0, \end{array}} \right.} $$ where $${E}_{n}(C^{\psi}_{\beta,p})_{C}:=\sup_{f\in C^{\psi}_{\beta,p}}\inf\limits_{t_{n-1}\in\mathcal{T}_{2n-1}}\|f(\cdot)-t_{n-1}(\cdot)\|_{C}, $$ and $\mathcal{T}_{2n-1}$ is the subspace of trigonometric polynomials $t_{n-1}$ of order $n-1$ with real coefficients, $${\cal E}\left(C^{\psi}_{\beta,p}; Z_{n-1}^{s}\right)_{C}:=\mathop{\sup}\limits_{f\in C^{\psi}_{\beta,p}}\|f(\cdot)-Z^{s}_{n-1}(f;\cdot)\|_{C}.$$


Author(s):  
Irina A. Vysotskaya ◽  
◽  
Irina I. Strukova ◽  

The article under consideration is devoted to continuous almost periodic at infinity functions defined on the whole real axis and with their values in a complex Banach space. We consider different subspaces of functions vanishing at infinity, not necessarily tending to zero at infinity. We introduce the notions of slowly varying and almost periodic at infinity functions with respect to these subspaces. For almost periodic at infinity functions (with respect to a subspace) we give four different definitions. The first definition (approximating) is based on the approximation theorem. In the classical version, for almost periodic functions, they are represented as uniform closures of trigonometric polynomials. In our case, the Fourier coefficients are slowly varying at infinity functions. The second definition, which is an analogue of G. Bohr’s definition of an almost periodic function, is based on the concept of an ε-period. The third definition meets S. Bochner’s criterion for the almost periodicity of functions. The fourth definition is given in terms of factor space. With the help of the results of the theory of almost periodic vectors in Banach modules those four definitions are proved to be equivalent. In addition, it was proved that the introduced spaces of slowly varying and almost periodic at infinity functions with respect to different subspaces of functions vanishing at infinity coincide with the spaces of ordinary slowly varying and almost periodic at infinity functions, respectively. The feasibility of consideration of these functions is due to the fact that the solutions of some important classes of differential and difference equations are almost periodic at infinity. We consider differential equations whose right-hand side is a function vanishing at infinity and obtain necessary and sufficient conditions for their bounded solutions to be almost periodic at infinity functions. We also study an asymptotic representation of the solutions.


1981 ◽  
Vol 35 (2) ◽  
pp. 210-214 ◽  
Author(s):  
F. G. Giesbrecht ◽  
W. F. McClure ◽  
Abdul Hamid

A Fourier analysis of the spectra consisting of 1000 to 2000 reflectance values obtained by scanning agricultural products at specific, equally spaced wavelengths is used to reduce the amount of data that needs to be recorded. It is shown that as few as 50 pairs of coefficients retain the bulk of the information contained in the complete spectrum. Using the limited number of Fourier coefficients is equivalent to rejecting the high frequency noise without spectral distortion and loss of data points at the ends of the spectra.


2017 ◽  
Vol 2017 ◽  
pp. 1-11
Author(s):  
Nimete Sh. Berisha ◽  
Faton M. Berisha ◽  
Mikhail K. Potapov ◽  
Marjan Dema

In this paper, we give a characterization of Nikol’skiĭ-Besov type classes of functions, given by integral representations of moduli of smoothness, in terms of series over the moduli of smoothness. Also, necessary and sufficient conditions in terms of monotone or lacunary Fourier coefficients for a function to belong to such a class are given. In order to prove our results, we make use of certain recent reverse Copson-type and Leindler-type inequalities.


2017 ◽  
Vol 13 (4) ◽  
pp. 106-116
Author(s):  
Alaa A. Auad ◽  
◽  
Mousa M. Khrajan

2008 ◽  
Vol 8 (2) ◽  
pp. 143-154 ◽  
Author(s):  
P. KARCZMAREK

AbstractIn this paper, Jacobi and trigonometric polynomials are used to con-struct the approximate solution of a singular integral equation with multiplicative Cauchy kernel in the half-plane.


Author(s):  
Jingwen Wang ◽  
Xu Wang ◽  
Dan Yang ◽  
Kaiyang Wang

Background: Image reconstruction of magnetic induction tomography (MIT) is a typical ill-posed inverse problem, which means that the measurements are always far from enough. Thus, MIT image reconstruction results using conventional algorithms such as linear back projection and Landweber often suffer from limitations such as low resolution and blurred edges. Methods: In this paper, based on the recent finite rate of innovation (FRI) framework, a novel image reconstruction method with MIT system is presented. Results: This is achieved through modeling and sampling the MIT signals in FRI framework, resulting in a few new measurements, namely, fourier coefficients. Because each new measurement contains all the pixel position and conductivity information of the dense phase medium, the illposed inverse problem can be improved, by rebuilding the MIT measurement equation with the measurement voltage and the new measurements. Finally, a sparsity-based signal reconstruction algorithm is presented to reconstruct the original MIT image signal, by solving this new measurement equation. Conclusion: Experiments show that the proposed method has better indicators such as image error and correlation coefficient. Therefore, it is a kind of MIT image reconstruction method with high accuracy.


Sign in / Sign up

Export Citation Format

Share Document