New and more efficient formulation of MLMDA for arbitrary 3D antennas and scatterers

The Multilevel Matrix Decomposition Algorithm (MLMDA) was originally developed by Michielsen and Boag for 2-D TMz scattering problems and later implemented in 3-D by Rius et al. The 3-D MLMDA was particularly efficient and accurate for piece-wise planar objects such as printed antennas. However, for...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2006 First European Conference on Antennas and Propagation s. 1 - 6
Hlavní autoři: Rius, J.M., Heldring, A., Tamayo, J.M., Parron, J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.11.2006
Témata:
Green's function methods
Impedance
Integral equations
Iterative algorithms
Iterative methods
Matrix decomposition
Microstrip antenna arrays
MLFMA
Scattering
Transmission line matrix methods
ISBN:9290929375, 9789290929376
ISSN:2164-3342
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The Multilevel Matrix Decomposition Algorithm (MLMDA) was originally developed by Michielsen and Boag for 2-D TMz scattering problems and later implemented in 3-D by Rius et al. The 3-D MLMDA was particularly efficient and accurate for piece-wise planar objects such as printed antennas. However, for arbitrary 3-D problems it was not as efficient as the Multilevel Fast Multipole Algorithm (MLFMA). This paper will introduce some improvements in 3-D MLMDA, like new placement of equivalent functions and SVD post-compression, that make it comparable with MLFMA in terms of computation time and memory requirements, but more accurate.
ISBN:9290929375
9789290929376
ISSN:2164-3342
DOI:10.1109/EUCAP.2006.4584551