期刊名称：American Journal of Computational Mathematics
印刷版ISSN：2161-1203
电子版ISSN：2161-1211
出版年度：2013
卷号：3
期号：1A
页码：6-10
DOI：10.4236/ajcm.2013.31A002
出版社：Scientific Research Publishing
摘要：In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer m>1) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence and smoothness of the proposed schemes, the Laurent polynomial method has been used.
