论文标题
加速Calderón预处理麦克斯韦传播问题
Accelerated Calderón preconditioning for Maxwell transmission problems
论文作者
论文摘要
我们研究了在电磁传输问题的边界积分方程方法中,用于加速Calderón(操作员)预处理的一系列技术。我们的目标是尽可能减轻稳定的运算符产品所需的barycentrientry缩放网格的高计算成本。我们的重点是众所周知的PMCHWT公式,但是我们引入的技术可以一般应用。通过仅用于预处理,而不是针对原始边界积分操作员,我们通过(i)使用“降低”Calderón预处理来实现大量降低计算成本,通过丢弃构成构成边界积分算子,这些构成构成边界积分算子对正规化不是必不可少的,并且(ii)在我们使用“ Bi-parametric”质量的情况下使用较低的质量(CHEA), $ \ MATHCAL {H} $ - 预处理程序的矩阵组装例程比原始操作员的矩阵程序集,包括在预处理器中丢弃远场相互作用的新方法。使用边界元素软件bempp(www.bempp.com),我们比较了在多个介电粒子散射的背景下,这些技术的不同组合的性能。将我们的加速实现应用于3D电磁散射,该聚集体由8个单位直径为1cm的单体冰晶体在664GHz时施加,与非加速实施相比,记忆成本下降了99%,总计算时间至少减少了75%。
We investigate a range of techniques for the acceleration of Calderón (operator) preconditioning in the context of boundary integral equation methods for electromagnetic transmission problems. Our objective is to mitigate as far as possible the high computational cost of the barycentrically-refined meshes necessary for the stable discretisation of operator products. Our focus is on the well-known PMCHWT formulation, but the techniques we introduce can be applied generically. By using barycentric meshes only for the preconditioner and not for the original boundary integral operator, we achieve significant reductions in computational cost by (i) using "reduced" Calderón preconditioners obtained by discarding constituent boundary integral operators that are not essential for regularisation, and (ii) adopting a "bi-parametric" approach in which we use a lower quality (cheaper) $\mathcal{H}$-matrix assembly routine for the preconditioner than for the original operator, including a novel approach of discarding far-field interactions in the preconditioner. Using the boundary element software Bempp (www.bempp.com), we compare the performance of different combinations of these techniques in the context of scattering by multiple dielectric particles. Applying our accelerated implementation to 3D electromagnetic scattering by an aggregate consisting of 8 monomer ice crystals of overall diameter 1cm at 664GHz leads to a 99% reduction in memory cost and at least a 75% reduction in total computation time compared to a non-accelerated implementation.