Related papers: A Unified Framework for Double Sweep Methods for t…
We examine the use of the Dirichlet-to-Neumann coarse space within an additive Schwarz method to solve the Helmholtz equation in 2D. In particular, we focus on the selection of how many eigenfunctions should go into the coarse space. We…
In the context of non overlapping domain decomposition methods, several algebraic approximations of the Dirichlet-to-Neumann (DtN) map are proposed in [F. X. Roux, et. al. Algebraic approximation of Dirichlet- to-Neumann maps for the…
This work is about a new two-level solver for Helmholtz equations discretized by finite elements. The method is inspired by two-grid methods for finite-difference Helmholtz problems as well as by previous work on two-level…
We investigate the application of the additive overlapping Schwarz domain decomposition method as a preconditioner for the large sparse linear systems arising in graph-based nonlinear least-squares problems, specifically the pose-graph…
We present a preconditioning method for the multi-dimensional Helmholtz equation with smoothly varying coefficient. The method is based on a frame of functions, that approximately separates components associated with different singular…
A domain decomposition method for the solution of general variable-coefficient elliptic partial differential equations on regular domains is introduced. The method is based on tessellating the domain into overlapping thin slabs or shells,…
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…
We develop a Helmholtz-like theorem for differential forms in Euclidean space $E_{n}$ using a uniqueness theorem similar to the one for vector fields. We then apply it to Riemannian manifolds, $R_{n}$, which, by virtue of the…
Domain decomposition methods (DDMs) provide a unifying framework for the scalable numerical solution of partial differential equations. Originating from Schwarz's alternating method, they have evolved into a rich family of algorithms that…
A parallelization of a sweeping preconditioner for 3D Helmholtz equations without large cavities is introduced and benchmarked for several challenging velocity models. The setup and application costs of the sequential preconditioner are…
Domain decomposition methods are used for approximate solving boundary problems for partial differential equations on parallel computing systems. Specific features of unsteady problems are taken into account in the most complete way in…
In this paper we consider sweeping preconditioners for time harmonic wave propagation in stratified media, especially in the presence of reflections. In the most famous class of sweeping preconditioners Dirichlet-to-Neumann operators for…
The construction of fast iterative solvers for the indefinite time-harmonic Maxwell's system at mid- to high-frequency is a problem of great current interest. Some of the difficulties that arise are similar to those encountered in the case…
A fast method is proposed for solving the high frequency Helmholtz equation. The building block of the new fast method is an overlapping source transfer domain decomposition method for layered medium, which is an extension of the source…
Non-overlapping domain decomposition methods necessarily have to exchange Dirichlet and Neumann traces at interfaces in order to be able to converge to the underlying mono-domain solution. Well known such non-overlapping methods are the…
We introduce a generalized framework for studying higher-order versions of the multiscale method known as Localized Orthogonal Decomposition. Through a suitable reformulation, we are able to accommodate both conforming and nonconforming…
In this work we extend the shifted Laplacian approach to the elastic Helmholtz equation. The shifted Laplacian multigrid method is a common preconditioning approach for the discretized acoustic Helmholtz equation. In some cases, like…
The sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis, and sparse canonical correlation analysis.…
The Classic Howard's algorithm, a technique of resolution for discrete Hamilton-Jacobi equations, is of large use in applications for its high efficiency and good performances. A special beneficial characteristic of the method is the…
This paper develops a smoothing-based postprocessing method for superconvergence in finite element methods. The method applies a few smoothing iterations, such as damped Jacobi, Gauss-Seidel, or conjugate gradient, with initial guess being…