Three-dimensional finite-difference finite-element frequency-domain wave simulation with multi-level optimized additive Schwarz domain-decomposition preconditioner : A tool for FWI of sparse node datasets

Tournier, Pierre-Henri and Jolivet, Pierre and Dolean, Victorita and Aghamiry, Hossein S. and Operto, Stéphane and Riffo, Sebastian (2022) Three-dimensional finite-difference finite-element frequency-domain wave simulation with multi-level optimized additive Schwarz domain-decomposition preconditioner : A tool for FWI of sparse node datasets. Geophysics, 87 (5). pp. 1-84. ISSN 1942-2156 (https://doi.org/10.1190/geo2021-0702.1)

[thumbnail of Tournier-etal-Geophysics-2022-Three-dimensional-finite-difference finite-element-frequency-domain-wave-simulation-with-multi-level-optimized-additive]
Preview
 Text. Filename: Tournier_etal_Geophysics_2022_Three_dimensional_finite_difference_finite_element_frequency_domain_wave_simulation_with_multi_level_optimized_additive.pdf
Accepted Author Manuscript
License: Strathprints license 1.0
Download (41MB)| Preview

Abstract

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 the 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.

ORCID iDs

Tournier, Pierre-Henri, Jolivet, Pierre, Dolean, Victorita ORCID logoORCID: https://orcid.org/0000-0002-5885-1903, Aghamiry, Hossein S., Operto, Stéphane and Riffo, Sebastian;
CORE (COnnecting REpositories)