next up previous
Next: About this document ...

Matthieu Lecouvez
Optimized Transmission Conditions for Domain Decomposition methods for the Helmholtz equation

15 Avenue des Sablières
33114 Le Barp
FRANCE
matthieu.lecouvez@gmail.com
Matthieu Lecouvez
Bruno Stupfel
Patrick Joly
Francis Collino

Scattering problems by electrically large objects are of wide interest in many fields. The numerical computation of such problems remains limited by computer resources, due to the large number of unknowns, especially when inhomogeneous materials are present. Domain decomposition methods (DDM) are particularly attractive for the solution of large finite elements problem. It is decomposed into several coupled sub-problems which can be solved independently, thus reducing considerably the memory storage requirements. Moreover, DDM are intrinsically well suited for numerical implementation on parallel computers.

The key point of these methods is how the sub-domains are coupled to each other, i.e. which transmission conditions are imposed on the interfaces between two sub-domains. The most commonly used transmission condition in electromagnetism is the one proposed by Després in [B. Després, SIAM, 197-206, 1993] or higher order ones [see e.g. M. Gander et al., SIAM JSC, 24, 38-60, 2002]. But these transmission conditions are local (i.e. expressed in terms of tangential differential operators) and generally lead to an arithmetic convergence of an domain decomposition iterative process.

We introduce new transmission conditions based on specific linear operators $ T\in\mathcal{L}\left(H^s(\Sigma),H^{-s}(\Sigma)\right)$ for some $ s>0$ :

$\displaystyle \left\{ \begin{array}{l} \partial_{n_1} u_1 +zTu_1=\partial_{n_1}...
...partial_{n_2} u_1+\overline{z}Tu_1,\ \mbox{on}\ \Sigma_{21} \end{array} \right.$ (1)

Provided that $ T$ is injective and $ \mathcal{I}(z)\neq0$ , then our transmission conditions are equivalent to the exact transmission conditions $ u_1=u_2$ , and $ \partial_{n_1} u_1=-\partial_{n_2} u_2$ . Let us remark that this general framework contains most of the iterative methods proposed in the litterature: A specific case of interest is when the two following assumptions hold: This case leads to a proven exponential convergence rate. However, these assumptions prevent us from expressing $ T$ (or $ \Lambda$ ) in terms of differential or local operators. To build an explicit operator verifying the assumptions, we use non local integral kernels as suggested by Riesz potential:

$\displaystyle \Lambda u(x)=u(x)-\beta$div$\displaystyle \int_\Sigma\left\vert x-y\right\vert^{\frac{1}{2}}\nabla u(y) d\sigma(y)$ (2)

Moreover, to avoid fully non local operators, leading to full matrices after discretization, we introduce a smooth cutoff function $ \chi_\delta$ such that $ \chi_\delta(x)=0$ for $ \vert x\vert>\delta$ and $ \chi_\delta(x)=1$ for $ \vert x\vert<\frac{\delta}{2}$ . The operator becomes:

$\displaystyle \Lambda u(x)=u(x)-\beta$div$\displaystyle \int_\Sigma\chi_\delta(x-y)\left\vert x-y\right\vert^{\frac{1}{2}}\nabla u(y) d\sigma(y)$ (3)

As soon as $ \mathcal{I}(\beta)\neq 0$ , the operator $ \Lambda$ verifies all the conditions required to achieve exponential convergence of an iterative method such as Jacobi, Gauss-Seidel or GMRES. At the conference, several numerical experiments will be presented to show the influence of our transmission conditions on the eigenvalues of the problem as well as on the convergence rate of different iterative methods. We shall also investigate, analytically and numerically, how to tune the different parameters ($ z$ , $ \beta$ , $ \delta$ ) to optimize the rate of convergence.




next up previous
Next: About this document ...
Copper Mountain 2014-02-23