A Parallel Full Geometric Multigrid Solver for Time Harmonic Maxwell Problems
The design of scalable parallel simulation codes for complex phenomena is challenging. For simulations that rely on PDE solution on complex three-dimensional (3D) geometries, all the components ranging from the initialization phases to the ultimate linear system solution must be efficiently parallel...
Gespeichert in:
Veröffentlicht in: | SIAM journal on scientific computing 2014-01, Vol.36 (2), p.C119-C138 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The design of scalable parallel simulation codes for complex phenomena is challenging. For simulations that rely on PDE solution on complex three-dimensional (3D) geometries, all the components ranging from the initialization phases to the ultimate linear system solution must be efficiently parallelized. In this paper we address the solution of 3D harmonic Maxwell's equations using a parallel geometric full multigrid scheme where only a coarse mesh, which resolves the object geometry, has to be supplied by an external mesh generator. The electromagnetic problem is solved on a refined mesh that complies with the discretization constraint that links the mesh size and the wavelength. The mesh hierarchy is built in parallel using an automatic mesh refinement technique, and parallel matrix-free calculations are performed to process all the finer meshes in the multigrid hierarchy. Only the linear system on the coarse mesh is assembled and solved by a parallel sparse direct solver. We illustrate the numerical robustness of the proposed scheme on large 3D complex geometries and assess the parallel scalability of the implementation on large problems with up to 1.3 billion unknowns on a few hundred cores. [PUBLICATION ABSTRACT] |
---|---|
ISSN: | 1064-8275 1095-7197 |
DOI: | 10.1137/130909512 |