PTPierre-Henri Tournier

Pierre-Henri Tournier

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Pierre-Henri Tournier has a total of 53 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Parallel Numerical Simulation of Meta-surfaces: Finite Elements Full simulation, Comparison with Asymptotic Models and Application to the Faraday Cage

    by Igor Chollet, Berangere Delourme, Nicolas Grenèche, Pierre-Henri Tournier

    This paper deals with the simulation of electromagnetic waves in presence of meta-surfaces, namely thin and periodic structures made of small scatterers that are used to control the propagation of waves. Because of the different scales, the numerical solution of the underlying time-harmonic Maxwell's equations on such structures is a challenging task, highly non-uniform meshes leading to a high number of degrees of freedom to reach admissible output errors. Besides, for simple configurations, assuming for instance that the meta-surface is infinite, periodic homogenisation theory permits to derive approximate effective models that capture the macroscopic effect of the meta-surface, and are then much easier to simulate. In this article, we verify through parallel simulations the accuracy of the effective models and we show that the phenomena predicted by periodic homogenisation theory can be recovered on finite devices. We detail how these simulations can be performed in parallel through domain decomposition methods and multiple preconditioning strategies. The numerical experiments are supplemented by discussions on observed convergence speed both in terms of measured timings and in terms of number of Krylov solver iterations in a parallel setting.

  • Absorption de l'eau et des nutriments par les racines des plantes : modélisation, analyse et simulation

    by Pierre-Henri Tournier

    Dans le contexte du développement d'une agriculture durable visant à préserver les ressources naturelles et les écosystèmes, il s'avère nécessaire d'approfondir notre compréhension des processus souterrains et des interactions entre le sol et les racines des plantes.Dans cette thèse, on utilise des outils mathématiques et numériques pour développer des modèles mécanistiques explicites du mouvement de l'eau et des nutriments dans le sol et de l'absorption racinaire, gouvernés par des équations aux dérivées partielles non linéaires. Un accent est mis sur la prise en compte explicite de la géométrie du système racinaire et des processus à petite échelle survenant dans la rhizosphère, qui jouent un rôle majeur dans l'absorption racinaire.La première étude est dédiée à l'analyse mathématique d'un modèle d'absorption du phosphore (P) par les racines des plantes. L'évolution de la concentration de P dans la solution du sol est gouvernée par une équation de convection-diffusion avec une condition aux limites non linéaire à la surface de la racine, que l'on considère ici comme un bord du domaine du sol. On formule ensuite un problème d'optimisation de forme visant à trouver les formes racinaires qui maximisent l'absorption de P.La seconde partie de cette thèse montre comment on peut tirer avantage des récents progrès du calcul scientifique dans le domaine de l'adaptation de maillage non structuré et du calcul parallèle afin de développer des modèles numériques du mouvement de l'eau et des solutés et de l'absorption racinaire à l'échelle de la plante, tout en prenant en compte les phénomènes locaux survenant à l'échelle de la racine unique.

  • A Robust Algebraic Two-Level Schwarz Preconditioner for Sparse Matrices

    by Hussam Al Daas, Pierre Jolivet, Frédéric Nataf, Pierre-Henri Tournier

    This paper introduces a fully algebraic two-level additive Schwarz preconditioner for general sparse large-scale matrices. The preconditioner is analyzed for symmetric positive definite (SPD) matrices. For those matrices, the coarse space is constructed based on approximating two local subspaces in each subdomain. These subspaces are obtained by approximating a number of eigenvectors corresponding to dominant eigenvalues of two judiciously posed generalized eigenvalue problems. The number of eigenvectors can be chosen to control the condition number. For general sparse matrices, the coarse space is constructed by approximating the image of a local operator that can be defined from information in the coefficient matrix. The connection between the coarse spaces for SPD and general matrices is also discussed. Unlike robust nonalgebraic coarse spaces, the adaptive condition number bound for the presented coarse space is not fully independent of the number of subdomains, although numerical experiments show the great effectiveness of the proposed preconditioners on matrices arising from a wide range of applications. The set of matrices includes SPD, symmetric indefinite, nonsymmetric, and saddle-point matrices. In addition, we compare the proposed preconditioners to the state-of-the-art domain decomposition preconditioners.


  • Open Access

    A δf PIC method with forward–backward Lagrangian reconstructions

    by M. Campos Pinto, M. Pelz, P.-H. Tournier

    In this work, we describe a δf particle simulation method where the bulk density is periodically remapped on a coarse spline grid using a forward–backward Lagrangian approach. This method is designed to handle plasma regimes where the densities strongly deviate from their initial state and may evolve into general profiles. We describe the method in the case of an electrostatic particle-in-cell scheme and validate its qualitative properties using a classical two-stream instability subject to a uniform oscillating drive.


  • Open Access

    Solution of time-harmonic Maxwell's equations by a domain decomposition method based on PML transmission conditions

    by Sahar Borzooei, Victorita Dolean, Pierre-Henri Tournier, Claire Migliaccio

    Numerical discretization of the large-scale Maxwell's equations leads to an ill-conditioned linear system that is challenging to solve. The key requirement for successive solutions of this linear system is to choose an efficient solver. In this work we use Perfectly Matched Layers (PML) to increase this efficiency. PML have been widely used to truncate numerical simulations of wave equations due to improving the accuracy of the solution instead of using absorbing boundary conditions (ABCs). Here, we will develop an efficient solver by providing an alternative use of PML as transmission conditions at the interfaces between subdomains in our domain decomposition method. We solve Maxwell's equations and assess the convergence rate of our solutions compared to the situation where absorbing boundary conditions are chosen as transmission conditions.

  • Open Access

    Does 3D frequency-domain FWI of full-azimuth/long-offset OBN data feasible? The Gorgon case study

    by S. Operto, P. Amestoy, H. S. Aghamiry, S. Beller, A. Buttari, L. Combe, V. Dolean, M. Gerest, G. Guo, P. Jolivet, et al.

    Frequency-domain Full Waveform Inversion (FWI) is potentially amenable to efficient processing of full-azimuth long-offset stationary-recording seabed acquisition carried out with sparse layout of ocean bottom nodes (OBNs) and broadband sources because the inversion can be performed with a few discrete frequencies. However, computing efficiently the solution of the forward (boundary-value) problem in the frequency domain with linear algebra solvers remains a challenge for large computational domains involving tens to hundreds of millions of parameters. We illustrate the feasibility of 3D frequency-domain FWI with the 2015/16 Gorgon OBN case study in the NorthWestern shelf, Australia. We solve the forward problem with the massively-parallel multifrontal direct solver MUMPS, which includes four key features to reach high computational efficiency: An efficient parallelism combining message-passing interface and multithreading, block low-rank compression, mixed precision arithmetic and efficient processing of sparse sources. The Gorgon subdataset involves 650 OBNs that are processed as reciprocal sources and 400,000 sources. Mono-parameter FWI for vertical wavespeed is performed in the visco-acoustic VTI approximation with a classical frequency continuation approach proceeding from a starting frequency of 1.7 Hz to a final frequency of 13 Hz. The target covers an area ranging from 260 km2 (frequency > 8.5 Hz) to 705 km2 (frequency < 8.5 Hz) for a maximum depth of 8 km. Compared to the starting model, FWI dramatically improves the reconstruction of the bounding faults of the Gorgon horst at reservoir depths as well as several intra-horst faults and several horizons of the Mungaroo formation down to a depth of 7 km.

  • 3D finite-difference and finite-element frequency-domain wave simulation with multilevel optimized additive Schwarz domain-decomposition preconditioner: A tool for full-waveform inversion of sparse node data sets

    by Pierre-Henri Tournier, Pierre Jolivet, Victorita Dolean, Hossein S. Aghamiry, Stéphane Operto, Sebastian Riffo

    Efficient frequency-domain full-waveform inversion (FWI) of long-offset node data can be designed with a few discrete frequencies, which lead to modest data volumes to be managed during the inversion process. Moreover, attenuation effects can be straightforwardly implemented in the forward problem without computational overhead. However, 3D frequency-domain seismic modeling is challenging because it requires solving a large and sparse linear indefinite system for each frequency with multiple right-hand sides (RHSs). This linear system can be solved by direct or iterative methods. The former allows efficient processing of multiple RHSs but may suffer from limited scalability for very large problems. Iterative methods equipped with a domain-decomposition preconditioner provide a suitable alternative to process large computational domains for sparse-node acquisition. We have investigated the domain-decomposition preconditioner based on the optimized restricted additive Schwarz (ORAS) method, in which a Robin or perfectly matched layer condition is implemented at the boundaries between the subdomains. The preconditioned system is solved by a Krylov subspace method, whereas a block low-rank lower-upper decomposition of the local matrices is performed at a preprocessing stage. Multiple sources are processed in groups with a pseudoblock method. The accuracy, the computational cost, and the scalability of the ORAS solver are assessed against several realistic benchmarks. In terms of discretization, we compare a compact wavelength-adaptive 27-point finite-difference stencil on a regular Cartesian grid with a P3 finite-element method on h-adaptive tetrahedral mesh. Although both schemes have comparable accuracy, the former is more computationally efficient, the latter being beneficial to comply with known boundaries such as bathymetry. The scalability of the method, the block processing of multiple RHSs, and the straightforward implementation of attenuation, which further improves the convergence of the iterative solver, make the method a versatile forward engine for large-scale 3D FWI applications from sparse node data sets.


  • Recent advances in domain decomposition methods for large-scale saddle point problems

    by Frédéric Nataf, Pierre-Henri Tournier

    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 spaces and on their open source implementations in domain specific languages such as FreeFem, focusing on a new domain decomposition for saddle point formulations with some numerical tests.