By utilizing the perfectly matched layer (PML) and source transfer techniques, the diagonal sweeping domain decomposition method (DDM) was recently developed for solving the high-frequency Helmholtz equation in $\mathbb{R}^n$, which uses $2^n$ sweeps along respective diagonal directions with checkerboard domain decomposition. Although this diagonal sweeping DDM is essentially multiplicative, it is highly suitable for parallel computing of the Helmholtz problem with multiple right-hand sides when combined with the pipeline processing since the number of sequential steps in each sweep is much smaller than the number of subdomains. In this paper, we propose and analyze a trace transfer-based diagonal sweeping DDM. A major advantage of changing from source transfer to trace transfer for information passing between neighbor subdomains is that the resulting diagonal sweeps become easier to analyze and implement and more efficient, since the transferred traces have only $2n$ cardinal directions between neighbor subdomains while the transferred sources come from a total of $3^n-1$ cardinal and corner directions. We rigorously prove that the proposed diagonal sweeping DDM not only gives the exact solution of the global PML problem in the constant medium case but also does it with at most one extra round of diagonal sweeps in the two-layered media case, which lays down the theoretical foundation of the method. Performance and parallel scalability of the proposed DDM as direct solver or preconditioner are also numerically demonstrated through extensive experiments in two and three dimensions.
This paper explores a family of generalized sweeping preconditionners for Helmholtz problems with non-overlapping checkerboard partition of the computational domain. The domain decomposition procedure relies on high-order transmission conditions and cross-point treatments, which cannot scale without an efficient preconditioning technique when the number of subdomains increases. With the proposed approach, existing sweeping preconditioners, such as the symmetric Gauss-Seidel and parallel double sweep preconditioners, can be applied to checkerboard partitions with different sweeping directions (…
Additive Sweeping Preconditioner for the Helmholtz Equation
Department of Mathematics, Stanford University（斯坦福大学数学系）；Institute for Computational and Mathematical Engineering, Stanford University（斯坦福大学计算与数学工程研究所）
In this paper, we propose and test a novel diagonal sweeping domain decomposition method (DDM) with source transfer for solving the high-frequency Helmholtz equation in $\mathbb{R}^n$. In the method the computational domain is partitioned into overlapping checkerboard subdomains for source transfer with the perfectly matched layer (PML) technique, then a set of diagonal sweeps over the subdomains are specially designed to solve the system efficiently. The method improves the additive overlapping DDM (W. Leng and L. Ju, 2019) and the L-sweeps method (M. Taus, et al., 2019) by employing a more e…
A Class of Iterative Solvers for the Helmholtz Equation: Factorizations, Sweeping Preconditioners, Source Transfer, Single Layer Potentials, Polarized Traces, and Optimized Schwarz Methods
University of Geneva（日内瓦大学）；Zhejiang Ocean University（浙江海洋大学）
An Overlapping Domain Decomposition Preconditioner for the Helmholtz equation
State Key Laboratory of Scientific and Engineering Computing, Chinese Academy of Sciences（中国科学院计算数学与科学工程计算重点实验室）；Department of Mathematics, University of South Carolina（南卡罗来纳大学数学系）
We present the first fast solver for the high-frequency Helmholtz equation that scales optimally in parallel, for a single right-hand side. The L-sweeps approach achieves this scalability by departing from the usual propagation pattern, in which information flows in a 180 degree cone from interfaces in a layered decomposition. Instead, with L-sweeps, information propagates in 90 degree cones induced by a checkerboard domain decomposition (CDD). We extend the notion of accurate transmission conditions to CDDs and introduce a new sweeping strategy to efficiently track the wave fronts as they pro…
The discretisation of boundary integral equations for the scalar Helmholtz equation leads to large dense linear systems. Efficient boundary element methods (BEM), such as the fast multipole method (FMM) and $\Hmat$ based methods, focus on structured low-rank approximations of subblocks in these systems. It is known that the ranks of these subblocks increase linearly with the wavenumber. We explore a data-sparse representation of BEM-matrices valid for a range of frequencies, based on extracting the known phase of the Green's function. Algebraically, this leads to a Hadamard product of a freque…
We introduce a novel multi-resolution Localized Orthogonal Decomposition (LOD) for time-harmonic acoustic scattering problems that can be modeled by the Helmholtz equation. The method merges the concepts of LOD and operator-adapted wavelets (gamblets) and proves its applicability for a class of complex-valued, non-hermitian and indefinite problems. It computes hierarchical bases that block-diagonalize the Helmholtz operator and thereby decouples the discretization scales. Sparsity is preserved by a novel localization strategy that improves stability properties even in the elliptic case. We pre…
This paper presents an efficient parallel direct algorithm with near-optimal complexity for the compact fourth and sixth-order approximation of the three-dimensional Helmholtz equations [1] with the problem coefficient depending on only one of the coordinate directions. The developed method is based on a combination of the separation of variables technique and a Fast Fourier Transform (FFT) type method. Similar direct solvers for the lower-order approximations of the two and three-dimensional Helmholtz equation were considered in several previous publications by the authors and other researche…
