Approximation by crystal-refinable functions

Abstract: Let

G a m m a

be a crystal group in

m a t h b b R^{d}

. A function

v a r p h i : m a t h b b R^{d} l o n g r i g h t a r r o w m a t h b b C

is said to be {em crystal-refinable} (or

G a m m a -

refinable) if it is a linear combination of finitely many of the rescaled and translated functions

v a r p h i (g a m m a^{- 1} (a x))

, where the {em translations}

g a m m a

are taken on a crystal group

G a m m a

, and

a

is an expansive dilation matrix such that

a G a m m a a^{- 1} s u b s e t G a m m a .

A

G a m m a -

refinable function

v a r p h i : m a t h b b R^{d} i g h t a r r o w m a t h b b C

satisfies a refinement equation

v a r p h i (x) = s u m_{g a m m a i n G a m m a} d_{g} a m m a v a r p h i (g a m m a^{- 1} (a x))

with

d_{g} a m m a i n m a t h b b C

. Let

m a t h c a l S (v a r p h i)

be the linear span of

v a r p h i (g a m m a^{- 1} (x)) : g a m m a i n G a m m a

and

m a t h c a l S^{h} = f (x / h) : f i n m a t h c a l S (v a r p h i)

. One important property of

m a t h c a l S (v a r p h i)

is, how well it approximates functions in

L^{2} (m a t h b b R^{d})

. This property is very closely related to the {em crystal-accuracy} of

m a t h c a l S (v a r p h i)

, which is the highest degree

p

such that all multivariate polynomials

q (x)

of

m d e g r e e (q) < p

are exactly reproduced from elements in

m a t h c a l S (v a r p h i)

. In this paper, we determine the accuracy

p

from the coefficients

d_{g} a m m a

. Moreover, we obtain from our conditions, a characterization of accuracy for a particular lattice refinable vector function

F

, which simplifies the classical conditions.

Recommendations

Cites work

This page was built for publication: Approximation by crystal-refinable functions