Compressed block-decomposition algorithm for fast capacitance extraction

Alex Heldring, Juan M. Rius, José Maria Tamayo, Josep Parrón

Research output: Contribution to journalArticleResearchpeer-review

20 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)265-271
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume27
DOIs
Publication statusPublished - 1 Feb 2008

Keywords

  • Capacitance extraction
  • Fast direct solvers
  • Method of moments

Fingerprint Dive into the research topics of 'Compressed block-decomposition algorithm for fast capacitance extraction'. Together they form a unique fingerprint.

  • Cite this