Characterising the accuracy of multivariable refinable functions via the symbol function (Q5944200): Difference between revisions

Let \(f(x)=(f_1(x),\ldots, f_r(x))^T, x\in{\mathbb R}^d\), be a function vector satisfying the refinement equation \[ f(x)=\sum_{k\in\Lambda} c_kf(2x-k), \] where \(\Lambda\) is a finite subset of \({\mathbb Z}^d\) and \(c_k\) are real \((r \times r)\)-matrices. The accuracy of \(f\) is the highest degree \(p\) such that all multivariate polynomials with total degree less than \(p\) can be reproduced by linear combinations of integer translates of \(f_1(x),\ldots ,f_r(x)\). The authors give a characterization of the accuracy of \(f\) in terms of the refinement mask symbol \[ m(\xi)={1\over 2^d}\sum_{k\in\Lambda} c_k e^{-ik\xi} \] and its derivatives.