Factorization of re nement masks of function vectors
نویسنده
چکیده
Considering the set of closed shift invariant subspaces Vj j Z of L lR generated by a re nable function vector we give necessary and su cient conditions for the re nement mask of ensur ing controlled approximation order m In particular algebraic poly nomials can be exactly reproduced in V if and only if the re nement mask of can be factorized The results are illustrated by B splines with multiple knots x Introduction The idea of considering a ladder of imbedded subspaces Vj of a Hilbert space for approximating functions has extensively been used in many ap plications In the case of multiresolution analysis of L lR the subspaces Vj are usually generated by a single function L lR Vj closL span f j l l Zg In order to ensure the condition Vj Vj j Z we need a re nable scaling function i e has to satisfy a functional equation of the type X
منابع مشابه
Regularity of Re nable Function Vectors
We study the existence and regularity of compactly supported solutions r of vector re nement equations The space spanned by the translates of can only provide approximation order if the re nement mask P has certain particular factorization properties We show how the factorization of P can lead to decay of j u j as juj The results on decay are used in order to prove uniqueness of solutions and c...
متن کاملApproximation Properties of Multi Scaling Functions A Fourier Approach
In this paper we consider approximation properties of a nite set of functions r which are not necessarily compactly supported but have a suitable decay rate Assuming that the function vector r is re n able we sketch a new way how to derive necessary and su cient conditions for the re nement mask in Fourier domain Introduction For applications of multi wavelets in nite element methods the proble...
متن کاملHow Many Holes Can Locally Linearly Independent Reenable Function Vectors Have?
In this paper we consider the support properties of locally linearly independent re nable function vectors r T We propose an algorithm for computing the global support of the components of Further for T we investigate the supports especially the possibility of holes of re nable function vectors if local linear independence is assumed Finally we give some necessary conditions for local linear in...
متن کاملAnalysis of Hermite interpolatory subdivision schemes
The theory of matrix subdivision schemes provides tools for the analysis of general uniform stationary matrix schemes The special case of Hermite interpolatory subdivision schemes deals with re nement algorithms for the function and the derivatives values with matrix masks depending upon the re nement level i e non stationary matrix masks Here we rst show that a Hermite interpolatory subdivisio...
متن کاملApproximation Order Provided by Reenable Function Vectors
In this paper we considerLp approximation by integer trans lates of a nite set of functions r which are not nec essarily compactly supported but have a suitable decay rate Assuming that the function vector r is re nable necessary and su cient conditions for the re nement mask are derived In particular if algebraic polynomials can be exactly reproduced by integer translates of then a factorizati...
متن کامل