\((2n - 1)\)-point ternary approximating and interpolating subdivision schemes (Q410843)

Summary: We present an explicit formula which unifies the mask of \((2n - 1)\)-point ternary interpolating as well as approximating subdivision schemes. We observe that the odd point ternary interpolating and approximating schemes introduced by \textit{J. Lian} [Appl. Appl. Math. 4, No. 2, 434--444 (2009; Zbl 1178.65017)], \textit{S. S. Siddiqi} and \textit{K. Rehan} [Appl. Math. Comput. 216, No. 3, 970--982 (2010; Zbl 1198.65042)] and \textit{M. F. Hassan} and \textit{N. A. Dodgson} [Ternary and three point univariate subdivision schemes. Curve und surface fitting, Saint-Malo 2002. Fifth international conference on curves and surfaces, Saint-Malo, France, June 27 -- July 3, 2002. Brentwood, TN: Nashboro Press. Modern Methods in Mathematics, 199--208 (2003; Zbl 1037.65024)] are special cases of our proposed masks/schemes. Moreover, schemes introduced by \textit{H. Zheng, M. Hu} and \textit{G. Peng} [``Ternary even symmetric \(2n\)-point subdivision,'' in: Proceedings of the International Conference on Computational Intelligence and Software Engineering (CiSE '09), Wuhan, China (2009)] can easily be generated by our proposed masks. It is also proved from comparison that \((2n - 1)\)-point schemes are better than \(2n\)-scheme in the sense of computational cost, support and error bounds.