Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2308.00559

Help | Advanced Search

Mathematics > Numerical Analysis

arXiv:2308.00559 (math)
[Submitted on 1 Aug 2023 ]

Title: Random walks in frequency and the reconstruction of obstacles with cavities from multi-frequency data

Title: 频率中的随机游走以及从多频数据中重建带有空腔的障碍物

Authors:Travis Askham, Carlos Borges, Jeremy Hoskins, Manas Rachh
Abstract: Inverse obstacle scattering is the recovery of an obstacle boundary from the scattering data produced by incident waves. This shape recovery can be done by iteratively solving a PDE-constrained optimization problem for the obstacle boundary. While it is well known that this problem is typically non-convex and ill-posed, previous investigations have shown that in many settings these issues can be alleviated by using a continuation-in-frequency method and introducing a regularization that limits the frequency content of the obstacle boundary. It has been recently observed that these techniques can fail for obstacles with pronounced cavities, even in the case of penetrable obstacles where similar optimization and regularization methods work for the equivalent problem of recovering a piecewise constant wave speed. The present work investigates the recovery of obstacle boundaries for impenetrable, sound-soft media with pronounced cavities, given multi-frequency scattering data. Numerical examples demonstrate that the problem is sensitive to the choice of iterative solver used at each frequency and the initial guess at the lowest frequency. We propose a modified continuation-in-frequency method which follows a random walk in frequency, as opposed to the standard monotonically increasing path. This method shows some increased robustness in recovering cavities, but can also fail for more extreme examples. An interesting phenomenon is observed that while the obstacle reconstructions obtained over several random trials can vary significantly near the cavity, the results are consistent for non-cavity parts of the boundary.
Abstract: 逆障碍散射是从入射波产生的散射数据中恢复障碍边界。 这种形状恢复可以通过对障碍边界进行迭代求解PDE约束优化问题来完成。 虽然众所周知,这个问题通常是非凸且不适定的,但以前的研究表明,在许多情况下,通过使用频率延续方法并引入限制障碍边界频率内容的正则化,可以缓解这些问题。 最近观察到,对于具有明显空腔的障碍物,这些技术可能会失效,即使在可穿透障碍物的情况下,类似的优化和正则化方法对于恢复分段常数波速的等效问题是有效的。 本研究调查了在多频散射数据下,不可穿透的、声学软介质中具有明显空腔的障碍物边界的恢复。 数值例子表明,该问题对每个频率使用的迭代求解器的选择以及最低频率的初始猜测非常敏感。 我们提出了一种修改后的频率延续方法,该方法在频率上进行随机游走,而不是标准的单调递增路径。 这种方法在恢复空腔方面表现出一些增强的鲁棒性,但对于更极端的例子也可能失败。 观察到一个有趣的现象,即在多次随机试验中获得的障碍物重建在空腔附近可能有显著差异,但对于非空腔部分的边界结果是一致的。
Comments: 28 pages, 17 figures
Subjects: Numerical Analysis (math.NA)
MSC classes: 65N21, 45Q05
Cite as: arXiv:2308.00559 [math.NA]
  (or arXiv:2308.00559v1 [math.NA] for this version)
  https://doi.org/10.48550/arXiv.2308.00559
arXiv-issued DOI via DataCite

Submission history

From: Manas Rachh [view email]
[v1] Tue, 1 Aug 2023 13:59:11 UTC (6,347 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs.NA
< prev   |   next >
new | recent | 2023-08
Change to browse by:
cs
math
math.NA

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号