English

An $O(N^3)$ algorithm for the calculation of far field radiation patterns

Computational Physics 2013-11-05 v1

Abstract

We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of O(N3)O(N^3) instead of the standard O(N4)O(N^4). By mapping the far field with a cartesian coordinate system the 2D surface integral can be split into two successive 1D integrals. For a near field spanned by NX×NYN_X \times N_Y discrete sample points, and a far field spanned by Nθ×NϕN_{\theta} \times N_{\phi} points, the calculation can then be performed in O(NθNXNY)+O(NθNϕNY)O(N_{\theta}N_X N_Y) + O(N_{\theta}N_{\phi}N_Y) operations instead of O(NθNϕNXNY)O(N_{\theta}N_{\phi}N_X N_Y).

Keywords

Cite

@article{arxiv.1311.0854,
  title  = {An $O(N^3)$ algorithm for the calculation of far field radiation patterns},
  author = {Travis Garrett},
  journal= {arXiv preprint arXiv:1311.0854},
  year   = {2013}
}

Comments

8 pages, 7 figures

R2 v1 2026-06-22T02:00:51.995Z