No abstract

We presen t a new algorithm for computing the capacitance of three-dimensional perfect electrical conductors of complex structures. The new algorithm is signi cantly faster and uses much less memory than previous best algorithms, and is kernel independent.The new algorithm is based on a hierarchical algorithm for the n-body problem, and is an acceleration of the boundaryelement method for solving the integral equation associated with the capacitance extraction problem. The algorithm rst adaptively subdivides the conductor surfaces into panels according to an estimation of the potential coe cients and a user-supplied error bound. The algorithm stores the poten tial coe cient matrix in a hierarchical data structure of size On, although the matrix is size n 2 if expanded explicitly , wheren is the n umber of panels. The hierarchical data structure allows us to multiply the coe cient matrix with an y vector in On time. Finally, w e use a generalized minimal residual algorithm to solve m linear systems each of size n n in Omn time, where m is the n umberof conductors.The new algorithm is implemented and the performance is compared with previous best algorithms. F or the k k bus example, our algorithm is 100 to 40 times faster than F astCap, and uses 1=100 to 1=60 of the memory used by F astCap. The results computed by the new algorithm are within 2.7 from that computed by F astCap.

No abstract

Abstract. The method of moments (MOM) is applied to the problem of electromagnetic scattering from general three-dimensional dielectric targets in an arbitrary multilayered environment. The dyadic multilayered Green's function is computed via the method of complex images, and the Galerkin MOM solution is effected by employing triangular patch basis functions. Several example frequency and time domain results are presented, with application to radar-based sensing of plastic land mines.

No abstract