Accuracy and efficiency considerations in the solution of extremely large electromagnetics problems
2011 Computational Electromagnetics International Workshop, CEM'11
136 - 139
Item Usage Stats
MetadataShow full item record
This study considers fast and accurate solutions of extremely large electromagnetics problems. Surface formulations of large-scale objects lead to dense matrix equations involving millions of unknowns. Thanks to recent developments in parallel algorithms and high-performance computers, these problems can easily be solved with unprecedented levels of accuracy and detail. For example, using a parallel implementation of the multilevel fast multipole algorithm (MLFMA), we are able to solve electromagnetics problems discretized with hundreds of millions of unknowns. Unfortunately, as the problem size grows, it becomes difficult to assess the accuracy and efficiency of the solutions, especially when comparing different implementations. This paper presents our efforts to solve extremely large electromagnetics problems with an emphasis on accuracy and efficiency. We present a list of benchmark problems, which can be used to compare different implementations for large-scale problems. © 2011 IEEE.
Multilevel fast multipole algorithms
Published Version (Please cite this version)http://dx.doi.org/10.1109/CEM.2011.6047347
Showing items related by title, author, creator and subject.
Yaman H.; Elloumi, S. (2012)We consider two problems that arise in designing two-level star networks taking into account service quality considerations. Given a set of nodes with pairwise traffic demand and a central hub, we select p hubs and connect ...
Erdoǧan, G.; Tansel, B. Ç. (Elsevier, 2011)The Quadratic Assignment Problem is one of the hardest combinatorial optimization problems known. We present two new classes of instances of the Quadratic Assignment Problem that can be reduced to the Linear Assignment ...
Avcı, S.; Aktürk, M. S.; Storer, R. H. (Taylor & Francis Inc., 2003)We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...