Binary subdivision schemes

Files
thesis_Calistrate_1996.pdf(37.38 MB)
Date
1996
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
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 applica­tions, 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.
Description
Bibliography: p. 110-112.
Keywords
Citation
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
URI
http://hdl.handle.net/1880/29174
Collections
Legacy Theses