scholarly journals A Family of Binary Approximating Subdivision Schemes based on Binomial Distribution

2019 ◽  
Vol 38 (4) ◽  
pp. 1087-1100 ◽  
Author(s):  
Muhammad Asghar ◽  
Ghulam Mustafa

A simplest way is introduced to generate a generalized algorithm of univariate and bivariate subdivision schemes. This generalized algorithm is based on the symbol of uniform B-splines subdivision schemes and probability generating function of Binomial distribution. We present a family of binary approximating subdivision schemes which has maximum continuity and less support size. Our proposed family members P4, P5, P6, and P7, have C7, C9, C11 and C13 continuities respectively. In fact, we use Binomial probability distribution to increase the continuity of uniform B-splines subdivision schemes up to more than double. We present the complete analysis of one family member of proposed schemes and give a visual performance to check smoothness graphically. In our analysis, we present continuity, Holder regularity, degree of generation, degree of reproduction and limit stencils analysis of proposed family of subdivision schemes. We also present a survey of high continuity subdivision schemes. Comparison shows that our proposed family of subdivision schemes gives high continuity of subdivision schemes comparative to existing subdivision schemes. We have found that as complexity increases the continuity also increases. In the last, we give the general formula for tensor product surface subdivision schemes and also present the visual performance of proposed tensor product surface subdivision schemes.

2015 ◽  
Vol 36 (3) ◽  
pp. 1389-1409 ◽  
Author(s):  
Rida T. Farouki ◽  
Francesca Pelosi ◽  
Maria Lucia Sampoli ◽  
Alessandra Sestini

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Keshan He ◽  
Peibing Du ◽  
Hao Jiang ◽  
Chongwen Duan ◽  
Hongxia Wang ◽  
...  

A Chebyshev tensor product surface is widely used in image analysis and numerical approximation. This article illustrates an accurate evaluation for the surface in form of Chebyshev tensor product. This algorithm is based on the application of error-free transformations to improve the traditional Clenshaw Chebyshev tensor product algorithm. Our error analysis shows that the error bound is u+Ou2×condP,x,y in contrast to classic scheme u×cond(P,x,y), where u is working precision and condP,x,y is a condition number of bivariate polynomial P(x,y), which means that the accuracy of the computed result is similar to that produced by classical approach with twice working precision. Numerical experiments verify that the proposed algorithm is stable and efficient.


2018 ◽  
Vol 16 (1) ◽  
pp. 1501-1518 ◽  
Author(s):  
Ghulam Mustafa ◽  
Robina Bashir

AbstractThis article deals with univariate binary approximating subdivision schemes and their generalization to non-tensor product bivariate subdivision schemes. The two algorithms are presented with one tension and two integer parameters which generate families of univariate and bivariate schemes. The tension parameter controls the shape of the limit curve and surface while integer parameters identify the members of the family. It is demonstrated that the proposed schemes preserve monotonicity of initial data. Moreover, continuity, polynomial reproduction and generation of the schemes are also discussed. Comparison with existing schemes is also given.


2014 ◽  
Vol 271 ◽  
pp. 53-70 ◽  
Author(s):  
Dominik Mokriš ◽  
Bert Jüttler ◽  
Carlotta Giannelli
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document