20081105
The multilevel fast multipole algorithm (MLFMA) is a powerful method for the fast and efficient solution of scattering and radiation problems in electromagnetics. Reallife problems formulated with surface integral equations can be solved iteratively, where the required matrixvector multiplications are performed efficiently by MLFMA. However, many reallife problems require discretizations with tens of millions of unknowns, which may not be handled easily with the sequential implementations of MLFMA running on a single processor. In order to achieve the solution of such large problems, MLFMA is parallelized on relatively inexpensive computing platforms with distributedmemory architectures. Unfortunately, parallelization of this algorithm is not trivial, and it can be difficult to obtain a sufficient parallelization efficiency, especially when the number of processors is large and problems involve complex objects. Recently, we developed a hierarchical partitioning strategy, which provides a higher parallelization efficiency than previous approaches. The resulting parallel implementation has been successfully used to solve very large electromagnetics
problems involving more than 200 million unknowns.
This talk will provide the details of the sophisticated simulation environment, which involves integralequation formulations, iterative solvers, preconditioners, parallel computing, and a highlyefficient parallelization of MLFMA, developed at Bilkent University Computational Electromagnetics Research Center (BiLCEM).
Category: CE SeminarTechnische Universität Darmstadt
Graduate School CE
Dolivostraße 15
D64293 Darmstadt

Send email to assistants' office
Show a list of open BSc/MSc topics at GSC CE.