2014
DOI: 10.1051/m2an/2013114
|View full text |Cite
|
Sign up to set email alerts
|

Sweeping preconditioners for elastic wave propagation with spectral element methods

Abstract: We present a parallel preconditioning method for the iterative solution of the time-harmonic elastic wave equation which makes use of higher-order spectral elements to reduce pollution error. In particular, the method leverages perfectly matched layer boundary conditions to efficiently approximate the Schur complement matrices of a block LDL T factorization. Both sequential and parallel versions of the algorithm are discussed and results for large-scale problems from exploration geophysics are presented.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(10 citation statements)
references
References 23 publications
(31 reference statements)
0
10
0
Order By: Relevance
“…The first linear complexity claim was perhaps made in the work of Engquist and Ying (2011), followed by Stolk (2013). Other authors have since then proposed related methods with similar properties, including Chen and Xiang (2013) and Vion and Geuzaine (2014); however, they are often difficult to parallelize, and they usually rely on distributed linear algebra such as Poulson et al (2013) and Tsuji et al (2014), or highly tuned multigrid methods such as Stolk et al (2013) and Calandra et al (2013). As we put the final touches to this note, Liu and Ying (2015) proposed a recursive sweeping algorithm closely related to the one presented in this note.…”
Section: Introductionmentioning
confidence: 99%
“…The first linear complexity claim was perhaps made in the work of Engquist and Ying (2011), followed by Stolk (2013). Other authors have since then proposed related methods with similar properties, including Chen and Xiang (2013) and Vion and Geuzaine (2014); however, they are often difficult to parallelize, and they usually rely on distributed linear algebra such as Poulson et al (2013) and Tsuji et al (2014), or highly tuned multigrid methods such as Stolk et al (2013) and Calandra et al (2013). As we put the final touches to this note, Liu and Ying (2015) proposed a recursive sweeping algorithm closely related to the one presented in this note.…”
Section: Introductionmentioning
confidence: 99%
“…The application of such ideas to the Helmholtz problem can be traced back, to great extent, to the AILU preconditioner of Gander and Nataf [43], in which a layered domain decomposition was used; and to Plessix and Mulder [76] in which a similar idea is used using separation of variables. However, it was Engquist and Ying who showed in [33,32] that such ideas could yield fast methods to solve the high-frequency Helmholtz equation, by introducing the sweeping preconditioner, which was then extended by Tsuji and collaborators to different discretizations and physics [89,90,91]. Since then, many other papers have proposed methods with similar claims.…”
Section: Related Workmentioning
confidence: 99%
“…[3,46]. When domain decomposition is considered, the sweeping preconditioner [42] is an attractive alternative.…”
Section: Introductionmentioning
confidence: 99%