Abstract
The use of wavelets for the solution of convolution equations is studied as a possible alternative to the well-established Fast Fourier Transform (FFT) technique. Two possible solution strategies are investigated: (1) The use of wavelets for the representation of both the given data and the unknown solution. This leads to an algorithm with good de-noising and data-compression properties. In terms of computational efficiency this algorithm is inferior to FFT. (2) The use of wavelets for the representation of the unknown solution and of so-called vaguelettes for the representations of the given data. This leads to an algorithm which is even faster than FFT.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
