The correlation between the convergence of subdivision processes and solvability of refinement equations

Vladimir Protassov

No EI 2001-45, Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute

Abstract: We consider a univariate two-scale difference equation, which is studied in approximation theory, curve design and wavelets theory. This paper analysis the correlation between the existence of smooth compactly supported solutions of this equation and the convergence of the corresponding cascade algorithm/subdivision scheme. We introduce a criterion that expresses this correlation in terms of mask of the equation. It was shown that the convergence of subdivision scheme depends on values that the mask takes at the points of its generalized cycles. In this paper we show that the criterion is sharp in the sense that an arbitrary generalized cycle causes the divergence of a suitable subdivision scheme. To do this we construct a general method to produce divergent subdivision schemes having smooth refinable functions. The criterion therefore establishes a complete classification of divergent subdivision schemes.

Keywords: Cascade algorithm; Cycles; Rate of convergence; Refinement equations; Subdivision process (search for similar items in EconPapers)
Date: 2001-12-14
References: Add references at CitEc
Citations:

Downloads: (external link)
https://repub.eur.nl/pub/594/feweco20011214153209.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ems:eureir:594

Access Statistics for this paper

More papers in Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute Contact information at EDIRC.
Bibliographic data for series maintained by RePub ( this e-mail address is bad, please contact ).