Approximation order and approximate sum rules in subdivision

From MaRDI portal
Publication:281572

DOI10.1016/J.JAT.2016.02.014zbMATH Open1338.65045arXiv1411.2114OpenAlexW2300818807MaRDI QIDQ281572FDOQ281572


Authors: Jungho Yoon, Costanza Conti, Lucia Romani Edit this on Wikidata


Publication date: 11 May 2016

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Abstract: Several properties of stationary subdivision schemes are nowadays well understood. In particular, it is known that the polynomial generation and reproduction capability of a stationary subdivision scheme is strongly connected with sum rules, its convergence, smoothness and approximation order. The aim of this paper is to show that, in the non-stationary case, exponential polynomials and approximate sum rules play an analogous role of polynomials and sum rules in the stationary case. Indeed, in the non-stationary univariate case we are able to show the following important facts: i) reproduction of N exponential polynomials implies approximate sum rules of order N; ii) generation of N exponential polynomials implies approximate sum rules of order N, under the additional assumption of asymptotical similarity and reproduction of one exponential polynomial; iii) reproduction of an N-dimensional space of exponential polynomials and asymptotical similarity imply approximation order N; iv) the sequence of basic limit functions of a non-stationary scheme reproducing one exponential polynomial converges uniformly to the basic limit function of the asymptotically similar stationary scheme.


Full work available at URL: https://arxiv.org/abs/1411.2114




Recommendations




Cites Work


Cited In (25)





This page was built for publication: Approximation order and approximate sum rules in subdivision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281572)