Fast steepest descent path algorithm (FASDPA) for analyzing scattering from two-dimensional scatterers

E. Michielssen; W. C. Chew

Fast steepest descent path algorithm (FASDPA) for analyzing scattering from two-dimensional scatterers

E. Michielssen, W. C. Chew

Electrical and Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

Abstract

FASDPA is proposed as a novel technique for accelerating the iterative solution of integral equations for surface scatterers. The FASDPA hybridizes the previously developed FMM and MDA. The computation complexity and memory requirements of the algorithm are O(N^4/3InN) and can be further reduced to O(N^4/3) in a straightforward manner.

Original language	English (US)
Pages (from-to)	1754-1757
Number of pages	4
Journal	IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)
Volume	3
State	Published - 1996
Event	Proceedings of the 1996 AP-S International Symposium & URSI Radio Science Meeting. Part 1 (of 3) - Baltimore, MD, USA Duration: Jul 21 1996 → Jul 26 1996

ASJC Scopus subject areas

Electrical and Electronic Engineering

Library availability

Discover UIUC Full Text

Cite this

@article{335518d234df47fb8dbaa7e1c3c48db3,

title = "Fast steepest descent path algorithm (FASDPA) for analyzing scattering from two-dimensional scatterers",

abstract = "FASDPA is proposed as a novel technique for accelerating the iterative solution of integral equations for surface scatterers. The FASDPA hybridizes the previously developed FMM and MDA. The computation complexity and memory requirements of the algorithm are O(N4/3InN) and can be further reduced to O(N4/3) in a straightforward manner.",

author = "E. Michielssen and Chew, {W. C.}",

year = "1996",

language = "English (US)",

volume = "3",

pages = "1754--1757",

journal = "IEEE Antennas and Propagation Society, AP-S International Symposium (Digest)",

issn = "0272-4693",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 1996 AP-S International Symposium & URSI Radio Science Meeting. Part 1 (of 3) ; Conference date: 21-07-1996 Through 26-07-1996",

}

TY - JOUR

T1 - Fast steepest descent path algorithm (FASDPA) for analyzing scattering from two-dimensional scatterers

AU - Michielssen, E.

AU - Chew, W. C.

PY - 1996

Y1 - 1996

N2 - FASDPA is proposed as a novel technique for accelerating the iterative solution of integral equations for surface scatterers. The FASDPA hybridizes the previously developed FMM and MDA. The computation complexity and memory requirements of the algorithm are O(N4/3InN) and can be further reduced to O(N4/3) in a straightforward manner.

AB - FASDPA is proposed as a novel technique for accelerating the iterative solution of integral equations for surface scatterers. The FASDPA hybridizes the previously developed FMM and MDA. The computation complexity and memory requirements of the algorithm are O(N4/3InN) and can be further reduced to O(N4/3) in a straightforward manner.

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

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

M3 - Conference article

AN - SCOPUS:0029726313

SN - 0272-4693

VL - 3

SP - 1754

EP - 1757

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

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

T2 - Proceedings of the 1996 AP-S International Symposium & URSI Radio Science Meeting. Part 1 (of 3)

Y2 - 21 July 1996 through 26 July 1996

ER -

Fast steepest descent path algorithm (FASDPA) for analyzing scattering from two-dimensional scatterers

Abstract

ASJC Scopus subject areas

Library availability

Related links

Fingerprint

Cite this