2020
DOI: 10.1002/nsg.12100
|View full text |Cite
|
Sign up to set email alerts
|

Transdimensional and Hamiltonian Monte Carlo inversions of Rayleigh‐wave dispersion curves: a comparison on synthetic datasets

Abstract: We compare two Monte Carlo inversions that aim to solve some of the main problems of dispersion curve inversion: deriving reliable uncertainty appraisals, determining the optimal model parameterization and avoiding entrapment in local minima of the misfit function. The first method is a transdimensional Markov chain Monte Carlo that considers as unknowns the number of model parameters, that is the locations of layer boundaries together with the Vs and the Vp/Vs ratio of each layer. A reversible‐jump Markov cha… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
6
1
1

Relationship

3
5

Authors

Journals

citations
Cited by 20 publications
(11 citation statements)
references
References 72 publications
0
11
0
Order By: Relevance
“…Another viable strategy to reduce the burn‐in period could be starting the MCMC sampling from the model predicted by a local inversion. More advanced MCMC algorithms that incorporate the principles of Hamiltonian dynamics into the standard Metropolis–Hasting method (Betancourt, 2017; Fichtner et al ., 2019; Gebraad et al ., 2020; Aleardi et al ., 2020; Aleardi and Salusti, 2020b) could be useful to speed up the probabilistic ERT inversion. The major computational requirement of the Hamiltonian Monte Carlo algorithm is the need for computing the derivative (i.e.…”
Section: Discussionmentioning
confidence: 99%
“…Another viable strategy to reduce the burn‐in period could be starting the MCMC sampling from the model predicted by a local inversion. More advanced MCMC algorithms that incorporate the principles of Hamiltonian dynamics into the standard Metropolis–Hasting method (Betancourt, 2017; Fichtner et al ., 2019; Gebraad et al ., 2020; Aleardi et al ., 2020; Aleardi and Salusti, 2020b) could be useful to speed up the probabilistic ERT inversion. The major computational requirement of the Hamiltonian Monte Carlo algorithm is the need for computing the derivative (i.e.…”
Section: Discussionmentioning
confidence: 99%
“…Molnar et al (2010) employed a Bayesian framework and Markov Chain Monte Carlo (MCMC) method to cast the surface wave DCs data inversion into a solid probabilistic statement for accurate estimation of a posterior probability density (PPD). Aleardi et al (2020) performed a rigorous study and comparison of transdimensional and reversible-jump MCMC inversions of Rayleigh-wave DCs. Aleardi and Stucchi (2021) state MCMC methods are computationally expensive due to the huge number of samples needed to attain stable PPDs.…”
Section: Introductionmentioning
confidence: 99%
“…These algorithms transform the Bayesian inversion process into a sampling problem in which the sampling density is proportional to the PPD. Although the increasing computational power provided by modern parallel architectures has considerably encouraged the applications of MCMC methods to solve geophysical problems (Fichtner and Zunino et al ., 2019; Stuart et al ., 2019; Aleardi et al ., 2020; Aleardi, 2020a), it is always crucial adopting specific recipes to guarantee an accurate and computationally efficient sampling of the PPD. For example, many MCMC algorithms (e.g.…”
Section: Introductionmentioning
confidence: 99%