We propose a recursive formula for moments of scaling function and sum rule. It is shown that some quadrature formulae has a higher degree of accuracy under proposed moment condition. On this basis we obtain higher accuracy formula for wavelet expansion coefficients which are needed to start the fast wavelet transform and estimate convergence rate of wavelet approximation and sampling of smooth functions. We also present a direct algorithm for solving refinement equation.

We propose a recursive formula for moments of scaling function and sum rule. It is shown that some quadrature formulae has a higher degree of accuracy under proposed moment condition. On this basis we obtain higher accuracy formula for wavelet expansion coefficients which are needed to start the fast wavelet transform and estimate convergence rate of wavelet approximation and sampling of smooth functions. We also present a direct algorithm for solving refinement equation.