High-order transmission conditions in a domain decomposition method for the time-harmonic Maxwell's equations in inhomogeneous media

A one-way domain decomposition method (DDM) is considered for the solution of the time-harmonic electromagnetic scattering problem by inhomogeneous penetrable 3-D objects: the computational domain is partitioned into concentric subdomains and an integral representation (IR) of the electromagnetic fi...

Full description

Saved in:
Bibliographic Details
Published inJournal of computational physics Vol. 372; pp. 385 - 405
Main Authors Stupfel, Bruno, Chanaud, Mathieu
Format Journal Article
LanguageEnglish
Published Cambridge Elsevier Inc 01.11.2018
Elsevier Science Ltd
Subjects
Online AccessGet full text
ISSN0021-9991
1090-2716
DOI10.1016/j.jcp.2018.06.050

Cover

More Information
Summary:A one-way domain decomposition method (DDM) is considered for the solution of the time-harmonic electromagnetic scattering problem by inhomogeneous penetrable 3-D objects: the computational domain is partitioned into concentric subdomains and an integral representation (IR) of the electromagnetic fields on the outer boundary constitutes an exact radiation condition. The corresponding numerical code is efficiently parallelized and the full IR matrices are compressed in order to expedite the solution of very large problems. Exact and approximate high-order transmission conditions (HOTC) are obtained for the model problem of a multi-layer planar structure. Their application to real world objects is investigated in terms of well-posedness and numerical complexity. New well-posed low complexity HOTCs are proposed that speed up the convergence of the DDM algorithm. •New well posed and numerically cheap high order transmission conditions for inhomogeneous media.•Large full matrices arising from the exact radiation condition are compressed via ACA.•Parallelized numerical code.•Very accurate numerical results obtained on electrically large objects involving up to 160 million unknowns with a reasonable numerical complexity.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0021-9991
1090-2716
DOI:10.1016/j.jcp.2018.06.050