Matrix-Free Parallel Preconditioned Iterative Solvers for the 2D Helmholtz Equation Discretized with Finite Differences

Conference Paper (2024)
Author(s)

J. Chen (TU Delft - Numerical Analysis)

V.N.S.R. Dwarka (TU Delft - Numerical Analysis)

C. Vuik (TU Delft - Delft Institute of Applied Mathematics)

Research Group
Numerical Analysis
DOI related publication
https://doi.org/10.1007/978-3-031-54517-7_7
More Info
expand_more
Publication Year
2024
Language
English
Research Group
Numerical Analysis
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.@en
Volume number
43
Pages (from-to)
61-68
ISBN (print)
978-3-031-54516-0
ISBN (electronic)
978-3-031-54517-7
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

We present a matrix-free parallel iterative solver for the Helmholtz equation related to applications in seismic problems and study its parallel performance. We apply Krylov subspace methods, GMRES, Bi-CGSTAB and IDR(s), to solve the linear system obtained from a second-order finite difference discretization. The Complex Shifted Laplace Preconditioner (CSLP) is employed to improve the convergence of Krylov solvers. The preconditioner is approximately inverted by multigrid iterations. For parallel computing, the global domain is partitioned blockwise. The standard MPI library is employed for data communication. The matrix-vector multiplication and preconditioning operator are implemented in a matrix-free way instead of constructing large, memory-consuming coefficient matrices. These adjustments lead to direct improvements in terms of memory consumption. Numerical experiments of model problems show that the matrix-free parallel solution method has satisfactory parallel performance and weak scalability. It allows us to solve larger problems in parallel to obtain more accurate numerical solutions.

Files

978-3-031-54517-7_7.pdf
(pdf | 0.259 Mb)
- Embargo expired in 01-09-2024
License info not available