Papers › The linear sampling method for data generated by small random scatterers
The linear sampling method for data generated by small random scatterers
J. Garnier, H. Haddar, H. Montanelli
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present an extension of the linear sampling method for solving the sound-soft inverse scattering problem in two dimensions with data generated by randomly distributed small scatterers. The theoretical justification of our novel sampling method is based on a rigorous asymptotic model, a modified Helmholtz--Kirchhoff identity, and our previous work on the linear sampling method for random sources. Our numerical implementation incorporates boundary elements, Singular Value Decomposition, Tikhonov regularization, and Morozov's discrepancy principle. We showcase the robustness and accuracy of our algorithms with a series of numerical experiments.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections