Premium
A sparse multiresolution technique for fast capacitance computation
Author(s) -
Jandhyala Vikram,
Michielssen Eric,
Mittra Raj
Publication year - 1996
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/(sici)1098-2760(19960405)11:5<242::aid-mop2>3.0.co;2-e
Subject(s) - capacitance , computation , computer science , electronic engineering , computational science , algorithm , physics , engineering , electrode , quantum mechanics
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.