Please use this identifier to cite or link to this item: https://doi.org/10.1142/S0252959903000372
DC FieldValue
dc.titleConvergence of cascade algorithms and smoothness of refinable distributions
dc.contributor.authorSun, Q.
dc.date.accessioned2014-10-28T02:32:58Z
dc.date.available2014-10-28T02:32:58Z
dc.date.issued2003
dc.identifier.citationSun, Q. (2003). Convergence of cascade algorithms and smoothness of refinable distributions. Chinese Annals of Mathematics. Series B 24 (3) : 367-386. ScholarBank@NUS Repository. https://doi.org/10.1142/S0252959903000372
dc.identifier.issn02529599
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103069
dc.description.abstractIn this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Hölder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1142/S0252959903000372
dc.sourceScopus
dc.subjectCascade algorithm
dc.subjectCascade operator
dc.subjectFractional sobolev space
dc.subjectLinear independent shifts
dc.subjectRefinable distribution
dc.subjectShift-invariant space
dc.subjectStable shifts
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1142/S0252959903000372
dc.description.sourcetitleChinese Annals of Mathematics. Series B
dc.description.volume24
dc.description.issue3
dc.description.page367-386
dc.identifier.isiut000185874400012
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.