Abstract
The paper further develops the recently introduced idea of compressing the impedance matrix by an iterative selection of expansion functions. The improved algorithm uses an overcomplete dictionary comprising bases whose inherent properties match some features of the given scattering problem. Thus, the overcomplete dictionary offers a variety of expansion functions from which a solution-oriented spanning set for the unknown current is extracted. The number of iterations in the proposed algorithm is suppressed by selecting more than one expansion function at each iteration. This latter section is facilitated by a matching pursuit process. It is shown that the compression ratio of the resultant compressed impedance matrix is superior to the one achieved by the ordinary iterative matrix compression algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
