Abstract
In this paper, a novel scheme is presented for forming the matrix equations of multilevel adaptive cross approximation (MLACA) algorithm. The main idea of the proposed technique is to use the directional grouping scheme to subdivide the far-field domain of MLACA algorithm. By using the grouping scheme, the far-field interaction domain can be divided into many cone structures. The matrix between the observation group and far-field group in the cone structure is low-rank, which meets the directional far-field requirement. At the same time, the near-field interaction matrices are formed by the SVD(T) method to further reduce the total memory requirements. With the given techniques, the memory requirement of the novel grouping scheme for the far-field is much less than half of traditional MLACA algorithm. Meanwhile, the memory requirement of the SVD(T) method for the near-field is only about one-third of direct filling.
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.
