A sparse multiresolution technique for fast capacitance computation
β Scribed by Vikram Jandhyala; Eric Michielssen; Raj Mittra
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 637 KB
- Volume
- 11
- Category
- Article
- ISSN
- 0895-2477
No coin nor oath required. For personal study only.
β¦ Synopsis
A technique for mpidly computing the capacitances of two-dimensional conducting structures is presented in fhis 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 complaiy of matrix-uector 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 soloer, and preserves high accuracy. Moreouer, in contrast to the popular fast-multiple technique, the proposed method is not Green's-function specific; it can be used in conjunction with different static Green ' s functions representing varied configumtions, including perfect electric conductors and stratified dielectric layers.
π SIMILAR VOLUMES
Bar-Chaim, and I. Urym, Designing high dynamic range fibre-optic links: A comparison between directly-modulated Fabry-Perot and distributed-feedback laser Ε½ .
## Abstract Integralβequation methodologies applied to extract parasitics for board, package, and onβchip structures involve solving a dense system of equations. In this paper, we present an improved matrixβcompression technique for fast iterative solution of such dense systems, which applies QR de
An adaptive, multipole-accelerated technique is presented for the fast computation of capacitances of conducting structures that reside in stratified dielectric media. This technique is an extension of a previously reported method of moments based approach that uses a nonadaptive fast-multipole algo
This paper presents a design methodology for developing efficient distributed-memory parallel programs for block recursive algorithms such as the fast Fourier transform (FFT) and bitonic sort. This design methodology is specifically suited for most modern supercomputers having a distributed-memory a