Novel multilevel preconditioners for the systems arising from plane wave discretization of Helmholtz equations with large wave numbers
LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）
Qiya Hu, Xuan Li
备注：
The article, which contains 30 pages, was submitted to SIAM Journal on Scientific Computing one year ago. The revised version of this article was reviewing
In this paper we are concerned with fast algorithms for the systems arising from the plane wave discretizations for two-dimensional Helmholtz equations with large wave numbers. We consider the plane wave weighted least squares (PWLS) method and the plane wave discontinuous Galerkin (PWDG) method. The main goal of this paper is to construct multilevel parallel preconditioners for solving the resulting Helmholtz systems. To this end, we first build a multilevel overlapping space decomposition for the plane wave discretization space based on a multilevel overlapping domain decomposition method. Then, corresponding to the space decomposition, we construct an additive multilevel preconditioner for the underlying Helmholtz systems. Further, we design both additive and multiplicative multilevel preconditioners with smoothers, which are different from the standard multigrid preconditioners. We apply the proposed multilevel preconditioners with a {\it constant} coarsest mesh size to solve two dimensional Helmholtz systems generated by PWLS method or PWDG method, and we find that the new preconditioners possess nearly stable convergence, i.e., the iteration counts of the preconditioned iterative methods (PCG or PGMRES) with the preconditioners increase very slowly when the wave number increases (and the fine mesh size decreases).
We present robust and highly parallel multilevel non-overlapping Schwarz preconditioners, to solve an interior penalty discontinuous Galerkin finite element discretization of a system of steady state, singularly perturbed reaction-diffusion equations with a singular reaction operator, using a GMRES solver. We provide proofs of convergence for the two-level setting and the multigrid V-cycle as well as numerical results for a wide range of regimes.
Domain decomposition (DD) methods are widely used as preconditioner techniques. Their effectiveness relies on the choice of a locally constructed coarse space. Thus far, this construction was mostly achieved using non-assembled matrices from discretized partial differential equations (PDEs). Therefore, DD methods were mainly successful when solving systems stemming from PDEs. In this paper, we present a fully algebraic multilevel DD method where the coarse space can be constructed locally and efficiently without any information besides the coefficient matrix. The condition number of the precon…
This paper is the first one of two serial articles, whose goal is to prove convergence of HX Preconditioner (proposed by Hiptmair and Xu 2007) for Maxwell's equations with jump coefficients. In this paper we establish various extensions of the regular Helmholtz decomposition for edge finite element functions defined in three dimensional domains. The functions defined by the regular Helmholtz decompositions can preserve the zero tangential complement on faces and edges of polyhedral domains and some non-Lipchitz domains, and possess stability estimates with only a $logarithm$ factor. These regu…
A hybrid recursive multilevel incomplete factorization preconditioner for solving general linear systems
Johann Bernoulli Institute for Mathematics and Computer Science - University of Groningen（格罗宁根大学）；School of Mathematical Sciences, University of Electronic Science and Technology of China（电子科技大学）
We propose a $p$-multilevel preconditioner for Hybrid High-Order discretizations (HHO) of the Stokes equation, numerically assess its performance on two variants of the method, and compare with a classical Discontinuous Galerkin scheme. We specifically investigate how the combination of $p$-coarsening and static condensation influences the performance of the $V$-cycle iteration for HHO. Two different static condensation procedures are considered, resulting in global linear systems with a different number of unknowns and non-zero elements. An efficient implementation is proposed where coarse le…
Multilevel Preconditioner with Stable Coarse Grid Corrections for the Helmholtz Equation
Xiamen University（厦门大学）；Nanjing University（南京大学）；Institute of Computational Mathematics and Scientific/Engineering Computing, Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院计算数学与科学工程计算研究所）
Comparing domain decomposition preconditioners for non-conforming Helmholtz discretizations
University of Vienna（维也纳大学）；Sorbonne Université, Université Paris Cité, CNRS, INRIA, Laboratoire Jacques-Louis Lions（索邦大学，巴黎西岱大学，法国国家科学研究中心，法国国家信息与自动化研究所，雅克-路易·利翁斯实验室）；Georg-August-Universität Göttingen（哥廷根大学）
The multigroup neutron transport criticality calculations using modern supercomputers have been widely employed in a nuclear reactor analysis for studying whether or not a system is self-sustaining. However, the design and development of efficient parallel algorithms for the transport criticality calculations is challenging especially when the number of processor cores is large and an unstructured mesh is adopted. In particular, both the compute time and memory usage have to be carefully taken into consideration due to the dimensionality of the neutron transport equations. In this paper, we st…
We present the construction of additive multilevel preconditioners, also known as BPX preconditioners, for the solution of the linear system arising in isogeometric adaptive schemes with (truncated) hierarchical B-splines. We show that the locality of hierarchical spline functions, naturally defined on a multilevel structure, can be suitably exploited to design and analyze efficient multilevel decompositions. By obtaining smaller subspaces with respect to standard tensor-product B-splines, the computational effort on each level is reduced. We prove that, for suitably graded hierarchical meshes…
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（斯坦福大学计算与数学工程研究所）
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（南卡罗来纳大学数学系）
Fast multipole methods (FMM) were originally developed for accelerating $N$-body problems for particle-based methods. FMM is more than an $N$-body solver, however. Recent efforts to view the FMM as an elliptic Partial Differential Equation (PDE) solver have opened the possibility to use it as a preconditioner for a broader range of applications. FMM can solve Helmholtz problems with optimal $\mathcal{O}(N \log N)$ complexity, has compute-bound inner kernels, and highly asynchronous communication patterns. The combination of these features makes FMM an interesting candidate as a preconditioner …
In this work, we provide a performance comparison between the Balancing Domain Decomposition by Constraints (BDDC) and the Algebraic Multigrid (AMG) preconditioners for cardiac mechanics on both structured and unstructured finite element meshes. The mechanical behavior of myocardium can be described by the equations of three-dimensional finite elasticity, which are discretized by finite elements in space and yield the solution of a large scale nonlinear algebraic system. This problem is solved by a Newton-Krylov method, where the solution of the Jacobian linear system is accelerated by BDDC/AM…
The Helmholtz wave scattering problem by screens in 2D can be recast into first-kind integral equations which lead to ill-conditioned linear systems after discretization. We introduce two new preconditioners, in the form of square-roots of local operators respectively for the corresponding problems with Dirichlet and Neumann conditions on the arc. They generalize the so-called "analytical" preconditioners available for Lipschitz scatterers. We introduce a functional setting adapted to the singularity of the problem and enabling the analysis of those preconditioners. The efficiency of the metho…
Parallel algorithms and simulators with good scalabilities are particularly important for large-scale reservoir simulations on modern supercomputers with a large number of processors. In this paper, we introduce and study a family of highly scalable multilevel restricted additive Schwarz (RAS) methods for the fully implicit solution of subsurface flows with Peng-Robinson equation of state in two and three dimensions. With the use of a second-order fully implicit scheme, the proposed simulator is unconditionally stable with the relaxation of the time step size by the stability condition. The in…
We propose an unconditionally robust and highly effective preconditioner for general symmetric positive definite (SPD) matrices based on structured incomplete factorization (SIF), called enhanced SIF (eSIF) preconditioner. The original SIF strategy proposed recently derives a structured preconditioner by applying block diagonal preprocessing to the matrix and then compressing appropriate scaled off-diagonal blocks. Here, we use an enhanced scaling-and-compression strategy to design the new eSIF preconditioner. Some subtle modifications are made, such as the use of two-sided block triangular pr…
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（浙江海洋大学）
We propose and analyze optimal additive multilevel solvers for isogeometric discretizations of scalar elliptic problems for locally refined T-meshes. Applying the refinement strategy in Morgenstern and Peterseim (2015, Comput. Aided Geom. Design, 34, 50-66) we can guarantee that the obtained T-meshes have a multilevel structure, and that the associated T-splines are analysis-suitable, for which we can define a dual basis and a stable projector. Taking advantage of the multilevel structure, we develop two BPX preconditioners: the first on the basis of local smoothing only for the functions affe…
We consider effective preconditioners for solving Laplacians of general weighted graphs. Theoretically, spectral sparsifiers (SSs) provide preconditioners of optimal computational complexity. However, they are not easy to use for real-world applications due to the implementation complications. Multigrid (MG) methods, on the contrary, are computationally efficient but lack of theoretical justifications. To bridge the gap between theory and practice, we adopt ideas of MG and SS methods and proposed preconditioners that can be used in practice with theoretical guarantees. We expand the original g…
One of the main tools for solving linear systems arising from the discretization of the Helmholtz equation is the shifted Laplace preconditioner, which results from the discretization of a perturbed Helmholtz problem $-Δu - (k^2 + i \varepsilon )u = f$ where $0 \neq \varepsilon \in \mathbb{R}$ is an absorption parameter. In this work we revisit the idea of combining the shifted Laplace preconditioner with two-level deflation and apply it to Helmholtz problems discretized with linear finite elements. We use the convergence theory of GMRES based on the field of values to prove that GMRES applied…
Time-harmonic solutions to the wave equation can be computed in the frequency or in the time domain. In the frequency domain, one solves a discretized Helmholtz equation, while in the time domain, the periodic solutions to a discretized wave equation are sought, e.g. by simulating for a long time with a time-harmonic forcing term. Disadvantages of the time-domain method are that the solutions are affected by temporal discretization errors and that the spatial discretization cannot be freely chosen, since it is inherited from the time-domain scheme. In this work we address these issues. Given a…
Two-level hybrid Schwarz preconditioners with preasymptotic piecewise-polynomial coarse spaces for the high-frequency Helmholtz equation
University College London（伦敦大学学院）；University of Bath（巴斯大学）；Sorbonne Université, Université Paris Cité, CNRS, INRIA, Laboratoire Jacques-Louis Lions（索邦大学，巴黎西岱大学，法国国家科学研究中心，法国国家信息与自动化研究所，雅克-路易·利翁斯实验室）
We consider one-level additive Schwarz preconditioners for a family of Helmholtz problems with absorption and increasing wavenumber $k$. These problems are discretized using the Galerkin method with nodal conforming finite elements of any (fixed) order on meshes with diameter $h = h(k)$, chosen to maintain accuracy as $k$ increases. The action of the preconditioner requires solution of independent (parallel) subproblems (with impedance boundary conditions) on overlapping subdomains of diameter $H$ and overlap $δ\leq H$. The solutions of these subproblems are linked together using prolongation/…
