Polynomial reproduction by symmetric subdivision schemes

  • Authors:
  • Nira Dyn;Kai Hormann;Malcolm A. Sabin;Zuowei Shen

  • Affiliations:
  • School of Mathematical Sciences, Tel Aviv University, Israel;Department of Informatics, Clausthal University of Technology, Germany;Computer Laboratory, University of Cambridge, United Kingdom;Department of Mathematics, National University of Singapore, Singapore

  • Venue:
  • Journal of Approximation Theory
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We first present necessary and sufficient conditions for a linear, binary, uniform, and stationary subdivision scheme to have polynomial reproduction of degree d and thus approximation order d+1. Our conditions are partly algebraic and easy to check by considering the symbol of a subdivision scheme, but also relate to the parameterization of the scheme. After discussing some special properties that hold for symmetric schemes, we then use our conditions to derive the maximum degree of polynomial reproduction for two families of symmetric schemes, the family of pseudo-splines and a new family of dual pseudo-splines.