arXiv subjects

Pierre-Henri Tournier

Publications and source records attributed to Pierre-Henri Tournier.

28 records · Page 2Linked to original sources

arXiv2021

Analysis of the SORAS domain decomposition preconditioner for non-self-adjoint or indefinite problems

We analyze the convergence of the one-level overlapping domain decomposition preconditioner SORAS (Symmetrized Optimized Restricted Additive Schwarz) applied to a generic linear system whose matrix is not necessarily symmetric/self-adjoint nor positive definite. By generalizing the theory for the Helmholtz equation developed in [I.G. Graham, E.A. Spence, and J. Zou, SIAM J.Numer.Anal., 2020], we identify a list of assumptions and estimates that are sufficient to obtain an upper bound on the norm of the preconditioned matrix, and a lower bound on the distance of its field of values from the origin. We stress that our theory is general in the sense that it is not specific to one particular boundary value problem. Moreover, it does not rely on a coarse mesh whose elements are sufficiently small. As an illustration of this framework, we prove new estimates for overlapping domain decomposition methods with Robin-type transmission conditions for the heterogeneous reaction-convection-diffusion equation (to prove the stability assumption for this equation we consider the case of a coercive bilinear form, which is non-symmetric, though).

math.NA↗

arXiv2021

Large-scale finite-difference and finite-element frequency-domain seismic wave modelling with multi-level domain-decomposition preconditioner

The emergence of long-offset sparse stationary-recording surveys carried out with ocean bottom nodes (OBN) makes frequency-domain full waveform inversion (FWI) attractive to manage compact volume of data and perform attenuation imaging. One challenge of frequency-domain FWI is the forward problem, which requires the solution of large and sparse linear systems with multiple right-hand sides. While direct methods are suitable for dense acquisitions and problems involving less than 100 million unknowns, iterative solver are more suitable for large computational domains covered by sparse OBN surveys. Here, we solve these linear systems with a Krylov subspace method preconditioned with the two-level Optimized Restricted Additive Schwarz (ORAS) domain decomposition preconditioner, the prefix optimized referring to the use of absorbing conditions at the subdomain interfaces. We implement this method with finite differences on uniform grid and finite elements on unstructured tetrahedral meshes. A simulation in a model where the velocity linearly increases with depth allows us to validate the accuracy of the two schemes against an analytical solution while highlighting how their relative cost varies with the band of propagated wavelengths. A simulation in the overthrust model involving up to 2 billions of parameters allows us to tune the method and highlights its scalability.

physics.comp-ph↗

arXiv2020

Two-level DDM preconditioners for positive Maxwell equations

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 that complement the near-kernel space made of the gradient of scalar functions. This extends the results in [2] to the variable coefficient case and non-convex domains at the expense of a larger coarse space.

math.NA↗

arXiv2020

Large-scale frequency-domain seismic wave modeling on {\it{h}}-adaptive tetrahedral meshes with iterative solver and multi-level domain-decomposition preconditioners

Frequency-domain full-waveform inversion (FWI) is suitable for long-offset stationary-recording acquisition, since reliable subsurface models can be reconstructed with a few frequencies and attenuation is easily implemented without computational overhead. In the frequency domain, wave modeling is a Helmholtz-type boundary-value problem which requires to solve a large and sparse system of linear equations per frequency with multiple right-hand sides (sources). This system can be solved with direct or iterative methods. While the former are suitable for FWI application on 3D dense OBC acquisitions covering spatial domains of moderate size, the later should be the approach of choice for sparse node acquisitions covering large domains (more than 50 millions of unknowns). Fast convergence of iterative solvers for Helmholtz problems remains however challenging in high frequency regime due to the non definiteness of the Helmholtz operator, on one side and on the discretization constraints in order to minimize the dispersion error for a given frequency, on the other side, hence requiring efficient preconditioners. In this study, we use the Krylov subspace GMRES iterative solver combined with a two-level domain-decomposition preconditioner. Discretization relies on continuous Lagrange finite elements of order 3 on unstructured tetrahedral meshes to comply with complex geometries and adapt the size of the elements to the local wavelength ($h$-adaptivity). We assess the accuracy, the convergence and the scalability of our method with the acoustic 3D SEG/EAGE Overthrust model up to a frequency of 20~Hz.

physics.comp-ph↗

arXiv2020

Iterative frequency-domain seismic wave solvers based on multi-level domain-decomposition preconditioners

