Fast capacitance extraction of general three-dimensional structures

K. Nabors and J. White (1991) presented a boundary-element-based algorithm for computing the capacitance of three-dimensional m-conductor structures whose computational complexity grows nearly as mn, where n is the number of elements used to discretize the conductor surfaces. In that algorithm, a generalized conjugate residual iterative technique is used to solve the n*n linear system arising from the discretization, and a multipole algorithm is used to compute the iterates. Several improvements to that algorithm are described which make the approach applicable and computationally efficient for almost any geometry of conductors in a homogeneous dielectric. Results using these techniques in a program which computes the capacitance of general 3D structures are presented to demonstrate that the new algorithm is nearly as accurate as the more standard direct factorization approach, and is more than two orders of magnitude faster for large examples.>