Improved LOGOS factorization algorithm for low-to-moderate frequencies

Xu Yuan, Xu Xin, Robert J. Adams

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

4 Scopus citations

Abstract

The advantages of the modifications summarized above (i.e., relaxed tolerance via (4) and fast ΘR factorization) for the algorithm indicated in Figure 1 are that: 1. The accuracy of the initial (sparse) representation of Z can be relaxed from O(ε2) to O(ε). 2. The LOGOS modes (both overlapped and non-overlapped) can be computed much more rapidly via the ΘR factorization. Numerical examples (2-D and 3-D) will be used to demonstrate these improvements. In particular, it will be shown that the proposed changes both reduce the total factorization times and memory requirements reported in [1]. For large problems, the total CPU costs are reduced by more than an order of magnitude.

Original languageEnglish
Title of host publication2007 IEEE Antennas and Propagation Society International Symposium, AP-S
Pages5579-5582
Number of pages4
DOIs
StatePublished - 2007
Event2007 IEEE Antennas and Propagation Society International Symposium, AP-S - Honolulu, HI, United States
Duration: Jun 10 2007Jun 15 2007

Publication series

NameIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
ISSN (Print)1522-3965

Conference

Conference2007 IEEE Antennas and Propagation Society International Symposium, AP-S
Country/TerritoryUnited States
CityHonolulu, HI
Period6/10/076/15/07

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Improved LOGOS factorization algorithm for low-to-moderate frequencies'. Together they form a unique fingerprint.

Cite this