NATAF , Frédéric

In this work we present an overview of some classical and new domain decomposition methods for the resolution of the Euler equations. The classical Schwarz methods are formulated and analyzed in the framework of first order hyperbolic systems and the differences with respect to the scalar problems are presented. This kind of algorithms behave...

In this work we design new interface transmission conditions for a domain decomposition Schwarz algorithm for the Euler equations in 2 dimensions. These new interface conditions are designed to improve the convergence properties of the Schwarz algorithm. These conditions depend on a few parameters and they generalize the classical ones....

In this paper the Smith factorization is used systematically to derive a new domain decomposition method for the Stokes problem. In two dimensions the key idea is the transformation of the Stokes problem into a scalar bi-harmonic problem. We show, how a proposed domain decomposition method for the biharmonic problem leads to a domain...

International audience

In this paper we recall a new domain decomposition method for the Stokes problem obtained via the Smith factorization. From the theoretical point of view, this domain decomposition method is optimal in the sense that it converges in two iterations for a decomposition into two equal domains. Previous results illustrated the fast convergence of...

The purpose of this text is to offer an overview of the most popular domain decomposition methods for partial differential equations (PDE). The presentation is kept as much as possible at an elementary level with a special focus on the definitions of these methods in terms both of PDEs and of the sparse matrices arising from their...

Coarse grid correction is a key ingredient in order to have scalable domain decomposition methods. In this work we construct the coarse grid space using the low frequency modes of the subdomain DtN (Dirichlet-Neumann) maps, and apply the obtained two-level preconditioner to the linear system arising from an overlapping domain decomposition. Our...

In this paper the Smith factorization is used systematically to derive a new domain decomposition method for the Stokes problem. In two dimensions the key idea is the transformation of the Stokes problem into a scalar bi-harmonic problem. We show, how a proposed domain decomposition method for the bi-harmonic problem leads to a domain...

In this paper the Smith factorization is used systematically to derive a new domain decomposition method for the Stokes problem. In two dimensions the key idea is the transformation of the Stokes problem into a scalar bi-harmonic problem. We show, how a proposed domain decomposition method for the biharmonic problem leads to a domain...

Scalability of parallel solvers for problems with high heterogeneities relies on adaptive coarse spaces built from generalized eigenvalue problems in the subdomains. The corresponding theory is powerful and flexible but the development of an efficient parallel implementation is challenging. We report here on recent advances in adaptive coarse...

In this document, we present a parallel implementation in Freefem++ of scalable two-level domain decomposition methods. Numerical studies with highly heterogeneous problems are then performed on large clusters in order to assert the performance of our code.

International audience

International audience

The purpose of this work is to show how algebraic and symbolic techniques such as Smith normal forms and Gröbner basis techniques can be used to develop new Schwarz-like algorithms and preconditioners for linear systems of partial differential equations

International audience

Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today's standard applications, it is necessary to rely on iterative Krylov...

Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today's standard applications, it is necessary to rely on iterative Krylov...

Some algorithmic aspects of systems of PDEs based simulations can be better clarified by means of symbolic computation techniques. This is very important since numerical simulations heavily rely on solving systems of PDEs. For the large-scale problems we deal with in today's standard applications, it is necessary to rely on iterative Krylov...

Coarse grid correction is a key ingredient in order to have scalable domain decomposition methods. In this work we construct the coarse grid space using the low frequency modes of the subdomain DtN maps, and apply the obtained two-level preconditioner (the additive Schwarz method together with the new coarse grid) to the extended or the...

The Helmholtz equation governing wave propagation and scattering phenomena is difficult to solve numerically. Its discretization with piecewise linear finite elements results in typically large linear systems of equations. The inherently parallel domain decomposition methods constitute hence a promising class of preconditioners. An essential...

Coarse grid correction is a key ingredient in order to have scalable domain decomposition methods. For smooth problems, the theory and practice of such two-level methods is well established, but this is not the case for problems with complicated variation and high contrasts in the coefficients. Stable coarse spaces for high contrast problems...

The Helmholtz equation governing wave propagation and scattering phenomena is difficult to solve numerically. Its discretization with piecewise linear finite elements results in typically large linear systems of equations. The inherently parallel domain decomposition methods constitute hence a promising class of preconditioners. An essential...

In this paper we develop and analyse domain decomposition methods for linear systems of equations arising from conforming finite element discretisations of positive Maxwell-type equations. Convergence of domain decomposition methods rely heavily on the efficiency of the coarse space used in the second level. We design adaptive coarse spaces...

FETI is a very popular method, which has proved to be extremely efficient on many large-scale industrial problems. One drawback is that it performs best when the decomposition of the global problem is closely related to the parameters in equations. This is somewhat confirmed by the fact that the theoretical analysis goes through only if some...

FETI is a very popular method, which has proved to be extremely efficient on many large-scale industrial problems. One drawback is that it performs best when the decomposition of the global problem is closely related to the parameters in equations. This is somewhat confirmed by the fact that the theoretical analysis goes through only if some...