A novel algorithm, the compressed block decomposition, is presented for highly accelerated direct (noniterative) method-of-moment capacitance extraction. The algorithm is based on a blockwise subdivision of the method-of-moment potential coefficient matrix. Matrix subblocks corresponding to distant subregions of the problem geometry are not calculated directly but approximated in a compressed form. Subsequently, the matrix is decomposed using an algorithm that preserves the compression. The efficiency of the method is demonstrated on a common benchmark problem - a 6 × 6 bus crossing. The numerical cost of the algorithm is shown, both theoretically and numerically, to scale with N log3 N and the storage space with N log2 N. © 2008 IEEE.
|Journal||IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems|
|Publication status||Published - 1 Feb 2008|
- Capacitance extraction
- Fast direct solvers
- Method of moments
Heldring, A., Rius, J. M., Tamayo, J. M., & Parrón, J. (2008). Compressed block-decomposition algorithm for fast capacitance extraction. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 27, 265-271. https://doi.org/10.1109/TCAD.2007.907236