Sébastien Loisel

Learn More
The optimized Schwarz method and the closely related 2-Lagrange multiplier method are domain decomposition methods which can be used to parallelize the solution of partial differential equations. Although these methods are known to work well in special cases (e.g., when the domain is a square and the two subdomains are rectangles), the problem has never(More)
The Robust Robust Generalized Methods of Moments (RGMM) and the Indirect Robust GMM (IRGMM) are algorithms for estimating parameter values in statistical models, such as diffusion models for interest rates, in a robust way. The long computation time is one of the main challenge facing these methods. In this paper, we introduce accelerated variants of RGMM(More)
Optimized Schwarz Methods (OSM) use Robin transmission conditions across the subdomain interfaces. The Robin parameter can then be optimized to obtain the fastest convergence. A new formulation is presented with a coarse grid correction. The optimal parameter is computed for a model problem on a cylinder, together with the corresponding convergence factor(More)
The overset grid nicknamed ”Yin-Yang” grid is singularity free and has quasi-uniform grid spacing. It is composed of two identical latitude/longitude orthogonal grid panels that are combined to cover the sphere with partial overlap on their boundaries. The system of shallow-water equations (SWEs) is a hyperbolic system at the core of many models of the(More)
Domain decomposition methods are used to find the numerical solution of large boundary value problems in parallel. In optimized domain decomposition methods, one solves a Robin subproblem on each subdomain, where the Robin parameter a must be tuned (or optimized) for good performance. We show that the 2-Lagrange multiplier method can be analyzed using(More)
We investigate the performance of domain decomposition methods for solving the Poisson equation on the surface of the sphere. This equation arises in a global weather model as a consequence of an implicit time discretization. We consider two different types of algorithms: the Dirichlet-Neumann algorithm and the optimal Schwarz method. We show that both(More)