A multilevel matrix decomposition algorithm for analyzing scattering from large structures

Eric Michielssen; Amir Boag

doi:10.1109/8.511816

A multilevel matrix decomposition algorithm for analyzing scattering from large structures

Eric Michielssen^*, Amir Boag

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

A multilevel algorithm is presented for analy/ing scattering from electrically large surfaces. The algorithm accelerates the iterative solution of integral equations that arise in computational electromagnetics. The algorithm permits a fast matrix-vector multiply by decomposing the traditional method of moment matrix into a large number of blocks, with each describing the interaction between distant scatterers. The multiplication of each block by a trial solution vector is executed using a multilevel scheme that resembles a fast Fourier transform (FFT) and that only relies on well-known algebraic techniques. The computational complexity and the memory requirements of the proposed algorithm are O(/Vlog2 A').

Original language	English
Pages (from-to)	1086-1093
Number of pages	8
Journal	IEEE Transactions on Antennas and Propagation
Volume	44
Issue number	8
DOIs	https://doi.org/10.1109/8.511816
State	Published - 1996
Externally published	Yes

Access to Document

10.1109/8.511816

Cite this

@article{52c875b2b4f944bebf152f4da995b486,

title = "A multilevel matrix decomposition algorithm for analyzing scattering from large structures",

abstract = "A multilevel algorithm is presented for analy/ing scattering from electrically large surfaces. The algorithm accelerates the iterative solution of integral equations that arise in computational electromagnetics. The algorithm permits a fast matrix-vector multiply by decomposing the traditional method of moment matrix into a large number of blocks, with each describing the interaction between distant scatterers. The multiplication of each block by a trial solution vector is executed using a multilevel scheme that resembles a fast Fourier transform (FFT) and that only relies on well-known algebraic techniques. The computational complexity and the memory requirements of the proposed algorithm are O(/Vlog2 A').",

author = "Eric Michielssen and Amir Boag",

note = "Funding Information: Manuscript received June 23, 1995; revised December 21, 1995. This work was supported in part by the National Science Foundation under Grant ECS-9 502 138. E. Michielssen is with the Electromagnetic Communication Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801 USA. A. Boag is with the Israel Aircraft Industries, Department 4464, Ben-Gunon Airport 70100, Israel. Publisher Item Identifier S 001 8-926X(96)04753-9.",

year = "1996",

doi = "10.1109/8.511816",

language = "אנגלית",

volume = "44",

pages = "1086--1093",

journal = "IEEE Transactions on Antennas and Propagation",

issn = "0018-926X",

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

number = "8",

}

TY - JOUR

T1 - A multilevel matrix decomposition algorithm for analyzing scattering from large structures

AU - Michielssen, Eric

AU - Boag, Amir

N1 - Funding Information: Manuscript received June 23, 1995; revised December 21, 1995. This work was supported in part by the National Science Foundation under Grant ECS-9 502 138. E. Michielssen is with the Electromagnetic Communication Laboratory, University of Illinois at Urbana-Champaign, Urbana, IL 61801 USA. A. Boag is with the Israel Aircraft Industries, Department 4464, Ben-Gunon Airport 70100, Israel. Publisher Item Identifier S 001 8-926X(96)04753-9.

PY - 1996

Y1 - 1996

N2 - A multilevel algorithm is presented for analy/ing scattering from electrically large surfaces. The algorithm accelerates the iterative solution of integral equations that arise in computational electromagnetics. The algorithm permits a fast matrix-vector multiply by decomposing the traditional method of moment matrix into a large number of blocks, with each describing the interaction between distant scatterers. The multiplication of each block by a trial solution vector is executed using a multilevel scheme that resembles a fast Fourier transform (FFT) and that only relies on well-known algebraic techniques. The computational complexity and the memory requirements of the proposed algorithm are O(/Vlog2 A').

AB - A multilevel algorithm is presented for analy/ing scattering from electrically large surfaces. The algorithm accelerates the iterative solution of integral equations that arise in computational electromagnetics. The algorithm permits a fast matrix-vector multiply by decomposing the traditional method of moment matrix into a large number of blocks, with each describing the interaction between distant scatterers. The multiplication of each block by a trial solution vector is executed using a multilevel scheme that resembles a fast Fourier transform (FFT) and that only relies on well-known algebraic techniques. The computational complexity and the memory requirements of the proposed algorithm are O(/Vlog2 A').

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

U2 - 10.1109/8.511816

DO - 10.1109/8.511816

M3 - מאמר

AN - SCOPUS:0030216149

VL - 44

SP - 1086

EP - 1093

JO - IEEE Transactions on Antennas and Propagation

JF - IEEE Transactions on Antennas and Propagation

SN - 0018-926X

IS - 8

ER -

A multilevel matrix decomposition algorithm for analyzing scattering from large structures

Abstract

Access to Document

Other files and links

Fingerprint

Cite this