comparison of wavelet approximation order in different.pdfVIP

COMPARISON OF WAVELET APPROXIMATION ORDER IN DIFFERENT SMOOTHNESS SPACES M. R. ISLAM, S. F. AHEMMED, AND S. M. A. RAHMAN Received 20 April 2005; Revised 3 April 2006; Accepted 25 April 2006 In linear approximation by wavelet, we approximate a given function by a finite term from the wavelet series. The approximation order is improved if the order of smoothness of the given function is improved, discussed by Cohen (2003), DeVore (1998), and Siddiqi (2004). But in the case of nonlinear approximation, the approximation order is improved quicker than that in linear case. In this study we proved this assumption only for the Haar wavelet. Haar function is an example of wavelet and this fundamental example gives major feature of the general wavelet. A nonlinear space comes from arbitrary selection of wavelet coefficients, which represent the target function almost equally. In this case our computational work will be reduced tremendously in the sense that approximation error decays more quickly than that in linear case. Copyright © 2006 Hindawi Publishing Corporation. All rights reserved. 1. Introduction Approximation by wavelet is a new tool in mathematics, physics, and engineering. In [5, 6] Morlet et al. first introduced the idea of wavelets as a family of functions con- structed from translation and dilations of a signal function called mother wavelet. Read- ers interested in the history of this subject may go through Debnath [2], Meyer [4], Morlet et al. [5, 6]. Wavelet analysis was originally introduced in order to improve seismic signal process- ing by switching from short-time Fourier analysis to new better algorithms to detect and analyze abrupt changes in signals. It may be remarked that a systematic study of approx- imation theory was initiated by Natanson [7] in the 1950s. Results concerning approxi- mation by trigonometric polynomials to functions belonging to different classes of func- tions can be found in Zygmund [9]. By the 1970s the