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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1346137
Language Label Description Also known as
default for all languages
No label defined
    English
    Computation of Battle-Lemarie wavelets using an FFT-based algorithm
    scientific article; zbMATH DE number 1346137

      Statements

      Computation of Battle-Lemarie wavelets using an FFT-based algorithm (English)
      0 references
      0 references
      0 references
      0 references
      19 July 2000
      0 references
      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)].
      0 references
      Lemarie-Battle wavelets
      0 references
      fast Fourier transform
      0 references
      algorithm
      0 references
      Lemarie-Battle scaling functions
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references