The cascade algorithm for the numerical computation of refinable functions (Q1424942)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The cascade algorithm for the numerical computation of refinable functions |
scientific article; zbMATH DE number 2057580
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The cascade algorithm for the numerical computation of refinable functions |
scientific article; zbMATH DE number 2057580 |
Statements
The cascade algorithm for the numerical computation of refinable functions (English)
0 references
15 March 2004
0 references
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.
0 references
cascade algorithms
0 references
refinable functions
0 references
wavelets
0 references
