J4

• Original Articles • Previous Articles     Next Articles

Fast wavelet transforms based on binary partition techniques

LI Yi-wei(1,2,3);YAN Yi-hua(2);SONG Guo-xiang(1)

  

  1. (1) School of Science, Xidian Univ., Xi′an 710071, China
    (2) National Astronomical Observatory, Chinese Academy of Science, Beijing 100012, China
    (3) School of Applied Science, Taiyuan University of Science and Technology, Taiyuan 030024, China
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-02-20 Published:2006-02-20

Abstract: A fast wavelet transform based on binary partition technique(BFWT) is proposed to apply an “almost to be” FWT to matrices with non-dyadic sizes, which can not be done by the standard FWT. Implemented as a software package in FORTRAN 90 with various orthonormal or biorthonormal wavelet filters, this new algorithm is desirable for fast resolution of large-scale dense linear systems resulting from discretization of multi-dimensional integral equationsl. An illustrative example is provided to demonstrate the validity and applicability of the algorithm.

Key words: fast wavelet transform, multi-dimensional integral equation, dense linear equations

CLC Number: 

  • O129