Faculty Advisor

Marcus Sarkis

Faculty Advisor

Homer Walker

Faculty Advisor

L. Ramdas Ram-Mohan

Faculty Advisor

Darko Volkov

Faculty Advisor

Mourad Sini

Faculty Advisor

Mahadevan Ganesh




We are interested in solving the time-harmonic inverse acoustic scattering problem for planar sound-soft obstacles. In this work, we introduce four methods for solving inverse scattering problems. The first method is a variation of the method introduced by Johansson and Sleeman. This method solves the inverse problem when we have the far field pattern given for only one incident wave. It is an iterative method based on a pair of integral equations used to obtain the far field pattern of a known single object. The method proposed in this thesis has a better computational performance than the method of Johansson and Sleeman. The second method we present is a multi-frequency method called the recursive linearization algorithm. This method solves the inverse problem when the far field pattern is given for multiple frequencies. The idea of this method is that from an initial guess, we solve the single frequency inverse problem for the lowest frequency. We use the result obtained as the initial guess to solve the problem for the next highest frequency. We repeat this process until we use the data from all frequencies. To solve the problem at each frequency, we use the first method proposed. To improve the quality of the reconstruction of the shadowed part of the object, we solve the inverse scattering problem of reconstructing an unknown sound-soft obstacle in the presence of known scatterers. We show that depending on the position of the scatterers, we may be able to obtain very accurate reconstructions of the entire unknown object. Next, we introduce a method for solving the inverse problem of reconstructing a convex sound-soft obstacle, given measures of the far field pattern at two frequencies that are not in the resonance region of the object. This method is based on the use of an approximation formula for the far field pattern using geometric optics. We are able to prove that for the reconstruction of the circle of radius $R$ and center at the origin, the size of the interval of convergence of this method is proportional to the inverse of the wavenumber. This procedure is effective at reconstructing the illuminated part of the object; however, it requires an initial guess close to the object for frequencies out of the resonance region. Finally, we propose a globalization technique to obtain a better initial guess to solve the inverse problem at frequencies out of the resonance region. In this technique, given the far field pattern of a convex object at two frequencies out of the resonance region, we use our extrapolation operator to generate synthetic data for low frequencies. We apply the recursive linearization algorithm, using as a single frequency solver the method that is based on geometric optics. We obtain an approximation of the object that can be used as the initial guess to apply the recursive linearization algorithm using the first method introduced as the single frequency solver.


Worcester Polytechnic Institute

Degree Name



Mathematical Sciences

Project Type


Date Accepted





Inverse problems, numerical methods