A single-level dual rank IE-QR algorithm to model large microstrip antenna arrays

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²) 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³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.