Computation of Battle-Lemarie wavelets using an FFT-based algorithm (Q1305247)

The authors propose an fast Fourier transform (FFT)-based algorithm for the computation of (the mask of) Lemarie-Battle scaling functions and wavelets [cf. \textit{P.-G. Lemarie}, J. Math. Pures Appl., IX Ser. 67, No. 3, 227-236 (1988; Zbl 0758.42020); \textit{G. Battle}, A block spin construction of ondelettes. I: Lemarie functions, Commun. Math. Phys. 110, No. 4, 601-615 (1987)] which is more efficient than the matrix approach suggested by \textit{M.-J. Lai} [Math. Comput. 63, No. 208, 689-699 (1994; Zbl 0807.42026)].