A fast algorithm for electrically small composite objects

Yunhui Chu, Weng Cho Chew

Research output: Contribution to journalConference article

Abstract

A multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage.

Original languageEnglish (US)
Pages (from-to)3960-3963
Number of pages4
JournalIEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Volume4
StatePublished - Sep 28 2004
EventIEEE Antennas and Propagation Society Symposium 2004 Digest held in Conjunction with: USNC/URSI National Radio Science Meeting - Monterey, CA, United States
Duration: Jun 20 2004Jun 25 2004

Fingerprint

Composite materials
Program processors
Data storage equipment

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

A fast algorithm for electrically small composite objects. / Chu, Yunhui; Chew, Weng Cho.

In: IEEE Antennas and Propagation Society, AP-S International Symposium (Digest), Vol. 4, 28.09.2004, p. 3960-3963.

Research output: Contribution to journalConference article

@article{5b63687be9b84938af4862195059ac3a,
title = "A fast algorithm for electrically small composite objects",
abstract = "A multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage.",
author = "Yunhui Chu and Chew, {Weng Cho}",
year = "2004",
month = "9",
day = "28",
language = "English (US)",
volume = "4",
pages = "3960--3963",
journal = "AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)",
issn = "0272-4693",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A fast algorithm for electrically small composite objects

AU - Chu, Yunhui

AU - Chew, Weng Cho

PY - 2004/9/28

Y1 - 2004/9/28

N2 - A multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage.

AB - A multi-tree scheme to apply low-frequency multilevel fast multipole algorithm (LF-MLFMA) to electrically small composite objects, is described. An implementation of basis rearrangement is also presented to make the algorithm stable and capable of solving problems with large number of unknowns. For the scalar potential part in impedance matrix, divergence is taken on tree (RWG) basis to represent charges. When number of unknowns increases, the iteration count increases and eventually iterative solver fails to converge. The interactions between single patches are calculated by applying LF-MLFMA with O(N) CPU time and memory usage.

UR - http://www.scopus.com/inward/record.url?scp=4544347305&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4544347305&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:4544347305

VL - 4

SP - 3960

EP - 3963

JO - AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)

JF - AP-S International Symposium (Digest) (IEEE Antennas and Propagation Society)

SN - 0272-4693

ER -