Optimized Schwarz Methods for Maxwell equations

Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, and it was observed that the classical Schwarz method can be convergent even without overlap in certain cases. This is in strong contrast to the behavior of classical Schwarz methods applied to elliptic problems, for which overlap is essential for convergence. Over the last decade, optimized Schwarz methods have been developed for elliptic partial differential equations. These methods use more effective transmission conditions between subdomains, and are also convergent without overlap for elliptic problems. We show here why the classical Schwarz method applied to the hyperbolic problem converges without overlap for Maxwell's equations. The reason is that the method is equivalent to a simple optimized Schwarz method for an equivalent elliptic problem. Using this link, we show how to develop more efficient Schwarz methods than the classical ones for the Maxwell's equations. We illustrate our findings with numerical results

Stochastic domain decomposition for time dependent adaptive mesh generation

The efficient generation of meshes is an important component in the numerical solution of problems in physics and engineering. Of interest are situations where global mesh quality and a tight coupling to the solution of the physical partial differential equation (PDE) is important. We consider parabolic PDE mesh generation and present a method for the construction of adaptive meshes in two spatial dimensions using stochastic domain decomposition that is suitable for an implementation in a multi– or many–core environment. Methods for mesh generation on periodic domains are also provided. The mesh generator is coupled to a time dependent physical PDE and the system is evolved using an alternating solution procedure. The method uses the stochastic representation of the exact solution of a parabolic linear mesh generator to find the location of an adaptive mesh along the (artificial) subdomain interfaces. The deterministic evaluation of the mesh over each subdomain can then be obtained completely independently using the probabilistically computed solutions as boundary conditions. The parallel performance of this general stochastic domain decomposition approach has previously been shown. We demonstrate the approach numerically for the mesh generation context and compare the mesh obtained with the corresponding single domain mesh using a representative mesh quality measure

Domain decomposition algorithms and computation fluid dynamics

In the past several years, domain decomposition was a very popular topic, partly motivated by the potential of parallelization. While a large body of theory and algorithms were developed for model elliptic problems, they are only recently starting to be tested on realistic applications. The application of some of these methods to two model problems in computational fluid dynamics are investigated. Some examples are two dimensional convection-diffusion problems and the incompressible driven cavity flow problem. The construction and analysis of efficient preconditioners for the interface operator to be used in the iterative solution of the interface solution is described. For the convection-diffusion problems, the effect of the convection term and its discretization on the performance of some of the preconditioners is discussed. For the driven cavity problem, the effectiveness of a class of boundary probe preconditioners is discussed

A New Domain Decomposition Method for the Compressible Euler Equations

In this work we design a new domain decomposition method for the Euler equations in 2 dimensions. The basis is the equivalence via the Smith factorization with a third order scalar equation to whom we can apply an algorithm inspired from the Robin-Robin preconditioner for the convection-diffusion equation. Afterwards we translate it into an algorithm for the initial system and prove that at the continuous level and for a decomposition into 2 sub-domains, it converges in 2 iterations. This property cannot be preserved strictly at discrete level and for arbitrary domain decompositions but we still have numerical results which confirm a very good stability with respect to the various parameters of the problem (mesh size, Mach number, ....).Comment: Submitte

A Nitsche-based domain decomposition method for hypersingular integral equations

We introduce and analyze a Nitsche-based domain decomposition method for the solution of hypersingular integral equations. This method allows for discretizations with non-matching grids without the necessity of a Lagrangian multiplier, as opposed to the traditional mortar method. We prove its almost quasi-optimal convergence and underline the theory by a numerical experiment.Comment: 21 pages, 5 figure