TY - GEN
T1 - A parallel iterative solver for 3-D frequency-domain seismic wave modeling in viscoelastic anisotropic media
AU - Ma, G.
AU - Zhou, B.
AU - Zemerly, J.
AU - Riahi, M.
N1 - Publisher Copyright:
© 2023 84th EAGE Annual Conference and Exhibition. All rights reserved.
PY - 2023
Y1 - 2023
N2 - It is always challenging to solve a large sparse linear system in frequency-domain forward modelling in seismic full-waveform inversion. Moreover, in viscoelastic anisotropic media, because the number of moduli and nonzero elements in the matrix grows higher, the computational load is heavier than in viscoacoustic media. To solve this issue, parallel direct solvers (e.g., MUMPS) can be used, but the cost of computer resources is usually too expensive to afford. By contrast, iterative solvers require much fewer computer resources, but they usually have a slow convergence and difficulty in solving multiple sources. Therefore, we demonstrate a parallel iterative solver named P-PCG that enables us to deal with the multiple sources simultaneously but without greatly increasing memory cost. The linear system in our modelling has a dimension of 35.5 million and over 3.9 billion nonzero elements in the matrix. To accomplish this work, MUMPS takes 13.6 hours, 4407 gigabytes and 17 cores, whereas P-PCG only takes 6.3 hours, 64 gigabytes and 5 cores. Another multiple-source modelling shows that on our computer P-PCG can solve 15 sources simultaneously with acceptable speed and much less memory cost than MUMPS. Thus, the P-PCG is a good alternative solver when the computational resources are limited.
AB - It is always challenging to solve a large sparse linear system in frequency-domain forward modelling in seismic full-waveform inversion. Moreover, in viscoelastic anisotropic media, because the number of moduli and nonzero elements in the matrix grows higher, the computational load is heavier than in viscoacoustic media. To solve this issue, parallel direct solvers (e.g., MUMPS) can be used, but the cost of computer resources is usually too expensive to afford. By contrast, iterative solvers require much fewer computer resources, but they usually have a slow convergence and difficulty in solving multiple sources. Therefore, we demonstrate a parallel iterative solver named P-PCG that enables us to deal with the multiple sources simultaneously but without greatly increasing memory cost. The linear system in our modelling has a dimension of 35.5 million and over 3.9 billion nonzero elements in the matrix. To accomplish this work, MUMPS takes 13.6 hours, 4407 gigabytes and 17 cores, whereas P-PCG only takes 6.3 hours, 64 gigabytes and 5 cores. Another multiple-source modelling shows that on our computer P-PCG can solve 15 sources simultaneously with acceptable speed and much less memory cost than MUMPS. Thus, the P-PCG is a good alternative solver when the computational resources are limited.
UR - https://www.scopus.com/pages/publications/85195583955
M3 - Conference contribution
AN - SCOPUS:85195583955
T3 - 84th EAGE Annual Conference and Exhibition
SP - 1969
EP - 1973
BT - 84th EAGE Annual Conference and Exhibition
T2 - 84th EAGE Annual Conference and Exhibition
Y2 - 5 June 2023 through 8 June 2023
ER -