Approximation by crystal-refinable functions

Functional inequalities, including subadditivity, convexity, etc. (39B62) Approximation by arbitrary linear expressions (41A45) Algorithms for approximation of functions (65D15)

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.

Review text

For a crystal(lographic) group \(\Gamma\) in \(\mathbb{R}\), a function \(\varphi: \mathbb{R}^d\to \mathbb{C}\) is called crystal-refinable (or \(\Gamma\)-refinable) if it is a linear combination of finitely many rescaled and translated functions of the form \(\varphi (\gamma^{-1} a \cdot)\) where the translations \(\gamma\in \Gamma\) and \(a\) is an expansive matrix with the property that \(a\Gamma a^{-1} \subset \Gamma\). Therefore, a \(\Gamma\)-refinable function satisfies a refinement equation of the form \(\varphi = \sum\limits_{\gamma\in \Gamma} d_\gamma \varphi (\gamma^{-1} a \cdot)\) with \(d_\gamma\in \mathbb{C}\). Denote by \(\mathcal{S}(\varphi)\) the closed linear span of \(\{\varphi (\gamma^{-1} a \cdot) : \gamma\in \Gamma\}\) and set \(\mathcal{S}^h = \{f(\cdot/h) : f\in \mathcal{S}(\varphi)\}\), \(h > 0\). The quality of approximation of functions in \(L^2(\mathbb{R}^d)\) by elements of \(\mathcal{S}(\varphi)\) is closely related to the crystal-accuracy of \(\mathcal{S}(\varphi)\). This latter property is defined as the highest degree \(p\) such that all multivariate polynomials \(q\) with \(\text{degree}(q) < p\) are exactly reproduced from elements in \(\mathcal{S}(\varphi)\). The authors determine the accuracy \(p\) in terms of the coefficients \(d_\gamma\). Additionally, the thus obtained results are applied to a particular lattice refinable vector function and accuracy conditions are derived that simplify the classical conditions.

Recommendations

Cites work

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

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