Efficient fill of a nested representation of the EFIE at low frequencies

Jin Cheng, S. A. Maloney, R. J. Adams, F. X. Canning

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

A procedure for filling a nested representation of the EFIE impedance matrix is discussed. At low frequencies, the memory complexity of the method is approximately O(N), and the CPU complexity is approximately O(N log N). The reconstruction error is also computed to demonstrate that the fill procedure provides an error-controlled representation over several orders of magnitude.

Original languageEnglish
Title of host publication2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI
DOIs
StatePublished - 2008
Event2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI - San Diego, CA, United States
Duration: Jul 5 2008Jul 12 2008

Publication series

Name2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI

Conference

Conference2008 IEEE International Symposium on Antennas and Propagation and USNC/URSI National Radio Science Meeting, APSURSI
Country/TerritoryUnited States
CitySan Diego, CA
Period7/5/087/12/08

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Fingerprint

Dive into the research topics of 'Efficient fill of a nested representation of the EFIE at low frequencies'. Together they form a unique fingerprint.

Cite this