2016
DOI: 10.1109/tap.2015.2500908
|View full text |Cite
|
Sign up to set email alerts
|

Domain Decomposition Preconditioning for Surface Integral Equations in Solving Challenging Electromagnetic Scattering Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
29
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 93 publications
(31 citation statements)
references
References 67 publications
0
29
0
Order By: Relevance
“…Both the simulation capability and modeling fidelity of the proposed solver are expected to scale with the exponential growth in computing power. To realize this objective, advances have been made on three fronts: (i) a geometry-adaptive discontinuous Galerkin boundary element method (DG-BEM) [1], which permits the use of nonconformal surface discretizations and facilitates the mesh generation task for high-definition objects; (ii) a non-overlapping additive Schwarz domain decomposition (DD) method for the iterative solution of the DG-BEM matrix equations, which leads to scalable convergence in the DD iterations [2], [3]; (iii) parallel and adaptive computational algorithms to reduce the time complexity of very large-scale simulations via distributed memory HPC architectures.…”
Section: Technical Approachmentioning
confidence: 99%
“…Both the simulation capability and modeling fidelity of the proposed solver are expected to scale with the exponential growth in computing power. To realize this objective, advances have been made on three fronts: (i) a geometry-adaptive discontinuous Galerkin boundary element method (DG-BEM) [1], which permits the use of nonconformal surface discretizations and facilitates the mesh generation task for high-definition objects; (ii) a non-overlapping additive Schwarz domain decomposition (DD) method for the iterative solution of the DG-BEM matrix equations, which leads to scalable convergence in the DD iterations [2], [3]; (iii) parallel and adaptive computational algorithms to reduce the time complexity of very large-scale simulations via distributed memory HPC architectures.…”
Section: Technical Approachmentioning
confidence: 99%
“…Moreover, the stability and convergence have been validated for targets with sharp edges and corners. Along the line of this research, we herein employ a non-symmetric interior penalty formulation [34]. Although it results in non-symmetric coupling matrices after the finite dimensional discretization, it enjoys the remarkable property of discrete ellipticity of the weak formulation and well-posedness of the discrete formulation.…”
Section: Discontinuous Galerkin Formulationmentioning
confidence: 99%
“…In the DG method, the computational domain is first divided into smaller subdomains. By independently meshing each subdomain and developing a preconditioner based on the domain decomposition, the mesh generation process can be significantly simplified, and the condition of the matrix is improved . DG‐SIE methods have been developed for PEC targets and for homogeneous dielectric objects .…”
Section: Introductionmentioning
confidence: 99%