Vector cascade algorithms and refinable function vectors in Sobolev spaces

  • Authors:

  • Bin Han

  • Affiliations:

  • Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton, Alberta, Canada T6G 2G1

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

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper we shall study vector cascade algorithms and refinable function vectors with a general isotropic dilation matrix in Sobolev spaces. By introducing the concept of a canonical mask for a given matrix mask and by investigating several properties of the initial function vectors in a vector cascade algorithm, we are able to take a relatively unified approach to study several questions such as convergence, rate of convergence and error estimate for a perturbed mask of a vector cascade algorithm in a Sobolev space Wpk(Rs) (1 ≤ p ≤ ∞, k ∈ N ∪ {0}). We shall characterize the convergence of a vector cascade algorithm in a Sobolev space in various ways. As a consequence, a simple characterization for refinable Hermite interpolants and a sharp error estimate of a vector cascade algorithm in a Sobolev space with a perturbed mask will be presented. The approach in this paper enables us to answer some unsolved questions in the literature on vector cascade algorithms and to comprehensively generalize and improve results on scalar cascade algorithms and scalar refinable functions to the vector case.