Decompositions of trigonometric polynomials with applications to multivariate subdivision schemes

Nira Dyn, Maria Skopina*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

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 multivariate subdivision schemes associated with general dilation matrices. The approach presented in this paper leads directly to constructive algorithms, and is an alternative to the analysis of multivariate subdivision schemes in terms of the joint spectral radius of certain operators. Our convergence results apply to arbitrary dilation matrices, while the smoothness results are limited to two classes of dilation matrices.

Original languageEnglish
Pages (from-to)321-349
Number of pages29
JournalAdvances in Computational Mathematics
Volume38
Issue number2
DOIs
StatePublished - Feb 2013

Funding

FundersFunder number
Hermann Minkowski Center for Geometry at Tel-Aviv University12-01-00216, 09-01-00162
Russian Foundation for Basic Research

    Keywords

    • Dilation matrix
    • Polyphase components of trigonometric polynomials
    • Refinable function
    • Subdivision operator

    Fingerprint

    Dive into the research topics of 'Decompositions of trigonometric polynomials with applications to multivariate subdivision schemes'. Together they form a unique fingerprint.

    Cite this