The adaptive cross approximation algorithm for accelerated method of moments computations of EMC problems

By Kezhong Zhao, Marinos N. Vouvakis, Jin-Fa Lee. IEEE transactions on electromagnetic compatibility (Print), 2005

676 citations recorded by the source corpus.

Subfields: Atomic and Molecular Physics, and Optics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/8a1e93cfa547885673671cb937c50979043b7bf6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Atomic and Molecular Physics, and Optics

In Electrical and Electronic Engineering

Citations in the corpus

Direct Solve of Electrically Large Integral Equations for Problem Sizes to 1 M Unknowns (2008, methodology): “A good review of existing “fast” methods for electromagnetic surface integral equations such as FMM, AIM, pFFT, MLFMM, IES3 has been presented by Zhao, Vouvakis, and Lee [ 1 ].”
A review on array mutual coupling analysis (2011, methodology): “…and that faster methods, based on multipole decompositions [Coifman et al., 1993; Craeye, 2006] and on the ACA [Bebendorf and Rjasanow, 2003; Zhao et al., 2005; Maaskant et al., 2008] have been developed to dramatically reduce the computation time of the reduced system of equations,…”
A fast 3D dual boundary element method based on hierarchical matrices (2008, background): “…some benchmark tests reported in the papers devoted to the development of the technique, see for example the work of Bebendorf and Rjasanow (2003), interesting applications to various electromagnetic problems have been proposed by Kurz et al. (2002), Zhao et al. (2005) and Ostrowski et al. (2006).”
Fast Analysis of Large Antenna Arrays Using the Characteristic Basis Function Method and the Adaptive Cross Approximation Algorithm (2008, methodology): “The details of the ACA algorithm are well described in [24] using Matlab’s notation.”
A Domain Decomposition Method With Nonconformal Meshes for Finite Periodic and Semi-Periodic Structures (2007, methodology): “For this problem, matrix compression using QR factorization [10], [18], [19] is not expected to be optimum, reducing memory only to 17 MB and requiring 6 seconds of additional CPU time.”
Fast Direct Methods for Gaussian Processes (2014, background): “ include techniques like pseudo-skeletal approximations [26], interpolatory decomposition [21], randomized algorithms [23], [41], [62], rank-revealing LU[44], [48], adaptive cross approximation [50], [66] (which is a minor variant of partial-pivoted LU), and rank-revealing QR [32]. Though purely ana”
Multilevel Fast Adaptive Cross-Approximation Algorithm With Characteristic Basis Functions (2015, methodology): “To name a few, this kind of approach includes the matrix decomposition algorithm (MDA) [4], [5], the UV method [6], [7], the QR-based methods [8], [9], and the adaptive cross-approximation (ACA) algorithm [10], [11].”