Frequency-domain full-waveform inversion (FWI) is suitable for long-offset stationary-recording acquisition, since reliable subsurface models can be reconstructed with a few frequencies and attenuation is easily implemented without computational overhead. In the frequency domain, wave modelling is a Helmholtz-type boundary-value problem which requires to solve a large and sparse system of linear equations per frequency with multiple right-hand sides (sources). This system can be solved with direct or iterative methods. While the former are suitable for FWI application on 3D dense OBC acquisitions covering spatial domains of moderate size, the later should be the approach of choice for sparse node acquisitions covering large domains (more than 50 millions of unknowns). Fast convergence of iterative solvers for Helmholtz problems remains however challenging due to the non definiteness of the Helmholtz operator, hence requiring efficient preconditioners. In this study, we use the Krylov subspace GMRES iterative solver combined with a multi-level domain-decomposition preconditioner. Discretization relies on continuous finite elements on unstructured tetrahedral meshes to comply with complex geometries and adapt the size of the elements to the local wavelength ($h$-adaptivity). We assess the convergence and the scalability of our method with the acoustic 3D SEG/EAGE Overthrust model up to a frequency of 20~Hz and discuss its efficiency for multi right-hand side processing.

physics.comp-ph↗

arXiv2019

Parallel Controllability Methods For the Helmholtz Equation

The Helmholtz equation is notoriously difficult to solve with standard numerical methods, increasingly so, in fact, at higher frequencies. Controllability methods instead transform the problem back to the time-domain, where they seek the time-harmonic solution of the corresponding time-dependent wave equation. Two different approaches are considered here based either on the first or second-order formulation of the wave equation. Both are extended to general boundary-value problems governed by the Helmholtz equation and lead to robust and inherently parallel algorithms. Numerical results illustrate the accuracy, convergence and strong scalability of controllability methods for the solution of high frequency Helmholtz equations with up to a billion unknowns on massively parallel architectures.

math.NA↗

arXiv2019

Domain decomposition preconditioning for the high-frequency time-harmonic Maxwell equations with absorption

This paper rigorously analyses preconditioners for the time-harmonic Maxwell equations with absorption, where the PDE is discretised using curl-conforming finite-element methods of fixed, arbitrary order and the preconditioner is constructed using Additive Schwarz domain decomposition methods. The theory developed here shows that if the absorption is large enough, and if the subdomain and coarse mesh diameters and overlap are chosen appropriately, then the classical two-level overlapping Additive Schwarz preconditioner (with PEC boundary conditions on the subdomains) performs optimally -- in the sense that GMRES converges in a wavenumber-independent number of iterations -- for the problem with absorption. An important feature of the theory is that it allows the coarse space to be built from low-order elements even if the PDE is discretised using high-order elements. It also shows that additive methods with minimal overlap can be robust. Numerical experiments are given that illustrate the theory and its dependence on various parameters. These experiments motivate some extensions of the preconditioners which have better robustness for problems with less absorption, including the propagative case. At the end of the paper we illustrate the performance of these on two substantial applications; the first (a problem with absorption arising from medical imaging) shows the empirical robustness of the preconditioner against heterogeneity, and the second (scattering by a COBRA cavity) shows good scalability of the preconditioner with up to 3,000 processors.

math.NA↗

arXiv2018

Two-level preconditioners for the Helmholtz equation

In this paper we compare numerically two different coarse space definitions for two-level domain decomposition preconditioners for the Helmholtz equation, both in two and three dimensions. While we solve the pure Helmholtz problem without absorption, the preconditioners are built from problems with absorption. In the first method, the coarse space is based on the discretization of the problem with absorption on a coarse mesh, with diameter constrained by the wavenumber. In the second method, the coarse space is built by solving local eigenproblems involving the Dirichlet-to-Neumann (DtN) operator.

math.NA↗

arXiv2018

A two-level domain-decomposition preconditioner for the time-harmonic Maxwell's equations

The construction of fast iterative solvers for the indefinite time-harmonic Maxwell's system at mid- to high-frequency is a problem of great current interest. Some of the difficulties that arise are similar to those encountered in the case of the mid- to high-frequency Helmholtz equation. Here we investigate how two-level domain-decomposition preconditioners recently proposed for the Helmholtz equation work in the Maxwell case, both from the theoretical and numerical points of view.

math.NA↗

arXiv2017

Hybrid discontinuous Galerkin discretisation and domain decomposition preconditioners for the Stokes problem

Solving the Stokes equation by an optimal domain decomposition method derived algebraically involves the use of non standard interface conditions whose discretisation is not trivial. For this reason the use of approximation methods such as hybrid discontinuous Galerkin appears as an appropriate strategy: on the one hand they provide the best compromise in terms of the number of degrees of freedom in between standard continuous and discontinuous Galerkin methods, and on the other hand the degrees of freedom used in the non standard interface conditions are naturally defined at the boundary between elements. In this paper we introduce the coupling between a well chosen discretisation method (hybrid discontinuous Galerkin) and a novel and efficient domain decomposition method to solve the Stokes system. We present the detailed analysis of the hybrid discontinuous Galerkin method for the Stokes problem with non standard boundary conditions. This analysis is supported by numerical evidence. In addition, the advantage of the new preconditioners over more classical choices is also supported by numerical experiments.

math.NA↗