Salkauskas, KestutisCalistrate, Magdalena2005-07-292005-07-291996Calistrate, M. (1996). Binary subdivision schemes (Master's thesis, University of Calgary, Calgary, Canada). Retrieved from https://prism.ucalgary.ca. doi:10.11575/PRISM/169470612187403http://hdl.handle.net/1880/29174Bibliography: p. 110-112.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.vii, 112 leaves : ill. ; 30 cm.engUniversity of Calgary graduate students retain copyright ownership and moral rights for their thesis. You may use this material in any way that is permitted by the Copyright Act or through licensing that has been assigned to the document. For uses that are not allowable under copyright legislation or licensing, you are required to seek permission.QA 221 C35 1996Approximation theorymaster thesis10.11575/PRISM/16947QA 221 C35 1996