Generalization of Binary Tensor Product Schemes Depends upon Four Parameters

• Main Authors: Robina Bashir, Mehwish Bari, Ghulam Mustafa
• Format: Article
• Language: English
• Published: Mehran University of Engineering and Technology 2018-01-01
• Series: Mehran University Research Journal of Engineering and Technology
• Online Access: http://publications.muet.edu.pk/index.php/muetrj/article/view/107

This article deals with general formulae of parametric and non parametric bivariate subdivision scheme with four parameters. By assigning specific values to those parameters we get some special cases of existing tensor product schemes as well as a new proposed scheme. The behavior of schemes produced by the general formulae is interpolating, approximating and relaxed. Approximating bivariate subdivision schemes produce some other surfaces as compared to interpolating bivariate subdivision schemes. Polynomial reproduction and polynomial generation are desirable properties of subdivision schemes. Capability of polynomial reproduction and polynomial generation is strongly connected with smoothness, sum rules, convergence and approximation order. We also calculate the polynomial generation and polynomial reproduction of 9-point bivariate approximating subdivision scheme. Comparison of polynomial reproduction, polynomial generation and continuity of existing and proposed schemes has also been established. Some numerical examples are also presented to show the behavior of bivariate schemes.