Computation of Battle-Lemarie wavelets using an FFT-based algorithm

DOI10.1023/A:1023245519490MaRDI QIDQ1305247zbMATH OpenOpenAlexFDO

Authors Jeng-Fan Leu, Jyh-Cheng Jang, Chyi Hwang

Publication date 19 July 2000

Published in Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1023245519490

zbMATH Keywords

algorithmfast Fourier transformLemarie-Battle scaling functionsLemarie-Battle wavelets

Mathematics Subject Classification ID

Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for wavelets (65T60)

Review text

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)].

Recommendations

• On the Computation of Battle-Lemarie's Wavelets
• The algorithm research of fast multiwavelet transform based on FFT
• scientific article; zbMATH DE number 1193375

Cited in

(3)

• Analysis and construction of a family of refinable functions based on generalized Bernstein polynomials
• On the Computation of Battle-Lemarie's Wavelets
• Infinitely oscillating wavelets and an efficient implementation algorithm based on the FFT

This page was built for publication: Computation of Battle-Lemarie wavelets using an FFT-based algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1305247)