Abstract
An algorithm for the compression of the method of moments (MoM) matrices is presented and demonstrated for representative examples. The algorithm employs the non-uniform grid approach to reduce by a significant factor the complexity of computing interacting and non-interacting subdomain modes to be used as basis and testing transformations. Compression ratios similar to those obtained by directly using the standard algebraic tools are achieved at a lower computational cost, thus allowing direct solution of fairly large problems.
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.
