Related papers: Optimized Schwarz Methods for Maxwell equations
Two-level domain decomposition preconditioners lead to fast convergence and scalability of iterative solvers. However, for highly heterogeneous problems, where the coefficient function is varying rapidly on several possibly non-separated…
In this paper we prove symmetry results for classical solutions of nonlinear cooperative elliptic systems in a ball or in annulus in $\RN$, $N \geq 2 $. More precisely we prove that solutions having Morse index $j \leq N $ are foliated…
We consider DPG methods with optimal test functions and broken test spaces based on ultra-weak formulations of general second order elliptic problems. Under some assumptions on the regularity of solutions of the model problem and its…
The Schwarz function has played an elegant role in understanding and in generating new examples of exact solutions to the Laplacian growth (or "Hele- Shaw") problem in the plane. The guiding principle in this connection is the fact that…
The double Schwarzschild solution in the equal mass case is studied in bispherical coordinates. An explicit conformal transformation from cylindrical Weyl coordinates to bispherical coordinates is given in terms of elliptic functions. A…
We present a modification to the Berger and Oliger adaptive mesh refinement algorithm designed to solve systems of coupled, non-linear, hyperbolic and elliptic partial differential equations. Such systems typically arise during constrained…
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 present a non-overlapping, Schwarz-type domain decomposition method with a generalized interface condition, designed for physics-informed machine learning of partial differential equations (PDEs) in both forward and inverse contexts. Our…
We propose a locally conservative enriched Galerkin scheme that preserves the physical bounds for an elliptic problem. To this end, we use a substantial over-penalization of the discrete solution's jumps to obtain optimal convergence. To…
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 consider the leapfrog algorithm by Noakes for computing geodesics on Riemannian manifolds. The main idea behind this algorithm is to subdivide the original endpoint geodesic problem into several local problems, for which the endpoint…
In this work, we develop a novel hybrid Schwarz method, termed as edge multiscale space based hybrid Schwarz (EMs-HS), for solving the Helmholtz problem with large wavenumbers. The problem is discretized using $H^1$-conforming nodal finite…
Simple regression methods provide robust, near-optimal solutions for optimal switching problems, including high-dimensional ones (up to 50). While the theory requires solving intractable PDE systems, the Longstaff-Schwartz algorithm with…
We prove sharp bounds on certain impedance-to-impedance maps (and their compositions) for the Helmholtz equation with large wavenumber (i.e., at high-frequency) using semiclassical defect measures. The paper [GGGLS]…
We consider algorithms that, from an arbitrarily sampling of $N$ spheres (possibly overlapping), find a close packed configuration without overlapping. These problems can be formulated as minimization problems with non-convex constraints.…
In the present work, we study and analyze an efficient iterative coupling method for a dimensionally heterogeneous problem . We consider the case of 2-D Laplace equation with non symmetric boundary conditions with a corresponding 1-D…
We derive a global higher regularity result for weak solutions of the linear relaxed micromorphic model on smooth domains. The governing equations consist of a linear elliptic system of partial differential equations that is coupled with a…
This survey hinges on the interplay between regularity and approximation for linear and quasi-linear fractional elliptic problems on Lipschitz domains. For the linear Dirichlet integral Laplacian, after briefly recalling H\"older regularity…
BDDC method is the most advanced method from the Balancing family of iterative substructuring methods for the solution of large systems of linear algebraic equations arising from discretization of elliptic boundary value problems. In the…
For linear problems, domain decomposition methods can be used directly as iterative solvers, but also as preconditioners for Krylov methods. In practice, Krylov acceleration is almost always used, since the Krylov method finds a much better…