The unified-FFT grid totalizing algorithm for fast O(N logN) method of moments electromagnetic analysis with accuracy to machine precision

Brian Rautio, Vladimir I. Okhmatovski, Jay Kyoon Lee

Research output: Contribution to journalArticle

1 Scopus citations

Abstract

While considerable progress has been made in the realm of speed-enhanced electromagnetic (EM) solvers, these fast solvers generally achieve their results through methods that introduce additional error components by way of geometric type approximations, sparse-matrix type approximations, multilevel type decomposition of interactions, and assumptions regarding the stochastic nature of EM problems. This work introduces the O(N logN) Unified-FFT grid totalizing (UFFT-GT) method, a derivative of method of moments (MoM), which achieves fast analysis with minimal to zero reduction in accuracy relative to direct MoM solution. The method uniquely combines FFT-enhanced Matrix Fill Operations (MFO) that are calculated to machine precision with FFT-enhanced Matrix Solve Operations (MSO) that are also calculated to machine precision, for an expedient solution that does not compromise accuracy.

Original languageEnglish (US)
Pages (from-to)101-114
Number of pages14
JournalProgress in Electromagnetics Research
Volume154
StatePublished - 2015

    Fingerprint

ASJC Scopus subject areas

  • Condensed Matter Physics
  • Radiation
  • Electrical and Electronic Engineering

Cite this