scholarly journals A Novel Numerical Method for Computing Subdivision Depth of Quaternary Schemes

Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 809
Author(s):  
Aamir Shahzad ◽  
Faheem Khan ◽  
Abdul Ghaffar ◽  
Shao-Wen Yao ◽  
Mustafa Inc ◽  
...  
Keyword(s):  
Numerical Method ◽  
Error Bound ◽  
Error Bounds ◽  
Computational Technique ◽  
Optimal Error ◽  
Subdivision Schemes ◽  
Subdivision Depth

In this paper, an advanced computational technique has been presented to compute the error bounds and subdivision depth of quaternary subdivision schemes. First, the estimation is computed of the error bound between quaternary subdivision limit curves/surfaces and their polygons after kth-level subdivision by using l0 order of convolution. Secondly, by using the error bounds, the subdivision depth of the quaternary schemes has been computed. Moreover, this technique needs fewer iterations (subdivision depth) to get the optimal error bounds of quaternary subdivision schemes as compared to the existing techniques.

scholarly journals A Computational Method for Subdivision Depth of Ternary Schemes

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 817
Author(s):  
Faheem Khan ◽  
Ghulam Mustafa ◽  
Aamir Shahzad ◽  
Dumitru Baleanu ◽  
Maysaa M. Al-Qurashi
Keyword(s):  
Error Bounds ◽  
Numerical Experiments ◽  
Computational Method ◽  
Subdivision Schemes ◽  
Practical Applications ◽  
Refinement Procedure ◽  
Subdivision Algorithm ◽  
Subdivision Depth ◽  
Error Distance ◽  
New Framework

Subdivision schemes are extensively used in scientific and practical applications to produce continuous shapes in an iterative way. This paper introduces a framework to compute subdivision depths of ternary schemes. We first use subdivision algorithm in terms of convolution to compute the error bounds between two successive polygons produced by refinement procedure of subdivision schemes. Then, a formula for computing bound between the polygon at k-th stage and the limiting polygon is derived. After that, we predict numerically the number of subdivision steps (depths) required for smooth limiting shape based on the demand of user specified error (distance) tolerance. In addition, extensive numerical experiments were carried out to check the numerical outcomes of this new framework. The proposed methods are more efficient than the method proposed by Song et al.

scholarly journals New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices

2019 ◽  
Vol 17 (1) ◽  
pp. 1599-1614
Author(s):  
Zhiwu Hou ◽  
Xia Jing ◽  
Lei Gao
Keyword(s):  
Linear Algebra ◽  
Error Bound ◽  
Linear Complementarity Problem ◽  
Error Bounds ◽  
Complementarity Problems ◽  
Linear Complementarity Problems ◽  
Linear Complementarity ◽  
Numerical Examples ◽  
Numer Algor ◽  
Better Than

Abstract A new error bound for the linear complementarity problem (LCP) of Σ-SDD matrices is given, which depends only on the entries of the involved matrices. Numerical examples are given to show that the new bound is better than that provided by García-Esnaola and Peña [Linear Algebra Appl., 2013, 438, 1339–1446] in some cases. Based on the obtained results, we also give an error bound for the LCP of SB-matrices. It is proved that the new bound is sharper than that provided by Dai et al. [Numer. Algor., 2012, 61, 121–139] under certain assumptions.

scholarly journals Revisited Optimal Error Bounds for Interpolatory Integration Rules

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
François Dubeau
Keyword(s):  
Error Bounds ◽  
Error Term ◽  
Quadrature Rules ◽  
Optimal Error ◽  
Integration By Parts ◽  
Integration Rules

We present a unified way to obtain optimal error bounds for general interpolatory integration rules. The method is based on the Peano form of the error term when we use Taylor’s expansion. These bounds depend on the regularity of the integrand. The method of integration by parts “backwards” to obtain bounds is also discussed. The analysis includes quadrature rules with nodes outside the interval of integration. Best error bounds for composite integration rules are also obtained. Some consequences of symmetry are discussed.

scholarly journals A Novel Numerical Algorithm to Estimate the Subdivision Depth of Binary Subdivision Schemes

Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 66 ◽  
Author(s):  
Aamir Shahzad ◽  
Faheem Khan ◽  
Abdul Ghaffar ◽  
Ghulam Mustafa ◽  
Kottakkaran Sooppy Nisar ◽  
...  
Keyword(s):  
Numerical Algorithm ◽  
Subdivision Schemes ◽  
Practical Applications ◽  
Curves And Surfaces ◽  
Geometrical Shapes ◽  
Subdivision Depth ◽  
Subdivision Curves

Subdivision schemes are extensively used in scientific and practical applications to produce continuous geometrical shapes in an iterative manner. We construct a numerical algorithm to estimate subdivision depth between the limit curves/surfaces and their control polygons after k-fold subdivisions. In this paper, the proposed numerical algorithm for subdivision depths of binary subdivision curves and surfaces are obtained after some modification of the results given by Mustafa et al in 2006. This algorithm is very useful for implementation of the parametrization.

scholarly journals Optimal error bounds for two-grid schemes applied to the Navier–Stokes equations

2012 ◽  
Vol 218 (13) ◽  
pp. 7034-7051 ◽  
Author(s):  
Javier de Frutos ◽  
Bosco García-Archilla ◽  
Julia Novo
Keyword(s):  
Error Bounds ◽  
Stokes Equations ◽  
Navier Stokes ◽  
Optimal Error ◽  
Navier Stokes Equations
Sign in / Sign up

Export Citation Format

Share Document