Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
2000 character limit reached

Inverse obstacle scattering for elastic waves in the time domain (2109.02286v1)

Published 6 Sep 2021 in math.NA and cs.NA

Abstract: This paper concerns an inverse elastic scattering problem which is to determine a rigid obstacle from time domain scattered field data for a single incident plane wave. By using Helmholtz decomposition, we reduce the initial-boundary value problem of the time domain Navier equation to a coupled initial-boundary value problem of wave equations, and prove the uniqueness of the solution for the coupled problem by employing energy method. The retarded single layer potential is introduced to establish the coupled boundary integral equations, and the uniqueness is discussed for the solution of the coupled boundary integral equations. Based on the convolution quadrature method for time discretization, the coupled boundary integral equations are reformulated into a system of boundary integral equations in s-domain, and then a convolution quadrature based nonlinear integral equation method is proposed for the inverse problem. Numerical experiments are presented to show the feasibility and effectiveness of the proposed method.

Citations (3)

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.