A sparse multiresolution technique for fast capacitance computation
Article first published online: 7 DEC 1998
DOI: 10.1002/(SICI)1098-2760(19960405)11:5<242::AID-MOP2>3.0.CO;2-E
Copyright © 1995 John Wiley & Sons, Inc.
Additional Information
How to Cite
Jandhyala, V., Michielssen, E. and Mittra, R. (1996), A sparse multiresolution technique for fast capacitance computation. Microw. Opt. Technol. Lett., 11: 242–247. doi: 10.1002/(SICI)1098-2760(19960405)11:5<242::AID-MOP2>3.0.CO;2-E
Publication History
- Issue published online: 7 DEC 1998
- Article first published online: 7 DEC 1998
- Manuscript Received: 31 OCT 1995
Funded by
- Joint Services Electronics Program. Grant Number: N00014-90-J-1270
- Abstract
- References
- Cited By
Keywords:
- Multiresolution;
- fast Laplace solver;
- fast capacitance computation;
- static Green's functions
Abstract
A technique for rapidly computing the capacitances of two-dimensional conducting structures is presented in this article. The method relies on a sparse multiresolution representation of the interactions between subsections of the conductors. This decomposition is used to substantially reduce the computational complexity of matrix-vector products required in the iterative solution of the method-of-movements system. It is shown that this technique leads to large CPU-time savings over those required by a standard iterative solver, and preserves high accuracy. Moreover, in contrast to the popular fast-multipole technique, the proposed method is not Green's-function specific; it can be used in conjunction with different static Green's functions representing varied configurations, including perfect electric conductors and stratified dielectric layers. © 1996 John Wiley & Sons, Inc.

1098-2760/asset/MOP_left.gif?v=1&s=35f23837deb24d4faf2f9f4206c4fcac05cc2fa8)
1098-2760/asset/cover.gif?v=1&s=e392639464276853e6605df394388ece8e15fa91)