Abstract
The cascade algorithm is a method which can be used for the computation of refinable functions. We prove here that in general the cascade algorithm will not inherit the accuracy and refinability of the limit refinable function. We provide conditions for which the cascade iteration does indeed preserve accuracy.
Similar content being viewed by others
References
A.S. Cavaretta, W. Dahmen and C.A. Micchelli, Stationary subdivision, Mem. Amer. Math. Soc. 93(453) (1991) 1–186.
D.R. Chen, R.Q. Jia and S.D. Riemenschneider, Convergence of vector subdivision schemes in Sobolev spaces, Appl. Comput. Harmon. Anal. 12 (2002) 128–149.
R.Q. Jia, Approximation properties of multivariate wavelets, Math. Comp. 67 (1998) 647–665.
C.A. Micchelli, Mathematical Aspects of Geometric Modeling, CBMS, Vol. 65 (SIAM, Philadelphia, PA, 1995).
C.A. Micchelli and H. Prautzsch, Uniform refinement of curves, Linear Algebra Appl. 114/115 (1989) 161–194.
C.A. Micchelli and T. Sauer, Regularity of multiwavelets, Adv. Comput. Math. 7 (1997) 455–546.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chen, Q., Xu, Y. The Cascade Algorithm for the Numerical Computation of Refinable Functions. Advances in Computational Mathematics 20, 17–24 (2004). https://doi.org/10.1023/A:1025844410775
Issue Date:
DOI: https://doi.org/10.1023/A:1025844410775