Computational and algorithmic aspects of cardinal spline-wavelets

Pascal triangles are formulated for computing the coefficients of the B-spline series representation of the compactly supported spline-wavelets with minimum support and their derivatives. It is shown that with the alternating signs removed, all these sequences are totally positive. On the other hand, truncations of the reciprocal Euler-Frobenius polynomials lead to finite sequences for orthogonal wavelet decompositions. For this purpose, sharp estimates are given in terms of the exact reconstruction of these approximate decomposed components. Research supported by NSF Grant DMS 89-0-01345 and ARO Contract No. DAAL 03-90-G-0091.