Abstract
In this paper, we discuss discrete wavelet transforms for Toeplitz matrices and block–Toeplitz–Toeplitz–block matrices. The main contribution of this paper is to give the Toeplitz-like structure of the wavelet transformed Toeplitz matrices, and show that the computational cost for such structure is O(k3ln) where n is the size of the Toeplitz matrix, k is the order of the wavelet and l is the level used in the wavelet transform. The comparison between the wavelet transformed Toeplitz matrices and the Fourier transformed Toeplitz matrices is also given.
| Original language | English |
|---|---|
| Pages (from-to) | 269-285 |
| Number of pages | 17 |
| Journal | Linear Algebra and Its Applications |
| Volume | 370 |
| DOIs | |
| Publication status | Published - 1 Sept 2003 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 9 Industry, Innovation, and Infrastructure
User-Defined Keywords
- Toeplitz matrix
- Circulant matrix
- Discrete wavelet transforms
- Discrete Fourier transform
- Toeplitz-like structure
Fingerprint
Dive into the research topics of 'Discrete wavelet transforms for Toeplitz matrices'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver