Please use this identifier to cite or link to this item: https://doi.org/10.1007/s002119900095
DC FieldValue
dc.titleConvergence of nonstationary cascade algorithms
dc.contributor.authorGoodman, T.N.T.
dc.contributor.authorLee, S.L.
dc.date.accessioned2014-10-28T02:33:00Z
dc.date.available2014-10-28T02:33:00Z
dc.date.issued1999
dc.identifier.citationGoodman, T.N.T.,Lee, S.L. (1999). Convergence of nonstationary cascade algorithms. Numerische Mathematik 84 (1) : 1-33. ScholarBank@NUS Repository. <a href="https://doi.org/10.1007/s002119900095" target="_blank">https://doi.org/10.1007/s002119900095</a>
dc.identifier.issn0029599X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103072
dc.description.abstractA nonstationary multiresolution of L2(ℝS) is generated by a sequence of scaling functions φk ∈ L2(ℝS), k ∈ ℤ. We consider (φk) that is the solution of the nonstationary refinement equations φk = |M| ∑J hk+1(j)φk+1(M · -j), k ∈ ℤ, where hk is finitely supported for each k and M is a dilation matrix. We study various forms of convergence in L2(ℝS) of the corresponding nonstationary cascade algorithm φk,n = |M| ∑J hk+1(j)φk+1,n-1 (M · -j), as k or n tends to ∫. It is assumed that there is a stationary refinement equation at ∫ with filter sequence h and that ∑|hk(j) - h(j)| < ∫. The results show that the convergence of the nonstationary cascade algorithm is determined by the spectral properties of the transition operator associated with h. © Springer-Verlag 1999.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/s002119900095
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1007/s002119900095
dc.description.sourcetitleNumerische Mathematik
dc.description.volume84
dc.description.issue1
dc.description.page1-33
dc.identifier.isiutNOT_IN_WOS
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.