Increasing the Butterfly-Compressibility of Moment Matrix Blocks: A Quantitative Study

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


The butterfly (BF)-compressibility of moment matrix blocks is studied quantitatively for various geometrical configurations and compression algorithm parameters. To enable investigation of electrically large geometries, the methodology employs simplified expressions for the compressed memory and fast low-rank (LR)-Approximation techniques. The study indicates that a block's optimal BF-compression is obtained for a nontrivial choice of the BF's depth, determined by the underlying geometrical configuration and compression threshold. It is also shown that reduced-dimensionality interactions are more BF-compressible. In particular, the optimal compressibility for the recently introduced generalized equivalence and generalized source integral equations is shown to be dependent on their effective dimensionality, which is dictated by the compression threshold. At high thresholds, these formulations are more BF-compressible than their conventional counterparts. The implications for the design of BF-compression-based solvers, in a geometrically adaptive manner, are discussed.

Original languageEnglish
Article number9115872
Pages (from-to)588-593
Number of pages6
JournalIEEE Transactions on Antennas and Propagation
Issue number1
StatePublished - 1 Jan 2021


  • Fast solvers
  • integral equations (IEs)
  • moment methods

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Increasing the Butterfly-Compressibility of Moment Matrix Blocks: A Quantitative Study'. Together they form a unique fingerprint.

Cite this