Ju l 2 00 9 Decompositions of Trigonometric Polynomials with Applications to Multivariate Subdivision Schemes
نویسنده
چکیده
We study multivariate trigonometric polynomials, satisfying a set of constraints close to the known Strung-Fix conditions. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple constructive method for a special type of decomposition of such polynomials. These decompositions are of interest to the analysis of convergence and smoothness of multivariate subdivision schemes associated with general dilation matrices. We apply these decompositions, by verifying sufficient conditions for the convergence and smoothness of multivariate scalar subdivision schemes, proved here. For the convergence analysis our sufficient conditions apply to arbitrary dilation matrices, while the previously known necessary and sufficient conditions are relevant only in case of dilation matrices with a self similar tiling. For the analysis of smoothness, we state and prove two theorems on multivariate matrix subdivision schemes, which lead to sufficient conditions for C1 limits of scalar multivariate subdivision schemes associated with isotropic dilation matrices. Although similar results are stated in the literature, we give here detailed proofs of the results, which we could not find elsewhere. MSC 41A30, 42C40
منابع مشابه
Decompositions of trigonometric polynomials with applications to multivariate subdivision schemes
We study multivariate trigonometric polynomials satisfying the “sum-rule” conditions of a certain order. Based on the polyphase representation of these polynomials relative to a general dilation matrix, we develop a simple constructive method for a special type of decomposition of such polynomials. These decompositions are of interest in the analysis of convergence and smoothness of multivariat...
متن کاملA New Class of Non-stationary Interpolatory Subdivision Schemes Based on Exponential Polynomials
We present a new class of non-stationary, interpolatory subdivision schemes that can exactly reconstruct parametric surfaces including exponential polynomials. The subdivision rules in our scheme are interpolatory and are obtained using the property of reproducing exponential polynomials which constitute a shift-invariant space. It enables our scheme to exactly reproduce rotational features in ...
متن کاملTernary approximating non - stationary subdivision schemes for curve design
In this paper, an algorithm has been introduced to produce ternary 2m-point (for any integer m≥ 1) approximating non-stationary subdivision schemes which can generate the linear spaces spanned by {1; cos(α.); sin(α.)}. The theory of asymptotic equivalence is being used to analyze the convergence and smoothness of the schemes. The proposed algorithm can be consider as the non-stationary counter ...
متن کاملMultiple Rank-1 Lattices as Sampling Schemes for Multivariate Trigonometric Polynomials
We present a new sampling method that allows the unique reconstruction of (sparse) multivariate trigonometric polynomials. The crucial idea is to use several rank-1 lattices as spatial discretization in order to overcome limitations of a single rank-1 lattice sampling method. The structure of the corresponding sampling scheme allows for the fast computation of the evaluation and the reconstruct...
متن کاملOptimization with Positive Trigonometric Polynomials: a Review and New Applications
This paper has a double purpose. Firstly, we review recent results regarding the characterization of positive multivariate trigonometric polynomials as functions of sumof-squares polynomials. Using the linear matrix inequality parameterization of sum-of-squares, we discuss several optimization applications, among which the design of 2D FIR filters with linear or nonlinear phase. Secondly, we pr...
متن کامل