On the computing algorithms of the hybrid FEM/MLFMA

Several computing algorithms of the hybrid FEM/MLFMA, the conventional algorithm (CA), the direct–iterative decomposition algorithm (DIDA), and a new one, the iterative–iterative decomposition algorithm (IIDA), are described in this Letter. The required computing resources of these three algorithms...

Full description

Saved in:

Bibliographic Details
Published in:	Microwave and optical technology letters Vol. 33; no. 4; pp. 265 - 268
Main Authors:	Sheng, Xin-Qing, Yung, Edward Kai-Ning
Format:	Journal Article
Language:	English
Published:	New York Wiley Subscription Services, Inc., A Wiley Company 20-05-2002
Subjects:	finite-element methods multilevel fast multipole algorithm numerical methods
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Several computing algorithms of the hybrid FEM/MLFMA, the conventional algorithm (CA), the direct–iterative decomposition algorithm (DIDA), and a new one, the iterative–iterative decomposition algorithm (IIDA), are described in this Letter. The required computing resources of these three algorithms are compared analytically and numerically. Several important numerical features of these algorithms are pointed out and confirmed. Criteria are given for the choice of computing algorithms. © 2002 Wiley Periodicals, Inc. Microwave Opt Technol Lett 33: 265–268, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.10293
Bibliography:	ark:/67375/WNG-5B7B0W2M-N istex:C0F4C45429621250E2456AC1DE566BC88242AB66 ArticleID:MOP10293 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
ISSN:	0895-2477 1098-2760
DOI:	10.1002/mop.10293