Abstract

This paper concerns the Bayesian approach to inverse acoustic scattering problems of inferring the position and shape of a sound-soft obstacle from phaseless far-field data generated by two-dimensional point source waves. Given the total number of obstacle parameters, the Markov chain Monte Carlo (MCMC) method is employed to reconstruct the boundary of the obstacle in a high-dimensional space, which usually leads to slow convergence and prohibitively high computational cost. We use the Gibbs sampling and preconditioned Crank–Nicolson (pCN) algorithm with random proposal variance to improve the convergence rate, and design an effective strategy for the surrogate model constructed by the generalized polynomial chaos (gPC) method to reduce the computational cost of MCMC. Numerical examples are provided to illustrate the effectiveness of the proposed method.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.