Convergence of cascade algorithms by frequency approach

Starting with an initial function ϕ0ϕ0, the cascade algorithm generates a sequence {Qanϕ0}n=1∞ by cascade operator QaQa defined byQaf=∑α∈Zda(α)f(M⋅−α). A function ϕ   is refinable if it satisfies Qaϕ=ϕQaϕ=ϕ. The refinable functions play an important role in wavelet analysis and computer graphics. The cascade algorithm is the main approach to approximate the refinable functions and to study their properties. This note establishes a sufficient condition, in terms of Fourier transforms of the initial function ϕ0ϕ0 and the refinable function ϕ  , for the convergence of cascade algorithm. Our results apply to the case where neither the initial function is compactly supported nor the refinement mask is finitely supported. As a byproduct, we prove that any compactly supported refinable function has a positive Sobolev regularity exponent provided it is in L2L2.