GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Domain decomposition: parallel multilevel methods for elliptic partial differential equations
Nodal high-order methods on unstructured grids
Journal of Computational Physics
Mixed Discontinuous Galerkin Approximation of the Maxwell Operator
SIAM Journal on Numerical Analysis
SIAM Journal on Scientific Computing
Locally divergence-free discontinuous Galerkin methods for the Maxwell equations
Journal of Computational Physics
ACM Transactions on Mathematical Software (TOMS)
Solution of the time-harmonic Maxwell equations using discontinuous Galerkin methods
Journal of Computational and Applied Mathematics
Nodal Discontinuous Galerkin Methods: Algorithms, Analysis, and Applications
Nodal Discontinuous Galerkin Methods: Algorithms, Analysis, and Applications
SIAM Journal on Numerical Analysis
Optimized Schwarz Methods for Maxwell's Equations
SIAM Journal on Scientific Computing
Locally implicit discontinuous Galerkin method for time domain electromagnetics
Journal of Computational Physics
A high-order non-conforming discontinuous Galerkin method for time-domain electromagnetics
Journal of Computational and Applied Mathematics
Hybridizable discontinuous Galerkin methods for the time-harmonic Maxwell's equations
Journal of Computational Physics
Journal of Computational and Applied Mathematics
Hi-index | 31.45 |
A Schwarz-type domain decomposition method is presented for the solution of the system of 3d time-harmonic Maxwell@?s equations. We introduce a hybridizable discontinuous Galerkin (HDG) scheme for the discretization of the problem based on a tetrahedrization of the computational domain. The discrete system of the HDG method on each subdomain is solved by an optimized sparse direct (LU factorization) solver. The solution of the interface system in the domain decomposition framework is accelerated by a Krylov subspace method. The formulation and the implementation of the resulting DD-HDG (Domain Decomposed-Hybridizable Discontinuous Galerkin) method are detailed. Numerical results show that the resulting DD-HDG solution strategy has an optimal convergence rate and can save both CPU time and memory cost compared to a classical upwind flux-based DD-DG (Domain Decomposed-Discontinuous Galerkin) approach.