Abstract
This paper considers the problem of wavelet sparsification of matrices arising in the numerical solution of electromagnetic integral equations by the method of moments. Scattering of plane waves from two-dimensional (2-D) cylinders is computed numerically using a constant number of test functions per wavelength. Discrete wavelet packet (DWP) similarity transformations and thresholding are applied to system matrices to obtain sparsity. If thresholds are selected to keep the relative residual error constant the matrix sparsity is of order O(N/sup P/) with p<2. This stands in contrast with O(N/sup 2/) sparsities obtained with standard wavelet transformations. Numerical tests also show that the DWP method yields faster matrix-vector multiplication than some fast multipole algorithms.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.