A multilevel matrix decomposition algorithm for analyzing scattering from large structures

A multilevel algorithm is presented for analyzing 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 multiplication by decomposing the traditional...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on antennas and propagation Vol. 44; no. 8; pp. 1086 - 1093
Main Authors: Michielssen, E., Boag, A.
Format: Journal Article
Language:English
Published: IEEE 01.08.1996
Subjects:
Acceleration
Algorithm design and analysis
Computational complexity
Computational electromagnetics
Electromagnetic scattering
Fast Fourier transforms
Integral equations
Iterative algorithms
Matrix decomposition
Moment methods
ISSN:0018-926X, 1558-2221
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A multilevel algorithm is presented for analyzing 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 multiplication 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(N log/sup 2/ N).
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-926X
1558-2221
DOI:10.1109/8.511816