z-logo
open-access-imgOpen Access
THE UNIFED-FFT GRID TOTALIZING ALGORITHM FOR FAST O(N LOG N) METHOD OF MOMENTS ELECTROMAGNETIC ANALYSIS WITH ACCURACY TO MACHINE PRECISION (Invited Paper)
Author(s) -
Brian J. Rautio,
Vladimir Okhmatovski,
Jay K. Lee
Publication year - 2015
Publication title -
electromagnetic waves
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 89
eISSN - 1559-8985
pISSN - 1070-4698
DOI - 10.2528/pier15110201
Subject(s) - fast fourier transform , grid , algorithm , method of moments (probability theory) , computer science , mathematics , statistics , geometry , estimator
(Invited Paper) 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 log N ) 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom