Next Article in Journal
Some Properties of the χ-Curvature under Conformal Transformation
Next Article in Special Issue
Combination of Multigrid with Constraint Data for Inverse Problem of Nonlinear Diffusion Equation
Previous Article in Journal
A Novel Price Prediction Service for E-Commerce Categorical Data
Previous Article in Special Issue
Image Reconstruction Algorithm Using Weighted Mean of Ordered-Subsets EM and MART for Computed Tomography
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Hybrid Method for Inverse Elastic Obstacle Scattering Problems

Department of Mathematics, Jinan University, Guangzhou 510632, China
*
Author to whom correspondence should be addressed.
Mathematics 2023, 11(8), 1939; https://doi.org/10.3390/math11081939
Submission received: 24 February 2023 / Revised: 7 April 2023 / Accepted: 17 April 2023 / Published: 20 April 2023
(This article belongs to the Special Issue Inverse Problems and Imaging: Theory and Applications)

Abstract

:
The problem of determining the shape of an object from knowledge of the far-field of a single incident wave in two-dimensional elasticity was considered. We applied an iterative hybrid method to tackle this problem. An advantage of this method is that it does not need a forward solver, and therefore, the exact boundary condition is not essential. By deriving the Fréchet derivatives of two boundary operators, we established reconstruction algorithms for objects with Dirichlet, Neumann, and Robin boundary conditions; by introducing a general boundary condition, we also established the reconstruction algorithm for objects with unknown physical properties. Numerical experiments showed the effectiveness of the proposed method.

1. Introduction

The inverse obstacle problem of recovering the location and shape of a scattering object from knowledge of the far-field is a classic problem in inverse scattering [1]. Recently, inverse obstacle problems of a scattered time-harmonic elastic wave have received increased attention for their significant applications in many scientific areas, such as geophysics and seismology [2,3,4,5,6,7,8]. We refer to [9,10,11,12] for a comprehensive introduction of the mathematical theory of direct and inverse elastic scattering problems.
If far-field data for a large number of incident elastic plane waves are available, both the location and shape of the obstacle can be reconstructed by using the linear sampling method [13], the factorization method [14,15,16], or reverse time migration [17]. However, if only the far-field pattern due to a single incident wave is available, the reconstruction becomes severely ill-posed and, thus, more challenging [6]. There exist some sampling-type methods for inverse elastic obstacle scattering problems using one incident wave, e.g., the extended sampling method [18,19], the one-wave factorization method [4,20], and the direct sampling method [2]. The sampling methods do not need prior information on the physical and geometrical properties of the obstacle, but they can only reconstruct the location and size of the obstacle. To determine the shape of the obstacle, one must use iterative methods [8,21,22,23,24]. Iterative methods can recover the shape of the obstacle with a suitable initial approximation; they usually require forward solvers and, therefore, need the boundary condition of the obstacle. When the physical property of the obstacle is not available, iterative methods may fail.
In this paper, we considered inverse elastic obstacle scattering problems using the far-field pattern due to one incident wave. For the unique results on the inverse problems, we refer to [20,25] and the references therein. We are interested in an iterative method for inverse acoustic obstacle scattering problems introduced by Chapko, Kress, and Serranho [26,27,28,29,30,31]. This method combines ideas of both the decomposition method [32,33,34] and iterative Newton methods [35,36] and is, therefore, called a hybrid method. Since the hybrid method obtains good reconstructions from far-field data for a single incident wave and does not need a forward solver, it can be improved and used even when the boundary condition is not available [37]. In this work, we give a nontrivial extension of the hybrid method and its improved version in [28,29,30,31,37] for the inverse elastic scattering problems. The elastic wave equation is more challenging because of the coexistence of compressional waves and shear waves propagating at different speeds, and the boundary conditions of the obstacle for elastic waves are more complicated. Hence, sophisticated modification is required in our extension.
The paper is organized as follows. In Section 2, we introduce the direct elastic scattering problem and four inverse problems. We prove that a general boundary equation system is always satisfied on the exact boundary of the object. In Section 3, we give the Fréchet derivatives of five boundary operators, which are important for our iterative schemes. Section 4 is devoted to hybrid methods for four inverse problems. In Section 5, numerical experiments are given to demonstrate the effectiveness and promising features of the proposed numerical methods. Finally, in Section 6, we make some conclusions.

2. Direct and Inverse Scattering Problems

We begin with the notation used throughout this paper. For a non-zero vector x R 2 , let x ^ : = x / | x | and x ^ be obtained by rotating x ^ clockwise by π / 2 . For the vector function u = ( u 1 ; u 2 ) , in addition to the usual differential operators grad u j : = ( 1 u j ; 2 u j ) , j = 1 , 2 and div u : = 1 u 1 + 2 u 2 , we made use of grad u j : = ( 2 u j ; 1 u j ) and div u : = 1 u 2 2 u 1 , where i denotes / x i , i = 1 , 2 .
The propagation of time-harmonic waves in an isotropic homogeneous medium with Lamé constants λ and μ ( μ > 0 , 2 μ + λ > 0 ) and density ρ is governed by the Navier equation (or system):
Δ u + ρ ω 2 u = 0 ,
where u denotes the displacement field, ω denotes the angular frequency, and the differential operator Δ u : = μ Δ u + ( λ + μ ) grad div u . In this paper, we assumed ρ 1 . It is well known that any solution u of (1) can be decomposed as
u = u p + u s ,
where
u p : = 1 k p 2 grad div u , u s : = 1 k s 2 grad div u
are known as the compressional part of u associated with the compressional wavenumber k p : = ω / 2 μ + λ and the shear part of u associated with the shear wavenumber k s : = ω / μ , respectively.
The direct elastic scattering problem for an obstacle is as follows: Given a bounded domain D of class C 2 and an incident field u inc such that u inc is a solution of (1) in a neighborhood of D and u inc | D [ C ( D ) ] 2 , find the scattered field u sca [ C 2 ( R 2 \ D ¯ ) C 1 ( R 2 \ D ) ] 2 and total field u : = u sca + u inc subject to
Δ u + ω 2 u = 0 , in R 2 \ D ¯ , B ( u ) = 0 , on D , lim r r ( u p sca / r i k p u p sca ) = 0 , r = | x | , lim r r ( u s sca / r i k s u s sca ) = 0 , r = | x | .
The operator B in (3) defines the boundary condition on D , which depends on the physical properties of the scatterer. The most-frequently occurring boundary conditions are as follows:
(1)
The Dirichlet boundary condition:
u = 0 on D ,
for a rigid body;
(2)
The Neumann boundary condition:
T ν u = 0 on D ,
for a cavity, where T ν : = 2 μ ν + λ ν div μ ν div denotes the surface traction operator and ν is the unit outward normal to D ;
(3)
The Robin boundary condition:
T ν u + i σ u = 0 on D ,
for an obstacle with some real-valued parameter σ > 0 .
For the unique solvability of the scattering problem (3) in the space [ H l o c 1 ( R 2 \ D ¯ ) ] 2 , we refer to [9,21].
It is well known that every radiation solution to the Navier equation has an asymptotic behavior of the form:
u sca ( x ) = e i k p | x | | x | u p ( x ^ ) x ^ + e i k s | x | | x | u s ( x ^ ) x ^ + O | x | 3 / 2 , | x |
uniformly in all directions x ^ , where u p and u s are analytic functions on the unit circle S 2 : = { x ^ R 2 ; | x ^ | = 1 } . Throughout this paper, u ( x ^ ) : = ( u p ( x ^ ) ; u s ( x ^ ) ) is defined as the far-field pattern of u sca , and u p and u s are defined as the compressional part and shear part of the far-field pattern, respectively.
The inverse scattering problem of interest is to reconstruct the shape of the scatterer with the far-field pattern of all observation directions available, but only one single incident wave. In particular, four inverse elastic scattering problems are considered:
IP1.
If the Dirichlet boundary condition is known to be satisfied on D , determine the shape of the scatterer D from the far-field pattern u ( x ^ ) , x ^ S due to one incident wave.
IP2.
If the Neumann boundary condition is known to be satisfied on D , determine the shape of the scatterer D from the far-field pattern u ( x ^ ) , x ^ S due to one incident wave.
IP3.
If the Robin boundary condition is known to be satisfied on D , determine the shape of the scatterer D from the far-field pattern u ( x ^ ) , x ^ S due to one incident wave.
IP4.
If the boundary condition on D is unknown, determine the shape of the scatterer D from the far-field pattern u ( x ^ ) , x ^ S due to one incident wave.
For the inverse elastic scattering problems with a single incident wave, there are some uniqueness results proven within polygonal, polyhedral, or ball scatterers, and establishing the general uniqueness results still remains challenging open problem (see [15,20,25]).
When the boundary condition is unknown, the following theorem is crucial for the numerical solution of IP4.
Theorem 1.
The total field u = ( u 1 ; u 2 ) satisfies u = 0 , T ν u = 0 , or T ν u + i σ u = 0 for any x D if and only if u satisfies
T ν u . u + T ν u . u = 0 T ν u . u + T ν u . u = 0 T ν u . u T ν u . u = 0 T ν u . u T ν u . u = 0
for x D , where ( A ) and ( A ) denote the real and imaginary parts of vector A, respectively, and A . B denotes the elementwise product of vectors A and B.
Proof. 
For any point x D , if u = 0 or T ν u = 0 at x, it is apparent that u satisfies (8) at x. If T ν u + i σ u = 0 at x, by taking the real part and the imaginary part of this equation, we have
T ν u = σ u ,
T ν u = σ u ,
which imply
T ν u = σ u ,
T ν u = σ u ,
and we can easily obtain (8) from the above four equations.
On the other hand, if (8) is satisfied on D , then
u . T ν u i u . T ν u = u + i u . T ν u i u . T ν u + i T ν u = T ν u . u + T ν u . u = 0 .
Similarly, we can deduce
u . T ν u + i u . T ν u = 0 ,
u . T ν u i u . T ν u = 0 ,
u . T ν u + i u . T ν u = 0 .
Taking the elementwise products of (9)–(12) with i u , i u , i u , i u and then taking the sum of these four equations, we obtain
u . u + u . u + u . u + u . u . T ν u + i u . [ T ν u . u T ν u . u + T ν u . u T ν u . u ] = 0 on D .
The above equation implies that u = 0 , or T ν u + i σ u = 0 at any point x D , where
σ ( x ) = ( w 1 ) ( u 1 ) + ( w 2 ) ( u 2 ) ( w 1 ) ( u 1 ) ( w 2 ) ( u 2 ) ( u 1 ) 2 + ( u 1 ) 2 + ( u 2 ) 2 + ( u 2 ) 2 .
Here, w 1 and w 2 denote the two components of w : = T ν u . □
Remark 1.
From Theorem 1, if the total field of the elastic scattering problem satisfies the Dirichlet, Neumann, or Robin boundary condition on D , it must satisfy the general boundary condition (8) on D .

3. Fréchet Derivatives of Five Boundary Operators

In this section, let Γ be any closed C 2 -contour, let v be a C 1 smooth scalar function in the space near Γ , and assume that boundary Γ has a parametric form:
Γ = { z ( t ) : t [ 0 , 2 π ] }
with z ( t ) C 2 [ 0 , 2 π ] × C 2 [ 0 , 2 π ] .
The operators that we will consider include the normal operator ν : C 2 [ 0 , 2 π ] × C 2 [ 0 , 2 π ] C [ 0 , 2 π ] × C [ 0 , 2 π ] :
ν : z z | z | ,
the tangential operator τ : C 2 [ 0 , 2 π ] × C 2 [ 0 , 2 π ] C [ 0 , 2 π ] × C [ 0 , 2 π ] :
τ : z z | z | ,
the Dirichlet operator B D , v : C 2 [ 0 , 2 π ] × C 2 [ 0 , 2 π ] C [ 0 , 2 π ] that maps the parameterization z of the contour Γ to the exterior trace of v over Γ , that is
B D , v : z v z ,
the normal derivative operator B N , v : C 2 [ 0 , 2 π ] × C 2 [ 0 , 2 π ] C [ 0 , 2 π ] that maps the parameterization z of the contour Γ to the exterior trace of v / ν over Γ , that is
B N , v : z v ν z ,
and the tangential derivative operator B T , v : C 2 [ 0 , 2 π ] × C 2 [ 0 , 2 π ] C [ 0 , 2 π ] that maps the parameterization z of the contour Γ to the exterior trace of the v / τ over Γ , that is
B T , v : z v τ z .
The Fréchet derivatives of the Dirichlet operator, normal operator, and normal derivative operator were considered in [28,31].
Theorem 2
([31]). The Dirichlet operator B D , v defined in (15) is Fréchet differentiable, and the Frećhet derivative is given by
B D , v ( z ) h = ( ν · h ) v ν z + ( τ · h ) v τ z .
Theorem 3
([31]). The normal operator ν defined in (13) is Fréchet differentiable, and its Fréchet derivative is given by
ν ( z ) h = 1 | z | ( h · ν ) τ .
Theorem 4
([28]). The operator B N , v defined in (16) is Fréchet differentiable, and the Fréchet derivative is given by
B N , v ( z ) h = ( h · ν ) | z | v τ z + ( h · τ ) 2 v τ ν z H v τ z + ( h · ν ) 2 v ν 2 ,
where H = ( z · ν ) / | z | 2 .
In the following, we characterize the Fréchet derivatives of the tangential operator and the tangential derivative operator.
Theorem 5.
The tangential operator τ defined in (14) is Fréchet differentiable. The Fréchet derivative is given by
τ ( z ) h = 1 | z | ( h · ν ) ν .
Proof. 
Since τ ( z ) = z | z | , we have
τ ( z + h ) τ ( z ) = z + h | z + h | z | z | .
From Taylor’s formula,
z + h | z + h | z | z | = 1 | z | 3 z 2 2 h 1 z 1 z 2 h 2 z 1 z 2 h 1 + z 1 2 h 2 + O ( | h | 2 ) = 1 | z | 3 | z | 2 h z ( z · h ) + O ( | h | 2 ) = 1 | z | h ( h · τ ) τ + O ( | h | 2 ) = 1 | z | ( h · ν ) ν + O ( | h | 2 )
These two equations imply
lim h C 2 0 τ ( z + h ) τ ( z ) 1 | z | ( h · ν ) ν h C 2 = 0 .
One can obtain the derivative of τ ( z ) by the definition of the Fréchet derivative. □
Theorem 6.
The operator B T , v defined in (17) is Frećhet differentiable, and the Fréchet derivative is given by
B T , v ( z ) h = ( h · ν ) z v ν z + ( h · τ ) H v ν z + 2 v τ 2 z + ( h · ν ) 2 v τ ν z H v τ z ,
where H = ( z · ν ) / | z | 2 .
Proof. 
Let h be sufficiently small to ensure that
Γ z + h = { z ( t ) + h ( t ) : t [ 0 , 2 π ] }
describes a closed curve.
We divided B T , v ( z + h ) B T , v ( z ) into two parts:
B T , v ( z + h ) B T , v ( z ) = ( τ · grad v ) ( z + h ) ( τ · grad v ) z = z + h z + h · grad v ( z + h ) z z · grad v z = z + h z + h z z · grad v ( z + h ) + z z grad v ( z + h ) grad v z .
For the first term on the right side of (23), by using Taylor’s formula, we have
grad v ( z + h ) grad v ( z ) = O ( | h | ) ,
and
z + h z + h z z = 1 z ( h · ν ) ν + O ( | h | 2 ) .
These two equations imply
z + h z + h z z · grad v ( z + h ) = ( h · ν ) z v ν + O ( | h | 2 ) + O ( | h | | h | ) .
Now, we considered the second term on the right side of (23). A new coordinate system ( t , ε ) is introduced (see [31,38]). The relation between the new system and the Cartesian coordinate system is
x ( t , ε ) = z ( t ) + ε ν ( t ) , t [ 0 , 2 π ] , ε ( ε 0 , ε 0 ) ,
where ν ( t ) is the abbreviation of ν ( z ( t ) ) . In this new coordinate system, the gradient of v can be rewritten as (see [31,38])
grad v ( t , ε ) = 1 z ( t ) + ε ν ( t ) 2 v t ( t , ε ) z ( t ) + ε ν ( t ) + v ε ( t , ε ) ν ( t ) .
If we let σ = ( h · τ ) / | z | and ϵ = h · ν , then
z ( t ) + h ( t ) = z ( t ) + h ( t ) · τ ( t ) τ ( t ) + h ( t ) · ν ( t ) ν ( t ) = z ( t ) + σ z ( t ) + ϵ ν ( t ) = z ( t + σ ) + ϵ ν ( t + σ ) + O ( | h | 2 ) .
Using (25) and (26), together with Taylor’s formula, we have
grad v ( z + h ) grad v z = grad v z ( t + σ ) + ϵ ν ( t + σ ) + O ( | h | 2 ) grad v z ( t ) = grad v z ( t + σ ) + ϵ ν ( t + σ ) grad v z ( t ) + O ( | h | 2 ) = grad v ( t + σ , ϵ ) grad v ( t , 0 ) + O ( | h | 2 ) = z ( t + σ ) + ϵ ν ( t + σ ) z ( t + σ ) + ϵ ν ( t + σ ) 2 v t ( t + σ , ϵ ) + v ε ( t + σ , ϵ ) ν ( t + σ ) z ( t ) z ( t ) 2 v t ( t , 0 ) v ε ( t , 0 ) ν ( t ) = z ( t + σ ) + ϵ ν ( t + σ ) z ( t + σ ) + ϵ ν ( t + σ ) 2 z ( t ) z ( t ) 2 v t ( t + σ , ϵ ) + z ( t ) z ( t ) 2 v t ( t + σ , ϵ ) v t ( t , 0 ) + v ε ( t + σ , ϵ ) v ε ( t , 0 ) ν ( t + σ ) + ν ( t + σ ) ν ( t ) v ε ( t , 0 ) = 1 | z | 2 σ ( z · ν ) ν σ ( z · τ ) τ ϵ ( ν · τ ) τ v t ( t , 0 ) + τ z ϵ 2 v t ε ( t , 0 ) + σ 2 v t 2 ( t , 0 ) + ν σ v ε ( t , 0 ) + ν σ 2 v t ε ( t , 0 ) + ϵ 2 v ε 2 ( t , 0 ) + O ( | h | 2 ) .
Therefore, with (27), σ = ( h · τ ) / | z | , and ϵ = h · ν , we have
τ · grad v ( z + h ) grad v z = 1 | z | 2 σ ( z · τ ) + ϵ ( ν · τ ) v t ( t , 0 ) + 1 z ϵ 2 v t ε ( t , 0 ) + σ 2 v t 2 ( t , 0 ) + σ ( ν · τ ) v ε ( t , 0 ) + O ( | h | 2 ) = ( h · τ ) | z | 3 ( z · τ ) + ( h · ν ) | z | 2 ( ν · τ ) v t ( t , 0 ) + ( h · ν ) z 2 v t ε ( t , 0 ) + ( h · τ ) z 2 2 v t 2 ( t , 0 ) + ( h · τ ) z ( ν · τ ) v ε ( t , 0 ) + O ( | h | 2 ) .
To simplify (28), we use the relations
ν · τ = 1 | z | ( ν · z ) ,
v ε ( t , 0 ) = grad v ( t , 0 ) · ν ( t ) = v ν z ,
1 z ( t ) v t ( t , 0 ) = grad v ( t , 0 ) · τ ( t ) = v τ z ,
1 z ( t ) 2 2 v t 2 ( t , 0 ) = 2 v τ 2 z + ( τ · z ) z 2 v τ z ,
1 z ( t ) 2 v ε t ( t , 0 ) = 2 v τ ν z ,
where (29) is obtained by direct computation, (30) and (31) are obtained from (25), and the relations (32) and (33) are obtained by replacing v with v t in (30) and (31). With the relations (29)–(33) and (28), we can write the second term on the right side of (23) as
τ · ( grad u ( z + h ) grad u z ) = ( h · ν ) H u τ z + ( h · ν ) 2 u τ ν z + ( h · τ ) 2 u τ 2 z + ( h · τ ) H u ν z + O ( | h | 2 ) ,
where H : = ( z · ν ) / | z | 2 .
Inserting (24) and (34) into (23), one can obtain the expression of the Fréchet derivative of B T , v from the definition of the Fréchet derivative. □

4. Hybrid Method

In this section, we propose a hybrid method to reconstruct the shape of the scatterer D from the far-field pattern u ( x ^ ) = ( u p ( x ^ ) , u s ( x ^ ) ) , x ^ S 2 of the elastic scattering problem (3); more specifically, we solve the four inverse problems IP1, IP2, IP3, and IP4.

4.1. Basic Algorithm of the Hybrid Method

The hybrid method consists of two steps in the same spirit as a decomposition method, which are iterated until some stopping criterion is achieved as in an iterative method. We denote the approximation at the nth iteration to the exact boundary D by a closed C 2 -contour Γ n and suppose that Γ n can be parameterized by a C 2 -smooth function z n ( t ) , t [ 0 , 2 π ] .
In the first step, we compute the total field u, its normal derivative u ν , and its tangential derivative u τ on Γ n from the far-field pattern u ( x ^ ) : = ( u p ( x ^ ) ; u s ( x ^ ) ) , x ^ S . The fundamental solution tensor to the Navier equation (1) is (see [39])
Φ ( x , y ) : = i 4 π H 0 ( 1 ) ( k s | x y | ) I + i 4 ω 2 grad x grad x T H 0 ( 1 ) ( k s | x y | ) H 0 ( 1 ) ( k p | x y | )
in terms of the identity matrix, I, and the Hankel function of the first kind of order zero, H 0 ( 1 ) . Using the Bessel differential equation, straightforward computations yield a representation of the form
Φ ( x , y ) = Φ 1 ( | x y | ) I + Φ 2 ( | x y | ) J ( | x y | ) ,
where, for w R 2 \ { 0 } , the matrix J is given by
J ( w ) = w w T | w | 2 ,
and where, for r > 0 , the functions Φ 1 and Φ 2 are given by
Φ 1 ( r ) = i 4 μ H 0 ( 1 ) ( k s r ) i 4 ω 2 r k s H 1 ( 1 ) ( k s r ) k p H 1 ( 1 ) ( k p r ) , Φ 2 ( r ) = i 4 ω 2 2 k s r H 1 ( 1 ) ( k s r ) k s 2 H 0 ( 1 ) ( k s r ) 2 k p r H 1 ( 1 ) ( k p r ) + k p 2 H 0 ( 1 ) ( k p r ) ,
with the Hankel function of the first kind of order one H 1 ( 1 ) = H 0 ( 1 ) . Then, choose Γ ˜ n to be a closed curve inside and near Γ n and seek the scattered field u sca in the form of an elastic single-layer potential over Γ ˜ n [39]:
u sca ( x ) = Γ ˜ n Φ ( x , y ) φ ( y ) d s ( y ) , x R 2 \ Γ ˜ n .
From the asymptotics for Hankel functions, it follows that the far-field patterns of the above single-layer potential are given by
u p ( x ^ ) = 1 λ + 2 μ e i π / 4 8 π k p Γ ˜ n x ^ · φ ( y ) e i k p x ^ · y d s ( y ) , x ^ S ,
u s ( x ^ ) = 1 μ e i π / 4 8 π k s Γ ˜ n ( x ^ · φ ( y ) ) e i k s x ^ · y d s ( y ) , x ^ S .
In the experiments, the density function φ can be numerically solved from (36) and (37) using the Nyström method and the Tikhonov regularization method. Then, the scattered field u sca , its normal derivative u sca ν , and its tangential derivative u sca τ on Γ n can be solved from (35). Since the incident waves are known, the total field u and its normal derivative u ν and tangential derivative u τ on Γ n can be reconstructed.
In the second step, we solved for the improved approximation Γ n + 1 from Γ n . Suppose the total field u satisfies the boundary condition B ( u ) = 0 on the exact boundary D . We considered the boundary operator G : C 2 [ 0 , 2 π ] × C 2 [ 0 , 2 π ] C [ 0 , 2 π ] × C [ 0 , 2 π ] that maps a closed contour Γ with parameterization z onto the trace of the boundary condition of the total field u on Γ , that is
G : z B ( u ) z .
Apparently, if the parameterization of D is z , then
G ( z ) = 0 .
In the spirit of Newton’s method, we linearized this equation based on the Fréchet derivative of G and solved
G ( z n ) + G ( z n ) h = 0
to obtain the shift h and a new approximation Γ n + 1 to D given by z n + 1 = z n + h . We summarize the basic algorithm as follows:
Basic algorithm:
  • Start with an initial guess Γ 0 : = { z 0 ( t ) , t [ 0 , 2 π ] } of the exact boundary D .
  • Solve for the total field u, its normal derivative u ν , and its tangential derivative u τ on the approximation boundary Γ n : = { z n ( t ) , t [ 0 , 2 π ] } :
    a.
    Use Tikhonov regularization to compute φ ( y ) , y Γ ˜ n from the discrete version of (36) and (37), where Γ ˜ n is a closed curve inside and near Γ n .
    b.
    Compute the scattered field u sca , its normal derivative u sca ν , and its tangential derivative u sca τ on Γ n from (35).
    c.
    Estimate the total field u, its normal derivative u ν , and its tangential derivative u τ on Γ n .
  • Solve for the shift h ( t ) from the linearized Equation (39) (the linearized equations for different inverse problems are particularized in Section 4.2), and then, update the approximation with Γ n + 1 given by z n + 1 = z n + h .
  • Repeat Steps 2 and 3 with n = n + 1 until G ( z n + 1 ) L 2 > G ( z n ) L 2 .

4.2. Linearized Equations for Different Inverse Problems

Once the expression of the linearized Equation (39) is given, the hybrid method can be iteratively implemented by following the basic algorithm above. Because the linearized Equation (39) is based on the boundary condition, which has different forms for different inverse problems, we need to particularize the linearized equation for each of these inverse problems.

4.2.1. Linearized Equation for IP1

For the inverse problem IP1, we denote the linearized equation by
G D ( z ) + G D ( z ) h = 0
for any approximation Γ to D with parameterization Γ : = { z ( t ) , t [ 0 , 2 π ] } .
Since the Dirichlet boundary condition u = 0 is satisfied on the exact boundary D , from the definition of G in (38), the boundary operator for IP1 is
G D ( z ) = u z ,
where u is considered to be a vector, that is
G D ( z ) = u 1 z u 2 z .
According to Theorem 2, we have the Fréchet derivative of G D :
G D ( z ) h = ( ν · h ) u 1 ν z + ( τ · h ) u 1 τ z ( ν · h ) u 2 ν z + ( τ · h ) u 2 τ z .
Therefore, the linearized equation for IP1 is (40), where G D ( z ) and G D ( z ) h are defined in (42) and (43), respectively.

4.2.2. Linearized Equation for IP2

For the inverse problem IP2, we denote the linearized equation by
G N ( z ) + G N ( z ) h = 0
for any approximation Γ to D with parameterization Γ : = { z ( t ) , t [ 0 , 2 π ] } .
Since the total field u satisfies the Neumann boundary condition
T ν u : = 2 μ u ν + λ ν div u + μ τ div u = 0
on the exact boundary D , from the definition of G in (38), the boundary operator for IP2 is
G N ( z ) = 2 μ u ν z + λ ( ν div u ) z + μ ( τ div u ) z ,
where ν = ( ν 1 ; ν 2 ) and τ = ( τ 1 ; τ 2 ) are normal and tangential vectors on Γ and
div u = u 1 x 1 + u 2 x 2 = ν 1 u 1 ν + τ 1 u 1 τ + ν 2 u 2 ν + τ 2 u 2 τ ,
div u = u 2 x 1 u 1 x 2 = ν 1 u 2 ν + τ 1 u 2 τ ν 2 u 1 ν τ 2 u 1 τ .
Since u, ν , and τ are all vectors, we can rewrite (45) by
G N ( z ) = 2 μ u 1 ν z u 2 ν z + λ ( div u z ) ν 1 ( z ) ν 2 ( z ) + μ ( div u z ) τ 1 ( z ) τ 2 ( z ) .
Now let us consider the Fréchet derivative of G N . According to Theorem 3 and Theorem 5, we have the Fréchet derivatives ν ( z ) h and τ ( z ) h of operators ν ( z ) and τ ( z ) , which imply the expressions of the Fréchet derivatives of the components ν 1 ( z ) , ν 2 ( z ) , τ 1 ( z ) , and τ 2 ( z ) :
ν j ( z ) h = ( h · ν ) | z | τ j , τ j ( z ) h = ( h · ν ) | z | ν j , j = 1 , 2 .
For the operators B N , u 1 : z u 1 ν z and B N , u 2 : z u 2 ν z , from Theorem 4, the Fréchet derivatives are
B N , u j ( z ) h = ( h · ν ) | z | u j τ z + ( h · τ ) 2 u j τ ν z H u j τ z + ( h · ν ) 2 u j ν 2 z , j = 1 , 2 ,
For the operators B T , u 1 : z u 1 τ z and B T , u 2 : z u 2 τ z , from Theorem 6, the Fréchet derivatives have the expression
B T , u j ( z ) h = ( h · ν ) z u j ν z + ( h · τ ) H u j ν z + 2 u j τ 2 z + ( h · ν ) 2 u j τ ν z H u j τ z , j = 1 , 2 .
Then, by using the product rule, we have the Fréchet derivative of G N ( z ) , which is
G N ( z ) h = 2 μ B N , u 1 ( z ) h B N , u 2 ( z ) h + λ ( div u z ) ν 1 ( z ) ν 2 ( z ) λ ( h · ν ) | z | ( div u z ) τ 1 ( z ) τ 2 ( z ) + μ ( div u z ) τ 1 ( z ) τ 2 ( z ) + μ ( h · ν ) | z | ( div u z ) ν 1 ( z ) ν 2 ( z ) ,
where
div u z = ν 1 ( z ) h u 1 ν z + ν 1 ( z ) B N , u 1 ( z ) h + τ 1 ( z ) h u 1 τ z + τ 1 ( z ) B T , u 1 ( z ) h + ν 2 ( z ) h u 2 ν z + ν 2 ( z ) B N , u 2 ( z ) h + τ 2 ( z ) h u 2 τ z + τ 2 ( z ) B T , u 2 ( z ) h
and
div u z = ν 1 ( z ) h u 2 ν z + ν 1 ( z ) B N , u 2 ( z ) h + τ 1 ( z ) h u 2 τ z + τ 1 ( z ) B T , u 2 ( z ) h ν 2 ( z ) h u 1 ν z ν 2 ( z ) B N , u 1 ( z ) h τ 2 ( z ) h u 1 τ z τ 2 ( z ) B T , u 1 ( z ) h .
In summary, the linearized equation for IP2 is (44), where G N ( z ) and G N ( z ) h are defined in (46) and (47), respectively.

4.2.3. Linearized Equation for IP3

For the inverse problem IP3, we denote the linearized equation by
G R ( z ) + G R ( z ) h = 0
for any approximation Γ to D with parameterization Γ : = { z ( t ) , t [ 0 , 2 π ] } .
Since the total field u satisfies the Robin boundary condition:
2 μ u ν + λ ν div u + μ τ div u + i σ u = 0
on the exact boundary D , according to the definition of G in (38), the boundary operator for IP3 is
G R ( z ) = 2 μ u ν z + λ ( ν div u ) z + μ ( τ div u ) z + i σ u z .
From the definitions of G D in (42) and G N in (46), G R ( z ) can be rewritten as
G R ( z ) = G N ( z ) + i σ G D ( z ) .
Based on the Fréchet derivatives of G D and G N in (43) and (47), the Fréchet derivative of G R is
G R ( z ) h = G N ( z ) h + i σ G D ( z ) h .
Therefore, the linearized equation for IP3 is (48), where G R ( z ) and G R ( z ) h are defined in (50) and (51), respectively.

4.2.4. Linearized Equation for IP4

For the inverse problem IP4, we denote the linearized equation by
G U ( z ) + G U ( z ) h = 0 ,
for any approximation Γ to D with parameterization Γ : = { z ( t ) , t [ 0 , 2 π ] } .
For the inverse problem IP4, the boundary condition of the object is unknown. However, according to Theorem 1, if the total field u satisfies the Dirichlet, Neumann, or Robin boundary condition on the exact boundary D , then it satisfies the general boundary condition:
T ν u . u + T ν u . u = 0 T ν u . u + T ν u . u = 0 T ν u . u T ν u . u = 0 T ν u . u T ν u . u = 0
on D . From the definition of G in (38), with the definitions of G D in (42) and G N in (46), the boundary operator G for IP4 is
G U ( z ) = G N ( z ) . G D ( z ) + G N ( z ) . G D ( z ) G N ( z ) . G D ( z ) + G N ( z ) . G D ( z ) G N ( z ) . G D ( z ) G N ( z ) . G D ( z ) G N ( z ) . G D ( z ) G N ( z ) . G D ( z ) .
By using the product rule, the Fréchet derivatives of G D in (43), and the Fréchet derivatives of G N in (47), we have
G U ( z ) h = G N ( z ) h . G D ( z ) + G N ( z ) . G D ( z ) h + G N ( z ) h . G D ( z ) + G N ( z ) . G D ( z ) h G N ( z ) h . G D ( z ) + G N ( z ) . G D ( z ) h + G N ( z ) h . G D ( z ) + G N ( z ) . G D ( z ) h G N ( z ) h . G D ( z ) + G N ( z ) . G D ( z ) h G N ( z ) h . G D ( z ) G N ( z ) . G D ( z ) h G N ( z ) h . G D ( z ) + G N ( z ) . G D ( z ) h G N ( z ) h . G D ( z ) G N ( z ) . G D ( z ) h
In summary, the linearized equation for IP4 is (52), where G U ( z ) is defined in (53) and G U ( z ) h is given in the equation above.

5. Numerical Experiments

We present some numerical examples to show the performance of the proposed method. Three obstacles will be used: a triangle-shaped obstacle given by
( 1 + 0.15 cos 3 t ) cos t , sin t , t [ 0 , 2 π ] ,
a peanut-shaped obstacle given by
cos 2 t + 0.25 sin 2 t cos t , sin t , t [ 0 , 2 π ] ,
and a kite-shaped obstacle given by
0.8 sin t 0.4 cos 2 t , 0.8 cos t , t [ 0 , 2 π ] .
We set the parameters in the Navier equation to be ω = 3 , μ = 1 , λ = 1 . In the case of the Robin boundary condition, we set σ = 2 . The incident wave was set to be a plane wave u i n c ( x ) = d e i k p x · d + d e i k s x · d with incident direction d = ( 0 , 1 ) . The synthetic far-field data u p ( x ^ j ) and u s ( x ^ j ) were generated at 128 equidistant points x ^ j , j = 1 , 2 , , 128 on the unit circle by using the boundary integral method in [39] with 2 % noise added.
The reconstructions are restricted to the star-shaped domain, that is the reconstructions Γ n , n = 1 , 2 , in the iterations have the parameterization:
z n ( t ) = r n ( t ) ( cos t , sin t ) + ( c 1 ( n ) , c 2 ( n ) ) , t [ 0 , 2 π ] .
where r n ( t ) is the radius function and ( c 1 ( n ) , c 2 ( n ) ) is the location. In our experiments, we used the radial function:
r n ( t ) = a 0 ( n ) + j = 1 N a j ( n ) cos j t + b j ( n ) sin j t
of degree N = 5 .
We implemented the algorithm given in Section 4.1 to iteratively reconstruct the boundaries of the obstacles from the noisy far-field data. There are two steps in each iteration of the reconstruction algorithm. In the first step, we set Γ ˜ n to be a contraction of Γ n with parameterization
z ˜ n ( t ) = 0.9 r n ( t ) ( cos t , sin t ) + ( c 1 ( n ) , c 2 ( n ) ) , t [ 0 , 2 π ] .
Equations (36) and (37) were solved considering 128 points over the closed curve Γ ˜ n . Then, the total field u, its normal derivative u / ν , and its tangential derivative u / τ can be computed at 128 discrete points on Γ n using the discrete form of (35). In the second step, since the shift function h ( t ) has the same form as z n ( t ) ,
h ( t ) = a 0 ( h ) + j = 1 N a j ( h ) cos j t + b j ( h ) sin j t ( cos t , sin t ) + ( c 1 ( h ) , c 2 ( h ) ) , t [ 0 , 2 π ] ,
the linearized Equation (39) can be discretized into a linear system of 2 N + 3 real variables a 0 ( h ) , c 1 ( h ) , c 2 ( h ) , and a j ( h ) , b j ( h ) , j = 1 , 2 , , N . One should consider both the real part and imaginary parts of the linear system to obtain real solutions. In the computation of the discrete system of (39), if 2 u / ν 2 , 2 u / τ 2 , and 2 u / τ ν occur in the expressions of G , one can use the difference method or the second derivatives of (35) to solve them. Our experiments used the difference method to solve 2 u / ν 2 , 2 u / τ 2 , and 2 u / τ ν based on u / ν and u / τ . Tikhonov regularization was used in the solution of (36) and (37) and in the solution of the linearized Equation (39), and the regularization parameters were determined by the L-curve method [40].
In the following figures, the blue solid lines are the exact boundaries, the red dashed lines are the reconstructions, and the black dotted lines are the initial guesses of the boundaries.

5.1. Examples for IP1

For the inverse problem IP1, the Dirichlet boundary condition is known to be satisfied on the exact boundary of the obstacle. The hybrid method for IP1 is used in this subsection, that is the linearized Equation (40) was used in the algorithm.
Figure 1 displays reconstructions of the rigid triangle: The left panel shows the reconstruction result, and the initial guess is a circle with radius 0.5 centered at ( 0.1 , 0.2 ) . The right panel is the plot of u L 2 ( Γ n ) against the number of iterations n. We can see that the Dirichlet boundary condition is satisfied increasingly well on the n -th approximation Γ n as n increases. Similar reconstruction results for the rigid peanut and rigid kite are shown in Figure 2.

5.2. Examples for IP2

For the inverse problem IP2, the Neumann boundary condition is known to be satisfied on the exact boundary of the obstacle. The hybrid method for IP2 is used in this subsection, that is the linearized Equation (44) was used in the algorithm.
Figure 3 displays the reconstructions of the cavity triangle. The left panel shows the reconstruction result when the initial guess is a circle with radius 0.5 centered at ( 0.1 , 0.2 ) ; the right panel is the plot of T ν u L 2 ( Γ n ) against the number of iterations n. We can see that the Neumann boundary condition is satisfied increasingly well on Γ n as the iteration number n increases. Similar reconstruction results for the cavity peanut and cavity kite are shown in Figure 4.

5.3. Examples for IP3

For the inverse problem IP3, the Robin boundary condition is known to be satisfied on the exact boundary of the obstacle. The hybrid method for IP3 is used in this subsection, that is the linearized Equation (48) is used in the algorithm.
Figure 5 displays reconstructions of the triangle with the Robin boundary condition: The left panel shows the reconstruction result when the initial guess is a circle with radius 0.5 centered at ( 0.1 , 0.2 ) . The right panel is the plot of T ν u + i σ u L 2 ( Γ n ) against the number of iterations n. We can see that the Robin boundary condition is increasingly satisfied on the n -th approximation Γ n as n increases. Similar reconstruction results for the peanut-shaped obstacle with the Robin boundary condition and the kite-shaped obstacle with the Robin boundary condition are shown in Figure 6.

5.4. Examples for IP4

For the inverse problem IP4, the boundary condition is unknown, and the hybrid method for IP4 is based on the artificial general boundary condition (8). For all the experiments in this subsection, the boundary conditions of the obstacles were not used in the reconstruction algorithm; they were only used in the generation of the synthetic far-field data.
Figure 7 displays reconstructions of the triangle-shaped obstacle with the Dirichlet boundary condition: the left panel shows the reconstruction result when the initial guess is a circle with radius 0.5 centered at ( 0.1 , 0.2 ) ; the right panel is the plot of G U ( z n ) L 2 against the number of iterations n. We can see that the artificial boundary condition is increasingly satisfied on the n -th approximation Γ n as n increases. Similar reconstructions for the peanut with the Neumann boundary condition and kite with the Robin boundary condition are shown in Figure 8 and Figure 9, respectively. Figure 10 shows the reconstruction results for these three obstacles with the other two boundary conditions.
The hybrid iterative method also works with different initial guesses and different incident waves. Figure 11 shows the reconstruction results when we changed the initial guess to be B 0.8 ( 0 , 0 ) , which is a circle with radius 0.8 centered at the origin. Figure 12 shows the reconstruction results when we changed the incident direction to ( 1 , 0 ) .
For the case of an acoustic wave, a local convergence result for the hybrid method was established in [31]. For the case of an elastic wave, we can also observe the local convergence of the hybrid method from Figure 1, Figure 3, Figure 5, and Figure 7, Figure 8 and Figure 9.

6. Conclusions

In this paper, we considered four inverse elastic scattering problems of reconstructing obstacles using the far-field of a single incident wave. For the first three inverse elastic scattering problems, the boundary conditions of the obstacles are available. By introducing Fréchet derivatives of the tangential operator and tangential derivative operator, we extended the hybrid method for inverse acoustic scattering problems to the case of inverse elastic scattering problems. For the fourth inverse elastic scattering problem with the boundary condition unknown, by introducing a general boundary condition and analyzing the equivalence of the general boundary condition and three commonly used boundary conditions, we extended the hybrid method to solve the fourth inverse elastic scattering problem.
As far as we know, the existing iterative methods for inverse elastic obstacle scattering problems require forward solvers and, therefore, need the boundary condition of the obstacle. In this paper, we established an iterative method that can reconstruct obstacles with or without known boundary conditions. This is significant because one can determine the shapes of obstacles even when the physical properties of the obstacles are not available. The numerical experiments showed the efficiency of the method.
In the future, with the theoretical results regarding the boundary conditions and Fréchet derivatives of the boundary operators, we hope to propose iterative methods for more inverse obstacle problems with complicated boundary conditions.

Author Contributions

Methodology, J.L.; software, Y.Y.; writing—original draft, Y.Y.; writing—review and editing, J.L. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the NSF of China under Grant No. 11801218.

Data Availability Statement

The data presented in this study are available on request from the corresponding author. The data are not publicly available due to privacy.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Colton, D.L.; Kress, R. Inverse Acoustic and Electromagnetic Scattering Theory; Springer: Berlin/Heidelberg, Germany, 1998; Volume 93. [Google Scholar]
  2. Ji, X.; Liu, X.; Xi, Y. Direct sampling methods for inverse elastic scattering problems. Inverse Probl. 2018, 34, 035008. [Google Scholar] [CrossRef]
  3. Ji, X.; Liu, X. Inverse elastic scattering problems with phaseless far-field data. Inverse Probl. 2019, 35, 114004. [Google Scholar] [CrossRef]
  4. Ma, G.; Hu, G. Factorization method with one plane wave: From model-driven and data-driven perspectives. Inverse Probl. 2021, 38, 015003. [Google Scholar] [CrossRef]
  5. Hu, G.; Mantile, A.; Sini, M.; Yin, T. Direct and Inverse Time-Harmonic Elastic Scattering from Point-Like and Extended Obstacles. Inverse Probl. Imaging 2020, 14, 1025–1056. [Google Scholar] [CrossRef]
  6. Ma, G.; Hu, G. Factorization method for inverse time-harmonic elastic scattering with a single plane wave. Discret. Contin. Dyn. Syst.-B 2022, 27, 7469–7492. [Google Scholar] [CrossRef]
  7. Meng, Q.; Bai, Z.; Diao, H.; Liu, H. Effective medium theory for embedded obstacles in elasticity with applications to inverse problems. SIAM J. Appl. Math. 2022, 82, 720–749. [Google Scholar] [CrossRef]
  8. Dong, H.; Lai, J.; Li, P. Inverse obstacle scattering for elastic waves with phased or phaseless far-field data. SIAM J. Imaging Sci. 2019, 12, 809–838. [Google Scholar] [CrossRef]
  9. Kupradze, V.D.; Gegelia, T.G.; Basheleishvili, M.O.; Burchuladze, T.V. Three-Dimensional Problems of the Mathematical Theory of Elasticity and Thermoelasticity. Appl. Mech. ASME J. 1979. [Google Scholar] [CrossRef]
  10. Bonnet, M.; Constantinescu, A. Inverse problems in elasticity. Inverse Probl. 2005, 21, R1. [Google Scholar] [CrossRef]
  11. Lurie, A.I. Theory Elast; Springer: Berlin/Heidelberg, Germany, 2010. [Google Scholar]
  12. Ammari, H.; Bretin, E.; Garnier, J.; Kang, H.; Lee, H.; Wahab, A. Mathematical Methods in Elasticity Imaging; Princeton University Press: Princeton, NJ, USA, 2015; Volume 52. [Google Scholar]
  13. Arens, T. Linear sampling methods for 2D inverse elastic wave scattering. Inverse Probl. 2001, 17, 1445. [Google Scholar] [CrossRef]
  14. Alves, C.J.; Kress, R. On the far-field operator in elastic obstacle scattering. IMA J. Appl. Math. 2002, 67, 1–21. [Google Scholar] [CrossRef]
  15. Hu, G.; Kirsch, A.; Sini, M. Some inverse problems arising from elastic scattering by rigid obstacles. Inverse Probl. 2012, 29, 015009. [Google Scholar] [CrossRef]
  16. Xiang, J.; Yan, G. The factorization method for a mixed inverse elastic scattering problem. IMA J. Appl. Math. 2022, 87, 407–437. [Google Scholar] [CrossRef]
  17. Chen, Z.; Huang, G. Reverse time migration for extended obstacles: Elastic waves. Sci. China Math. 2015, 45, 1103–1114. (In Chinese) [Google Scholar]
  18. Liu, J.; Liu, X.; Sun, J. Extended sampling method for inverse elastic scattering problems using one incident wave. SIAM J. Imaging Sci. 2019, 12, 874–892. [Google Scholar] [CrossRef]
  19. Liu, J.; Sun, J. Extended sampling method in inverse scattering. Inverse Probl. 2018, 34, 085007. [Google Scholar] [CrossRef]
  20. Elschner, J.; Hu, G. Uniqueness and factorization method for inverse elastic scattering with a single incoming wave. Inverse Probl. 2019, 35, 094002. [Google Scholar] [CrossRef]
  21. Li, P.; Wang, Y.; Wang, Z.; Zhao, Y. Inverse obstacle scattering for elastic waves. Inverse Probl. 2016, 32, 115018. [Google Scholar] [CrossRef]
  22. Bao, G.; Hu, G.; Sun, J.; Yin, T. Direct and inverse elastic scattering from anisotropic media. J. Mathématiques Pures Appliquées 2018, 117, 263–301. [Google Scholar] [CrossRef]
  23. Li, P.; Yuan, X. Inverse obstacle scattering for elastic waves in three dimensions. Inverse Probl. Imaging 2019, 13, 545–573. [Google Scholar] [CrossRef]
  24. Li, Z.; Sun, J.; Xu, L. An extended sampling-ensemble Kalman filter approach for partial data inverse elastic problems. Inverse Probl. Sci. Eng. 2021, 29, 2534–2550. [Google Scholar] [CrossRef]
  25. Elschner, J.; Yamamoto, M. Uniqueness in inverse elastic scattering with finitely many incident waves. Inverse Probl. 2010, 26, 045005. [Google Scholar] [CrossRef]
  26. Chapko, R.; Kress, R. A hybrid method for inverse boundary value problems in potential theory. J. Inverse Ill-Posed Probl. 2005, 13, 27–40. [Google Scholar] [CrossRef]
  27. Kress, R.; Serranho, P. A hybrid method for two-dimensional crack reconstruction. Inverse Probl. 2005, 21, 773. [Google Scholar] [CrossRef]
  28. Kress, R.; Serranho, P. A hybrid method for sound-hard obstacle reconstruction. J. Comput. Appl. Math. 2007, 204, 418–427. [Google Scholar] [CrossRef]
  29. Serranho, P. A hybrid method for inverse scattering for shape and impedance. Inverse Probl. 2006, 22, 663. [Google Scholar] [CrossRef]
  30. Serranho, P. A hybrid method for inverse scattering for sound-soft obstacles in R3. Inverse Probl. Imaging 2007, 1, 691. [Google Scholar] [CrossRef]
  31. Serranho, P. A Hybrid Method for Inverse Obstacle Scattering Problems. Ph.D Thesis, Georg-August-Universität Göttingen, Göttingen, Germany, 2007. [Google Scholar]
  32. Kirsch, A.; Kress, R. On an integral equation of the first kind in inverse acoustic scattering. In Inverse Problems; Springer: Berlin/Heidelberg, Germany, 1986; pp. 93–102. [Google Scholar]
  33. Kirsch, A.; Kress, R. A numerical method for an inverse scattering problem. In Inverse and Ill-Posed Problems; Elsevier: Amsterdam, The Netherlands, 1987; pp. 279–289. [Google Scholar]
  34. Elschner, J.; Hsiao, G.C.; Rathsfeld, A. An optimization method in inverse acoustic scattering by an elastic obstacle. SIAM J. Appl. Math. 2009, 70, 168–187. [Google Scholar] [CrossRef]
  35. Kress, R.; Rundell, W. Nonlinear integral equations and the iterative solution for an inverse boundary value problem. Inverse Probl. 2005, 21, 1207. [Google Scholar] [CrossRef]
  36. Ivanyshyn, O.; Kress, R. Nonlinear integral equations for solving inverse boundary value problems for inclusions and cracks. J. Integral Equ. Appl. 2006, 18, 13–38. [Google Scholar] [CrossRef]
  37. Liu, J.; Fuming, M. An Improved Hybrid Method for Inverse Obstacle Scattering Problems. Commun. Math. Res. 2011, 27, 215–226. [Google Scholar]
  38. Vinogradov, S.S.; Smith, P.D.; Vinogradova, E.D. Canonical Problems in Scattering and Potential Theory Part II: Acoustic and Electromagnetic Diffraction by Canonical Structures; CRC: Boca Raton, FL, USA, 2002. [Google Scholar]
  39. Kress, R. Inverse elastic scattering from a crack. Inverse Probl. 1996, 12, 667. [Google Scholar] [CrossRef]
  40. Hansen, P.C. Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems. Numer. Algorithms 1994, 6, 1–35. [Google Scholar] [CrossRef]
Figure 1. Reconstruction of the triangle with Dirichlet BC by the hybrid method for IP1. Left: reconstruction result after 9 iterations. Right: plot of u L 2 ( Γ n ) against the number of iterations n.
Figure 1. Reconstruction of the triangle with Dirichlet BC by the hybrid method for IP1. Left: reconstruction result after 9 iterations. Right: plot of u L 2 ( Γ n ) against the number of iterations n.
Mathematics 11 01939 g001
Figure 2. Reconstructions of the peanut and the kite with Dirichlet BC by the hybrid method for IP1. Left: reconstruction result for the rigid peanut after 50 iterations. Right: reconstruction result for the rigid kite after 13 iterations.
Figure 2. Reconstructions of the peanut and the kite with Dirichlet BC by the hybrid method for IP1. Left: reconstruction result for the rigid peanut after 50 iterations. Right: reconstruction result for the rigid kite after 13 iterations.
Mathematics 11 01939 g002
Figure 3. Reconstruction of the triangle with Neumann BC by the hybrid method for IP2. Left: reconstruction result after 34 iterations. Right: plot of T ν u L 2 ( Γ n ) against the number of iterations n.
Figure 3. Reconstruction of the triangle with Neumann BC by the hybrid method for IP2. Left: reconstruction result after 34 iterations. Right: plot of T ν u L 2 ( Γ n ) against the number of iterations n.
Mathematics 11 01939 g003
Figure 4. Reconstructions of the peanut and the kite with Neumann BCs by the hybrid method for IP2. Left: reconstruction result for the peanut after 50 iterations. Right: reconstruction result for the kite after 24 iterations.
Figure 4. Reconstructions of the peanut and the kite with Neumann BCs by the hybrid method for IP2. Left: reconstruction result for the peanut after 50 iterations. Right: reconstruction result for the kite after 24 iterations.
Mathematics 11 01939 g004
Figure 5. Reconstructions of the triangle with Robin BC by the hybrid method for IP3. Left: reconstruction result after 35 iterations. Right: plot of T ν u + i σ u L 2 ( Γ n ) against the number of iterations n.
Figure 5. Reconstructions of the triangle with Robin BC by the hybrid method for IP3. Left: reconstruction result after 35 iterations. Right: plot of T ν u + i σ u L 2 ( Γ n ) against the number of iterations n.
Mathematics 11 01939 g005
Figure 6. Reconstructions of the peanut and kite with Robin BCs by the hybrid method for IP3. Left: reconstruction result for the peanut after 20 iterations. Right: reconstruction result for the kite after 20 iterations.
Figure 6. Reconstructions of the peanut and kite with Robin BCs by the hybrid method for IP3. Left: reconstruction result for the peanut after 20 iterations. Right: reconstruction result for the kite after 20 iterations.
Mathematics 11 01939 g006
Figure 7. Reconstructions of the triangle with Dirichlet BC by the hybrid method for IP4. Left: reconstruction result after 13 iterations. Right: plot of G U ( u ) L 2 ( Γ n ) against the number of iterations n.
Figure 7. Reconstructions of the triangle with Dirichlet BC by the hybrid method for IP4. Left: reconstruction result after 13 iterations. Right: plot of G U ( u ) L 2 ( Γ n ) against the number of iterations n.
Mathematics 11 01939 g007
Figure 8. Reconstructions of the peanut with Neumann BC by the hybrid method for IP4. Left: reconstruction result after 12 iterations. Right: plot of G U ( u ) L 2 ( Γ n ) against the number of iterations n.
Figure 8. Reconstructions of the peanut with Neumann BC by the hybrid method for IP4. Left: reconstruction result after 12 iterations. Right: plot of G U ( u ) L 2 ( Γ n ) against the number of iterations n.
Mathematics 11 01939 g008
Figure 9. Reconstructions of the kite with Robin BC by the hybrid method for IP4. Left: reconstruction result after 13 iterations. Right: plot of G U ( u ) L 2 ( Γ n ) against the number of iterations n.
Figure 9. Reconstructions of the kite with Robin BC by the hybrid method for IP4. Left: reconstruction result after 13 iterations. Right: plot of G U ( u ) L 2 ( Γ n ) against the number of iterations n.
Mathematics 11 01939 g009
Figure 10. Reconstruction results of three obstacles with different boundary conditions by the hybrid method for IP4: (a) reconstruction of the triangle with Neumann BC after 14 iterations; (b) reconstruction of the triangle with Robin BC after 16 iterations; (c) reconstruction of the peanut with Dirichlet BC after 24 iterations; (d) reconstruction of the peanut with Robin BC after 37 iterations; (e) reconstruction of the kite with Dirichlet BC after 15 iterations; (f) reconstruction of the kite with Neumann BC after 13 iterations.
Figure 10. Reconstruction results of three obstacles with different boundary conditions by the hybrid method for IP4: (a) reconstruction of the triangle with Neumann BC after 14 iterations; (b) reconstruction of the triangle with Robin BC after 16 iterations; (c) reconstruction of the peanut with Dirichlet BC after 24 iterations; (d) reconstruction of the peanut with Robin BC after 37 iterations; (e) reconstruction of the kite with Dirichlet BC after 15 iterations; (f) reconstruction of the kite with Neumann BC after 13 iterations.
Mathematics 11 01939 g010
Figure 11. Reconstruction results by the hybrid method for IP4 with the initial guess B 0.8 ( 0 , 0 ) : (a) reconstruction of the triangle with Dirichlet BC after 8 iterations; (b) reconstruction of the peanut with Neumann BC after 9 iterations; (c) reconstruction of the kite with Robin BC after 7 iterations.
Figure 11. Reconstruction results by the hybrid method for IP4 with the initial guess B 0.8 ( 0 , 0 ) : (a) reconstruction of the triangle with Dirichlet BC after 8 iterations; (b) reconstruction of the peanut with Neumann BC after 9 iterations; (c) reconstruction of the kite with Robin BC after 7 iterations.
Mathematics 11 01939 g011
Figure 12. Reconstruction results by the hybrid method for IP4 with the incident direction ( 1 , 0 ) : (a) reconstruction of the triangle with Dirichlet BC after 18 iterations; (b) reconstruction of the peanut with Neumann BC after 13 iterations; (c) reconstruction of the kite with Robin BC after 30 iterations.
Figure 12. Reconstruction results by the hybrid method for IP4 with the incident direction ( 1 , 0 ) : (a) reconstruction of the triangle with Dirichlet BC after 18 iterations; (b) reconstruction of the peanut with Neumann BC after 13 iterations; (c) reconstruction of the kite with Robin BC after 30 iterations.
Mathematics 11 01939 g012
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yin, Y.; Liu, J. Hybrid Method for Inverse Elastic Obstacle Scattering Problems. Mathematics 2023, 11, 1939. https://doi.org/10.3390/math11081939

AMA Style

Yin Y, Liu J. Hybrid Method for Inverse Elastic Obstacle Scattering Problems. Mathematics. 2023; 11(8):1939. https://doi.org/10.3390/math11081939

Chicago/Turabian Style

Yin, Yuhan, and Juan Liu. 2023. "Hybrid Method for Inverse Elastic Obstacle Scattering Problems" Mathematics 11, no. 8: 1939. https://doi.org/10.3390/math11081939

APA Style

Yin, Y., & Liu, J. (2023). Hybrid Method for Inverse Elastic Obstacle Scattering Problems. Mathematics, 11(8), 1939. https://doi.org/10.3390/math11081939

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop