Sequential and parallel preconditioners for Large-scale integral-equation problems

Download

index.pdf

Date

2007-08-31

Author

Malas, Tahir
Ergül, Özgür Salih
Gürel, Levent

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

86
views

0
downloads

For efficient solutions of integral-equation methods via the multilevel fast multipole algorithm (MLFMA), effective preconditioners are required. In this paper we review appropriate preconditioners that have been used for sparse systems and developed specially in the context of MLFMA. First we review the ILU-type preconditioners that are suitable for sequential implementations. We can make these preconditioners robust and efficient for integral-equation methods by making appropriate selections and by employing pivoting to suppress the instability problem. For parallel implementations, the sparse approximate inverse or the iterative solution of the near-field system enables fast convergence up to certain problem sizes. However, for very large problems, the near-field matrix itself becomes insufficient to approximate the dense system matrix and preconditioners generated from the near-field interactions cannot be effective. Therefore, we propose an approximation strategy to MLFMA to be used as an effective preconditioner. Our numerical experiments reveal that this scheme significantly outperforms other preconditioners. With the combined effort of effective preconditioners and an efficiently parallelized MLFMA, we are able to solve problems with tens of millions of unknowns in a few hours. We report the solution of integral-equation problems that are among the largest in their classes.

URI

https://hdl.handle.net/11511/37521

DOI

https://doi.org/10.1109/cem.2007.4387648

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2008-01-03) A hierarchical parallelisation of the multilevel fast multipole algorithm (MLFMA) for the efficient solution of large-scale problems in computational electromagnetics is presented. The tree structure of MLFMA is distributed among the processors by partitioning both the clusters and the samples of the fields appropriately for each level. The parallelisation efficiency is significantly improved compared to previous approaches, where only the clusters or only the fields are partitioned in a level.
PARALLEL MULTILEVEL FAST MULTIPOLE ALGORITHM FOR COMPLEX PLASMONIC METAMATERIAL STRUCTURES Ergül, Özgür Salih (2013-11-09) A parallel implementation of the multilevel fast multipole algorithm (MLFMA) is developed for fast and accurate solutions of electromagnetics problems involving complex plasmonic metamaterial structures. Composite objects that consist of multiple penetrable regions, such as dielectric, lossy, and plasmonic parts, are formulated rigorously with surface integral equations and solved iteratively via MLFMA. Using the hierarchical strategy for the parallelization, the developed implementation is capable of simul...
Nested Iterative Solutions of Electromagnetic Problems Using Approximate Forms of the Multilevel Fast Multipole Algorithm Onol, Can; Ucuncu, Arif; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2017-03-24) Nested iterative solutions using full and approximate forms of the multilevel fast multipole algorithm (MLFMA) are presented for efficient analysis of electromagnetic problems. The developed mechanism is based on preconditioning an iterative solution via another iterative solution, and this way, nesting multiple solutions as layers. The accuracy is systematically reduced from top to bottom by using the on-the-fly characteristics of MLFMA, as well as the iterative residual errors. As a demonstration, a three...
Rigorous Solutions of Large-Scale Scattering Problems Discretized with Hundreds of Millions of Unknowns Guerel, L.; Ergül, Özgür Salih (2009-09-18) We present fast and accurate solutions of large-scale scattering problems using a parallel implementation of the multilevel fast multipole algorithm (MLFMA). By employing a hierarchical partitioning strategy, MLFMA can be parallelized efficiently on distributed-memory architectures. This way, it becomes possible to solve very large problems discretized with hundreds of millions of unknowns. Effectiveness of the developed simulation environment is demonstrated on various scattering problems involving canonic...
Numerical methods for multiphysics flow problems Belenli Akbaş, Mine; Kaya Merdan, Songül; Rebholz, Leo G.; Department of Mathematics (2016) In this dissertation, efficient and reliable numerical algorithms for approximating solutions of multiphysics flow problems are investigated by using numerical methods. The interaction of multiple physical processes makes the systems complex, and two fundamental difficulties arise when attempting to obtain numerical solutions of these problems: the need for algorithms that reduce the problems into smaller pieces in a stable and accurate way and for large (sometimes intractable) amount of computational resou...

Citation Formats

T. Malas, Ö. S. Ergül, and L. Gürel, “Sequential and parallel preconditioners for Large-scale integral-equation problems,” 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/37521.