Abstract
Suppose that f(x) = (f 1(x),...,f r (x))T, x∈R d is a vector-valued function satisfying the refinement equation f(x) = ∑Λ c κ f(2x−κ) with finite set Λ of Z d and some r×r matricex c κ. The requirements for f to have accuracy p are given in terms of the symbol function m(ξ).
Similar content being viewed by others
References
C. Heil, G. Strang, V. Strela, Approximation by translates of refinable functions, Numerische Math, 1996, 73:75–94
G. Plonka, Approximation order provided by refinable function vectors, Constr Approx 13, 1997, 13:221– 244
C. Cabrelli, C. Heil, U. Molter, Accuracy of lattice translates of several multidimensional refinable functions, 1998, to appear in J A T
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by NSFC
Rights and permissions
About this article
Cite this article
Sheng, Q.H., Chen, H.L. Characterising the Accuracy of Multivariable Refinable Functions via the Symbol Function. Acta Math Sinica 17, 277–286 (2001). https://doi.org/10.1007/s101149900014
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s101149900014