We consider sweeping domain decomposition preconditioners to solve the Helmholtz equation in the case of stripwise domain decomposition with or without overlaps. We unify their derivation and convergence studies as Jacobi, Gauss-Seidel or Symmetric Gauss-Seidel for different numbering of the unknowns. This enables the theoretical comparisons of the double sweep methods in [Nataf and Nier (1997), Vion and Geuzaine (2018)] with that of [Stolk (2013, 2017), Vion and Geuzaine (2014)]. It also makes possible the introduction of two new sweeping algorithms. We provide numerical test cases that assess the validity of the theoretical studies.
翻译:我们认为,在条形地段分解或不存在重叠的情况下,通过广域分解的先决条件,可以解决Helmholtz方程式的分解问题。我们将它们的衍生和汇合研究与对未知数的不同编号分别合并为Jacobi、Gauss-Seidel或Symtimic Gauss-Seidel。这样就可以对[Nataf和Nier(1997年)、Vion和Geuzaine(2018年)的双重扫描方法与[Stolk(2013年、2017年)、Vion和Geuzaine(2014年)]的分解法进行理论比较。这也使得引入两种新的扫描算法成为可能。我们提供了评估理论研究有效性的数字测试案例。