By Topic

Sparsity and conditioning of impedance matrices obtained with semi-orthogonal and bi-orthogonal wavelet bases

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Golik, W.L. ; Dept. of Math., St. Louis Commun. Coll., MO, USA

Wavelet and wavelet packet transforms are often used to sparsify dense matrices arising in the discretization of CEM integral equations. This paper compares orthogonal, semi-orthogonal, and bi-orthogonal wavelet and wavelet packet transforms with respect to the condition numbers, matrix sparsity, and number of iterations for the transformed systems. The best overall results are obtained with the orthogonal wavelet packet transforms that produce highly sparse matrices requiring fewest iterations. Among wavelet transforms the semi-orthogonal wavelet transforms lead to the sparsest matrices, but require too many iterations due to high condition numbers. The bi-orthogonal wavelets produce very poor sparsity and require many iterations and should not be used in these applications

Published in:

Antennas and Propagation, IEEE Transactions on  (Volume:48 ,  Issue: 4 )