GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
A fast algorithm for particle simulations
Journal of Computational Physics
Introduction to algorithms
A rapid hierarchical radiosity algorithm
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
The order of Appel's algorithm
Information Processing Letters
DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
SIAM Journal on Scientific Computing
A precorrected-FFT method for capacitance extraction of complicated 3-D structures
ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Matrix computations (3rd ed.)
A fast method of moments solver for efficient parameter extraction of MCMs
DAC '97 Proceedings of the 34th annual Design Automation Conference
IES3: a fast integral equation solver for efficient 3-dimensional extraction
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
A multiscale method for fast capacitance extraction
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Interconnect analysis: from 3-D structures to circuit models
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Proceedings of the 37th Annual Design Automation Conference
Large-scale capacitance calculation
Proceedings of the 37th Annual Design Automation Conference
Electromagnetic parasitic extraction via a multipole method with hierarchical refinement
ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Hierarchical computation of 3-D interconnect capacitance using direct boundary element method
ASP-DAC '00 Proceedings of the 2000 Asia and South Pacific Design Automation Conference
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Hierarchical interconnect circuit models
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Fast Inductance Extraction of Large VLSI Circuits
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
ICCD '00 Proceedings of the 2000 IEEE International Conference on Computer Design: VLSI in Computers & Processors
Spatially distributed 3D circuit models
Proceedings of the 42nd annual Design Automation Conference
BBE: hierarchical computation of 3-D interconnect capacitance with BEM block extraction
ASP-DAC '03 Proceedings of the 2003 Asia and South Pacific Design Automation Conference
"New-version-fast-multipole-method" accelerated electrostatic calculations in biomolecular systems
Journal of Computational Physics
Proceedings of the 45th annual Design Automation Conference
PiCAP: a parallel and incremental capacitance extraction considering stochastic process variation
Proceedings of the 46th Annual Design Automation Conference
Incremental large-scale electrostatic analysis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Proceedings of the 48th Design Automation Conference
A parallel and incremental extraction of variational capacitance with stochastic geometric moments
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
| Hi-index | 0.00 |
We presen t a new algorithm for computing the capacitance of three-dimensional perfect electrical conductors of complex structures. The new algorithm is significantly faster and uses muc h 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 boundary-element method for solving the integral equation associated with the capacitance extraction problem. The algorithm first adaptively subdivides the conductor surfaces into panels according to an estimation of the potential coefficients and a user-supplied error band. The algorithm stores the poten tial coefficient matrix in a hierarchical data structure of size O(n), although the matrix is size n2 if expanded explicitly, wheren is the n umber of panels. The hierarchical data structure allows us to multiply the coefficient matrix with an y vector in O(n) time. Finally, w e use a generalized minimal residual algorithm to solve m linear systems each of size n × n in O(mn) time, where m is the n umber of 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 FastCap.