Binary subdivision schemes
This thesis presents the general theory of uniform binary subdivision schemes with emphasis on the convergence of such algorithms. Also, a generalization of a known result to the case of any set of initial data is stated and proved. In terms of applications, known subdivision schemes and a new one together with graphical examples are discussed in view of properties such as interpolatory, polynomial preserving and the smoothness class of the limit function.
Bibliography: p. 110-112.
Calistrate, M. (1996). Binary subdivision schemes (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/16947