The cascade algorithm for the numerical computation of refinable functions

DOI10.1023/A:1025844410775MaRDI QIDQ1424942zbMATH OpenOpenAlexFDO

Authors Yuesheng Xu, Qiuhui Chen

Publication date 15 March 2004

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1025844410775

zbMATH Keywords

cascade algorithmsrefinable functionswavelets

Mathematics Subject Classification ID

Numerical methods for wavelets (65T60)

Review text

A refinable function is a fixed point of the mapping of form \(Tf(x)=\sum_{j\in \mathbb{Z}}a(j)f(2x-j)\). The authors show that, for a properly chosen initial function \(f_0\), the accuracy of the iterates \(T^nf_0\) can be preserved. However, the refinability of the iterates can be preserved seldom.

Recommendations

• Convergence of cascade algorithms by frequency approach
• scientific article; zbMATH DE number 1424493
• Construction of Smooth Refinable Function Vectors by Cascade Algorithms
• Convergence of cascade algorithms and smoothness of refinable distributions
• scientific article; zbMATH DE number 1189324

This page was built for publication: The cascade algorithm for the numerical computation of refinable functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424942)