700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ ReadersThis Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)
Research Article Open Access
In this paper we propose an algorithm for the calculation of the exact values of compactly-supported Daubechies wavelet functions. The algorithm is iterative, performing a single convolution operation at each step. It requires solving, at the first step only, a linear system of a relatively small size. The novelty of the algorithm is that once the values at dyadic points at a certain level j are calculated they do not need to be updated at the next step. We find that this algorithm is superior to the well-known cascade algorithm proposed by Ingrid Daubechies. This algorithm can serve well in wavelet based methods for the numerical solutions of differential equations. The algorithm is tested on Daubechies scaling functions as well as Daubechies coiflets. Comparison with the values obtained using the cascade algorithm is made. We found that the cascade algorithm results converge to ours
Daubechies wavelets, Daubechies coiflets, Multiresolution analysis, The cascade algorithm, Convolution, Physical Mathematics, Axioms, Topology, Integration , Algebraic Geometry, Quantum Mechanics, mirror symmetry, Noether's theorem, Quantumelectrodynamics, Hamilton Mechanics, vector bundle, Riemannian Geometry, Theory of Mathematical Modeling, Fourier Analysis, Theoretical Physics, Analytical Geometry, Differential Equations, Complex Analysis.