Decomposition and reconstruction algorithms for spline wavelets on a bounded interval
E Quak, N Weyrich - Applied and computational harmonic analysis, 1994 - Elsevier
E Quak, N Weyrich
Applied and computational harmonic analysis, 1994•ElsevierThe aim of this paper is to present decomposition and reconstruction algorithms for spline
wavelets on a bounded interval as introduced by Chui and Quak in [" Numerical Methods of
Approximation Theory, Vol. 9"(D. Braess and LL Schumaker, Eds.), pp. 53–75, Birkhäuser,
Basel, 1992]. The complexity of these algorithms is estimated and compared to that of some
other methods available for wavelets on an interval. The algorithms are based on the
observation that for a bounded interval, it is possible to perform both decomposition and …
wavelets on a bounded interval as introduced by Chui and Quak in [" Numerical Methods of
Approximation Theory, Vol. 9"(D. Braess and LL Schumaker, Eds.), pp. 53–75, Birkhäuser,
Basel, 1992]. The complexity of these algorithms is estimated and compared to that of some
other methods available for wavelets on an interval. The algorithms are based on the
observation that for a bounded interval, it is possible to perform both decomposition and …
Abstract
The aim of this paper is to present decomposition and reconstruction algorithms for spline wavelets on a bounded interval as introduced by Chui and Quak in ["Numerical Methods of Approximation Theory, Vol. 9" (D. Braess and L. L. Schumaker, Eds.), pp. 53–75, Birkhäuser, Basel, 1992]. The complexity of these algorithms is estimated and compared to that of some other methods available for wavelets on an interval. The algorithms are based on the observation that for a bounded interval, it is possible to perform both decomposition and reconstruction by computing with finite banded matrices. The paper also addresses the construction of the corresponding dual B-splines and dual B-wavelets.
Elsevier