Related papers: Adaptive Nonoverlapping Preconditioners for the He…
The convergence rate of domain decomposition methods (DDMs) strongly depends on the transmission condition at the interfaces between subdomains. Thus, an important aspect in improving the efficiency of such solvers is careful design of…
In this paper, an efficient solver for the Helmholtz equation using a noval approximation space is developed. The ingradients of the method include the approximation space recently proposed, a discontinuous Galerkin scheme extensively used,…
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 by expressing them as…
We consider the use of multipreconditioning, which allows for multiple preconditioners to be applied in parallel, on high-frequency Helmholtz problems. Typical applications present challenging sparse linear systems which are complex…
We extend the theoretical framework of non-local optimized Schwarz methods as introduced in [Claeys,2021], considering an Helmholtz equation posed in a bounded cavity supplemented with a variety of conditions modeling material boundaries.…
In this paper we propose two variants of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the new preconditioners, we use the simplest coarse solver…
In this article we design and analyze a class of two-level non-overlapping additive Schwarz preconditioners for the solution of the linear system of equations stemming from discontinuous Galerkin discretizations of second-order elliptic…
We derive an extension of the sequential homotopy method that allows for the application of inexact solvers for the linear (double) saddle-point systems arising in the local semismooth Newton method for the homotopy subproblems. For the…
We introduce a domain decomposition-based nonlinear preconditioned iteration for solving nonlinear, nonsmooth elliptic optimal control problems, with a nonlinear reaction term, $L^1$ regularization and box constraints on the control…
We study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all…
A symmetric and a nonsymmetric variant of the additive Schwarz preconditioner are proposed for the solution of a nonsymmetric system of algebraic equations arising from a general finite volume element discretization of symmetric elliptic…
We present a two-level overlapping Schwarz preconditioner for three-dimensional problems discretized with the Virtual Element Method. Our approach handles general polyhedral meshes and irregular subdomains, extending the applicability of…
Substructured domain decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. We introduce here a substructured version of Restricted Additive Schwarz (RAS) which we call…
We present a deep learning-based iterative approach to solve the discrete heterogeneous Helmholtz equation for high wavenumbers. Combining classical iterative multigrid solvers and convolutional neural networks (CNNs) via preconditioning,…
This paper studies and analyzes a preconditioned Krylov solver for Helmholtz problems that are formulated with absorbing boundary layers based on complex coordinate stretching. The preconditioner problem is a Helmholtz problem where not…
Fourth-order variational inequalities are encountered in various scientific and engineering disciplines, including elliptic optimal control problems and plate obstacle problems. In this paper, we consider additive Schwarz methods for…
This paper concerns the preconditioning technique for discrete systems arising from time-harmonic Maxwell equations with absorptions, where the discrete systems are generated by N\'ed\'elec finite element methods of fixed order on meshes…
This paper presents an efficient Krylov subspace iterative solver for the three-dimensional (3D) Helmholtz equation with non-constant coefficients and absorbing boundary conditions, combining high-resolution compact schemes with low-order…
For non-preconditioned Galerkin systems, the condition number grows with the number of elements as well as the quotient of the maximal and the minimal mesh-size. Therefore, reliable and effective numerical computations, in particular on…
Domain decomposition methods are among the most efficient for solving sparse linear systems of equations. Their effectiveness relies on a judiciously chosen coarse space. Originally introduced and theoretically proved to be efficient for…