A nonuniform cartesian grid algorithm for fast field evaluation on elongated domains

Nadav Costa, Amir Boag

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

Abstract

A fast algorithm for field evaluation of time harmonic fields of two-dimensional source constellation with elongated geometry is presented. The algorithm relies on sampling the phase- and amplitude compensated fields produced by finite size radiating sources. Such fields behave as essentially bandlimited functions, which can be sampled over sparse nonuniform left- and right Cartesian grids. These grids are employed for both outgoing and incoming fields. Henceforth, the algorithm uses hierarchical subdivision of the complete scatterer into a binary tree of sub-domains. The required fields are gradually aggregated via a multilevel process passing up and down the tree. The algorithm attains linear computational complexity.

Original languageEnglish
Title of host publication2011 IEEE International Conference on Microwaves, Communications, Antennas and Electronic Systems, COMCAS 2011
DOIs
StatePublished - 2011
Event2011 IEEE International Conference on Microwaves, Communications, Antennas and Electronic Systems, COMCAS 2011 - Tel Aviv, Israel
Duration: 7 Nov 20119 Nov 2011

Publication series

Name2011 IEEE International Conference on Microwaves, Communications, Antennas and Electronic Systems, COMCAS 2011

Conference

Conference2011 IEEE International Conference on Microwaves, Communications, Antennas and Electronic Systems, COMCAS 2011
Country/TerritoryIsrael
CityTel Aviv
Period7/11/119/11/11

Keywords

  • Fast Algorithm
  • Integral equations
  • Iterative solvers
  • Method of Moments

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A nonuniform cartesian grid algorithm for fast field evaluation on elongated domains'. Together they form a unique fingerprint.

Cite this