Characterising the accuracy of multivariable refinable functions via the symbol function
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.
- Accuracy of multivariable refinable functions and two-scale similarity transform
- Accuracy of several multidimensional refinable distributions
- scientific article; zbMATH DE number 1829584 (Why is no real title available?)
- An algorithm for constructing biorthogonal multiwavelets with higher approximation orders
- scientific article; zbMATH DE number 1176651 (Why is no real title available?)
- scientific article; zbMATH DE number 1767703 (Why is no real title available?)
- Polynomial interpolation, ideals and approximation order of multivariate refinable functions
- scientific article; zbMATH DE number 1829730 (Why is no real title available?)
- Accuracy conditions of multivariate refinable vector in frequency domain
- Approximation by crystal-refinable functions
This page was built for publication: Characterising the accuracy of multivariable refinable functions via the symbol function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5944200)
