Abstract
A single-level dual rank IE-QR algorithm is introduced so that the resulting dense method of moments (MOM) matrix is efficiently compressed. For a system of N equations, an amount of work of the order O(N/sup 2/) has traditionally been required for both matrix assembly and matrix-vector multiplication in an iterative matrix solver. The algorithm of the present paper reduces the memory requirement and CPU time for both matrix assembly and matrix-vector multiplication to O(N/sup 3/2/) making it practical to solve for large antenna arrays with full wave approach. In conjunction with a "geometric-neighboring" preconditioner for matrix solution using GMRES, the current approach solves problems involving large antenna arrays using only a fraction of what are needed by conventional MOM both in term of memory and total CPU time.
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.
