Regularity of boundary wavelets (Q654447): Difference between revisions

The discrete wavelet transform algorithm requires recursion coefficients, so linear combinations which are not refinable are of little practical value. However, one can construct continuous refinable boundary functions with approximation order at least 1 which are not linear combinations of boundary-crossing functions. In this paper, the recursion approach leads to new kinds of boundary functions which cannot be derived using the traditional approach. The authors show how to determine the necessary number of boundary functions at each end, and prove that this choice is unique. Necessary and sufficient conditions are obtained for the approximation order and the continuity of boundary functions, based on the recursion coefficients alone determining all possible boundary functions which are linear combinations and also refinable. Computational techniques for orthonormalizing existing boundary functions are presented which are much easier than the usual techniques based on inner products on subintervals.