Next Article in Journal
Patterns of Open Innovation Between Industry and University: A Fuzzy Cluster Analysis Based on the Antecedents of Their Collaboration
Previous Article in Journal
A Non-Self-Referential Characterization of the Gram–Schmidt Process via Computational Induction
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Inverse Acoustic Scattering from a Bounded Homogeneous Penetrable Obstacle

School of Mathematics, Jilin University, Changchun 130012, China
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(5), 771; https://doi.org/10.3390/math13050771
Submission received: 5 February 2025 / Revised: 23 February 2025 / Accepted: 24 February 2025 / Published: 26 February 2025

Abstract

:
We consider time domain acoustic scattering from a bounded homogeneous penetrable obstacle. The problem is reduced to a system of time-dependent integral equations on the boundary of the scatter. Our aim is to determine the location and shape of the obstacle. Using convolution quadrature in time combined with the nonlinear integral equation method, we obtain the Helmholtz equation with complex wave numbers. Then the iterative scheme is presented to solve the nonlinear boundary integral equations, and the fully discrete system is given. Numerical experiments are presented to show the effectiveness of the proposed method.

1. Introduction

Acoustic scattering problems have received increasing attention in diverse scientific areas such as medical diagnostics, ultrasound tomography, geophysical exploration, and nondestructive testing. However, compared with the frequency domain data, the time domain data is easier to get and contains more information at discrete frequencies. Thus, it is natural to consider the time domain inverse scattering problems. Although time domain inversion algorithms are more challenging due to the time dependence, different methods have been used to solve this problem either theoretically or numerically. Such as the enclosure method, linear sampling method, factorization method, Laguerre transform method, etc. For the framework of the enclosure method with dynamical data and its applications, we refer to [1]. For numerical examples of using the enclosure method for finding the convex hull of polygonal cavities, we refer to [2], and in the case of electromagnetic waves in the time domain, we refer to [3]. The advantage of this method is that one can calculate the support function of an unknown polygonal obstacle from only one measurement in a theoretical sense. However, the formula is ensured to work for estimating the value of the support function at only ‘regular’ directions. Using the enclosure method for the heat equation, we refer to [4], and for more details, we refer to [5,6]. The linear sampling method [7] is also a feasible tool in inverse acoustic scattering problems for the wave equation with Dirichlet, Robin, and Neumann boundary conditions from time domain measurements of scattered waves. In the article [8], the author determined the support of the inhomogeneity from measurements of causal scattered waves by using the linear sampling method in the time domain, and the first examples of using this method in three dimensions are included. The linear sampling method for sparse small aperture data we refer to [9]. Refer to [10,11,12,13,14,15] for more details of the linear sampling method. The factorization method [16] is used to characterize the Dirichlet scattering object from measurements of time-dependent causal scattered waves in the far field regime, and the method for obstacles with impedance boundary conditions in the time domain we refer to [17]. The Laguerre transform (LT) method is another useful tool for the acoustic scattering problem in the time domain. Compared with the Fourier–Laplace integral transform, the inverse transform of the LT method is to find the sum of corresponding Fourier–Laguerre series, which is proved to be more constructive. For more detail and applications of the LT method, we refer to [18,19,20].
In this paper, the inverse scattering problem we considered is the determination of the shape and location of an unknown homogeneous penetrable acoustic scatterer from the measurement of the scattered field in the time domain. Approaches based on retarded potentials are used since they reduce the time-dependent problem in the unbounded domain to an integral equation on the bounded surface. A particular class of methods for the discretization in time domain boundary integral equations (TDBIEs) for the wave equation are the so-called convolution quadratures (CQs); see Lunbich [21,22], in which Christian Lubich introduced this method by extending classical ideas of discrete operational calculus. This method is based on sustainable methods for ordinary differential equations and is more efficient than Galerkin or collocation time approximations. Refer to [23]; the author considered theoretically acoustic scattering problems with respect to various kinds of situations, such as scattering from sound soft, sound hard, non-penetrable, and penetrable with homogeneous or non-homogeneous media. For more details and applications of the CQ method, we refer to [24,25,26,27,28,29,30].
In this work, we propose the convolution quadrature method combined with the nonlinear integral equation method for the inverse problem. We note that this method is also used in [31] for the sound-soft obstacle. Specifically, the author uses the convolution quadrature method (CQ) for time discretization, and then a system of nonlinear integral equations-based iterative reconstruction method is developed to reconstruct both the location and shape of the obstacle. To our best knowledge, here the author first employs it in an inverse problem combined with a nonlinear integral equation method, which belongs to a simplified Newton method [32,33]. In this work, we also use the convolution quadrature method combined with the nonlinear integral equation method for the model of the homogeneous penetrable obstacle (see Equation (2) below). Given time-dependent scattering data, the Fourier transform of time-domain scattered field data is employed in the classic method, and then single frequency reconstruction methods are applied at several frequencies. Using the convolution quadrature method, we obtain a system of boundary integral equations for the Helmholtz equation with time-dependent complex wave numbers. Then, frequency-domain boundary integral operators are linearized with respect to the two-dimensional boundary’s parametrization to construct an iterative domain reconstruction method.
The outline of the paper is as follows. In Section 2, we formulate the direct and inverse scattering problem for the wave equation with a homogeneous penetrable obstacle. In Section 3, we obtain the boundary integral equations in the time domain and Laplace domain. In Section 4, we parameterize the curve and demonstrate that the regularized boundary integral equation has at least one solution in the frequency domain for the case of a ball-shaped obstacle. In Section 5, we introduce the convolution quadrature method for time discretization. In Section 6, an iterative scheme is presented, and the nonlinear boundary integral equation is linearized. Full discretization is given. In Section 7, numerical experiments are presented to demonstrate the effectiveness of the proposed methods. In Section 8, the conclusion of this paper with some future work. Detailed proof of eigenvalues of single-layer operator for unit circle is in Appendix A.

2. Problem Formulation

Let Ω be a bounded open set in R 2 , and Ω + = R 2 Ω ¯ denote the complement of the scatter Ω , with the common interface denoted by Γ . Let ν denote the unit outward normal to Ω . Given an incident wave field u i d in free space, the scattering produced by the obstacle can be computed as follows [23]:
2 u ( x , t ) u t t ( x , t ) = 0 , in Ω + × ( 0 , + ) · ( κ 0 v ( x , t ) ) κ 1 v t t ( x , t ) = 0 , in Ω × ( 0 , + ) v ( x , t ) u ( x , t ) = u i d ( x , t ) , on Γ × ( 0 , + ) κ 0 ν v ( x , t ) ν u ( x , t ) = ν u i d ( x , t ) , on Γ × ( 0 , + ) .
We assume the support of u i d at time t = 0 shall not intersect with the boundary of the obstacle Γ . This assumption guarantees vanishing initial conditions for the scattered field u ( x , t ) and the total field inside the obstacle v ( x , t ) with their derivatives, respectively:
u ( · , 0 ) = u ν ( · , 0 ) = 0 ; v ( · , 0 ) = v ν ( · , 0 ) = 0 .
The physical parameters κ 0 and κ 1 are defined, respectively, by 1 / ρ and 1 / c 2 ρ , where ρ is the density and c is the speed of propagation of sound. In this paper we only consider the situation where the obstacle is homogeneous and penetrable such that the parameters κ 0 and κ 1 are set to be constants. Thus, in the interior domain, the total field satisfies the equation:
2 v ( x , t ) c 2 v t t ( x , t ) = 0 in Ω × ( 0 , + ) .
Consequently, Equation (1) will be reduced to a system of equations as [23]
2 u ( x , t ) u t t ( x , t ) = 0 , in Ω + × ( 0 , + ) 2 v ( x , t ) c 2 v t t ( x , t ) = 0 , in Ω × ( 0 , + ) v ( x , t ) u ( x , t ) = u i d ( x , t ) , on Γ × ( 0 , + ) κ 0 ν v ( x , t ) ν u ( x , t ) = ν u i d ( x , t ) , on Γ × ( 0 , + )
for which the incident wave satisfies
u t t i d 2 u i d = f , in R 2 × ( 0 , ) u i d ( · , 0 ) = ν u i d ( · , 0 ) = 0 , in R 2
where the source term f ( · , t ) should not intersect with the obstacle.
The Inverse Problem. For a suitable constant R > 0 , we define B R = { x R 2 : | x | < R } such that Ω ¯ B R . Let the boundary B R be the observation curve. Using the incident wave emitted from a launch position x 0 and the scattered field received at observation curve u ( x , t ) , x B R , t [ 0 , T ] , our aim is to locate the obstacle and predict the shape of it.

3. From Time Domain to Laplace Domain

The retarded single-layer potential with density g ( x , t ) in two dimensions is defined as follows [31]:
( S g ) ( x , t ; c ) : = 0 t Γ k ( x y , t τ ; c ) g ( y , τ ) d s ( y ) d τ t ( 0 , ) , x R 2 Γ
where
k ( t , r ; c ) = H ( t c 1 r ) 2 π t 2 c 2 r 2
and H is the Heaviside function. The trace of a function u to the boundary Γ from the interior and exterior of Γ will be denoted γ u and γ + u , respectively. The normal derivatives from inside and outside are ν u and ν + u . Averages are denoted as follows [34]:
{ { γ u } } : = 1 2 ( γ u + γ + u ) ; { { ν u } } : = 1 2 ( ν u + ν + u ) .
On the boundary, we define the following two operators:
V g : = { { γ ( S g ) } } = γ ( S g ) = γ + ( S g ) K t g : = { { ν ( S g ) } } .
The definitions above imply the jump relation of potentials [34]:
ν ± ( S g ) = 1 2 g + K t g .
In this work, the scattered field u ( x , t ) and the interior total field v ( x , t ) in Equation (2) can be represented by a single layer potential as follows, with densities ϕ and λ , respectively.
u ( x , t ) = ( S 1 ϕ ) ( x , t ; 1 ) , t ( 0 , ) , x Ω + v ( x , t ) = ( S 2 λ ) ( x , t ; c ) , t ( 0 , ) , x Ω .
Thus we have
V 1 ϕ = { { γ ( S 1 ϕ ) } } V 2 λ = { { γ ( S 2 λ ) } } K 1 t ϕ = { { ν ( S 1 ϕ ) } } K 2 t λ = { { ν ( S 2 λ ) } } .
From the boundary conditions and jump relations [34], we obtain the time domain boundary integral equations:
V 2 V 1 κ 0 ( 1 2 I + K 2 t ) 1 2 I K 1 t λ ϕ = γ u i d υ u i d .
Now, we consider the corresponding Laplace-domain problem as follows:
2 u ^ ( s ) s 2 u ^ ( s ) = 0 , in Ω + 2 v ^ ( s ) ( s c ) 2 v ^ ( s ) = 0 , in Ω γ v ^ ( s ) γ + u ^ ( s ) = γ u ^ i d , on Γ κ 0 ν v ^ ( s ) ν + u ^ ( s ) = ν u ^ i d , on Γ
u ^ and v ^ are the Laplace transforms of u ( x , t ) and v ( x , t ) , respectively, while u ^ i d is the Laplace transform of the income wave u i d ( x , t ) . We first recall the fundamental solution for the operator 2 s 2 in two dimensions [34]:
E ( x , y ; s ) = i 4 H 0 ( 1 ) ( i s | x y | )
where H 0 ( 1 ) denotes the zero-order Hankel function of the first kind.
Consider the layer potential and integral operators associated with 2 s 2 for s C + . Given the density function ψ , for arbitrary x R 2 Γ , the single layer potential has the expression in the frequency domain [34]:
( S ψ ) ( x ) : = Γ E ( x , y ; s ) ψ ( y ) d s y , x R 2 Γ .
Consequently, on the boundary, we can define two boundary integral operators [34]:
( V ψ ) ( x ) : = Γ E ( x , y ; s ) ψ ( y ) d s y , x Γ
( K t ψ ) ( x ) : = Γ ν ( x ) E ( x , y ; s ) ψ ( y ) d s y , x Γ .
Using single layer potential for the problem (5), we assume that the exterior and interior solutions can be represented by
u ^ ( s ) = Γ E ( x , y ; s ) ϕ ^ ( y ) d s y , x Ω + v ^ ( s ) = Γ E ( x , y ; s c ) λ ^ ( y ) d s y , x Ω
with densities ϕ ^ and λ ^ , respectively. Thus, on the boundary, we can define
( V 1 ϕ ^ ) ( x ) : = Γ E ( x , y ; s ) ϕ ^ ( y ) d s y = i 4 Γ H 0 ( 1 ) ( i s | x y | ) ϕ ^ ( y ) d y , x Γ ( V 2 λ ^ ) ( x ) : = Γ E ( x , y ; s / c ) λ ^ ( y ) d s y = i 4 Γ H 0 ( 1 ) ( i s c | x y | ) λ ^ ( y ) d y , x Γ
and,
( K 1 t ϕ ^ ) ( x ) : = Γ ν ( x ) E ( x , y ; s ) ϕ ^ ( y ) d s y = s 4 Γ H 1 ( 1 ) ( i s | x y | ) ( x y ) · ν ( x ) | x y | ϕ ^ ( y ) d y , x Γ
( K 2 t λ ^ ) ( x ) : = Γ ν ( x ) E ( x , y ; s / c ) λ ^ ( y ) d s y = s / c 4 Γ H 1 ( 1 ) ( i s c | x y | ) ( x y ) · ν ( x ) | x y | λ ^ ( y ) d y , x Γ
where H 1 ( 1 ) is the Hankel function of the first kind of order one.
In the end, from the boundary conditions and jump relations [23], we obtain the Laplace domain boundary integral equations as follows:
V 2 V 1 κ 0 ( I 2 + K 2 t ) I 2 K 1 t λ ^ ϕ ^ = γ u ^ i d ν u ^ i d .

4. Parameterization of the Curve

For brevity, let σ = 1 o r 2 ; if correspondingly, κ σ = s o r s c . Now we can define new operators for some density φ :
( V σ φ ) ( x ) = i 4 Γ H 0 ( 1 ) ( i κ σ | x y | ) φ ( y ) d y , x Γ ( K σ t φ ) ( x ) = κ σ 4 Γ H 1 ( 1 ) ( i κ σ | x y | ) ( x y ) · ν ( x ) | x y | φ ( y ) d y , x Γ .
We assume that the boundary Γ is an analytic curve with the parametric form [35,36]
Γ = { z ( t ) | ( z 1 ( t ) , z 2 ( t ) ) : 0 t < 2 π }
where z : R R 2 is analytic and 2 π period with | z ( t ) | > 0 for all t. The normal derivative is represented by n ( t ) = ( z 2 ( t ) , z 1 ( t ) ) , while the outward unit normal derivative is denoted by ν ( t ) = n ( t ) | z ( t ) | . The parameterized integral operators are denoted by V σ and K σ , i.e.,
( V σ φ ) ( t ) = 0 2 π h σ ( t , τ ) φ ( τ ) d τ
( K σ t φ ) ( t ) = 0 2 π k σ ( t , τ ) φ ( τ ) d τ
where
h σ ( t , τ ) = i 4 H 0 ( 1 ) ( i κ σ | z ( t ) z ( τ ) | ) | z ( τ ) | k σ ( t , τ ) = κ σ 4 H 1 ( 1 ) ( i κ σ | z ( t ) z ( τ ) | ) ( z ( t ) z ( τ ) ) · ν ( t ) | z ( t ) z ( τ ) | | z ( τ ) | .
Firstly, we split the kernel k σ ( t , τ ) into [36]
k σ ( t , τ ) = k σ 1 ( t , τ ) ln ( 4 sin 2 t τ 2 ) + k σ 2 ( t , τ )
with
k σ 1 ( t , τ ) = i κ σ 4 π | z ( τ ) | ( z ( t ) z ( τ ) ) · ν ( t ) | z ( t ) z ( τ ) | J 1 ( i κ σ | z ( t ) z ( τ ) | ) .
Accordingly,
( K σ t φ ) ( t ) = ( K σ t , 1 φ ) ( t ) + ( K σ t , 2 φ ) ( t ) : = 0 2 π k σ 1 ( t , τ ) ln ( 4 sin 2 t τ 2 ) φ ( τ ) d τ + 0 2 π k σ 2 ( t , τ ) φ ( τ ) d τ .
Similarly, the kernel h σ ( t , τ ) can be written in the form [36]
h σ ( t , τ ) = h σ 1 ( t , τ ) ln ( 4 sin 2 t τ 2 ) + h σ 2 ( t , τ )
with analytic function
h σ 1 ( t , τ ) = 1 4 π | z ( τ ) | J 0 ( i κ σ | z ( t ) z ( τ ) | )
  • where J 0 is known as Bessel function of order zero.
  • Correspondingly,
( V σ φ ) ( t ) = ( V σ 1 φ ) ( t ) + ( V σ 2 φ ) ( t ) : = 0 2 π h σ 1 ( t , τ ) ln ( 4 sin 2 t τ 2 ) φ ( τ ) d τ + 0 2 π h σ 2 ( t , τ ) φ ( τ ) d τ .
Let H p [ 0 , 2 π ] , p 0 denote the space of 2 π periodic functions u : R C equipped with the norm [36]
u p 2 : = m ( 1 + m 2 ) p | u ^ m | 2 <
where
u ^ m = 1 2 π 0 2 π u ( t ) e i m t d t , m = 0 , ± 1 , ± 2 ,
are the Fourier coefficients of u.
Theorem 1. 
The operators K σ t and V σ are both compact operators from H p [ 0 , 2 π ] to H p [ 0 , 2 π ] .
Proof of Theorem 1. 
Using (Theorem 12.15 [36]) and referring to [35], we can deduce that operators K σ t , 1 and V σ 1 are bounded from H p [ 0 , 2 π ] to H p + 1 [ 0 , 2 π ] for all p 0 . Consequently, both operators are compact from H p [ 0 , 2 π ] to H p [ 0 , 2 π ] .
Since the kernel functions k σ 2 ( t , r ) and h σ 2 ( t , r ) are analytic, it follows from (Theorem 8.13 [36]) and (Theorem A.45 [37]) that the operator K σ t , 2 and V σ 2 from H p [ 0 , 2 π ] to H p + r [ 0 , 2 π ] are bounded for all integers r 0 and arbitrary p 0 . Thus, we can deduce that the operator K σ t is compact from H p [ 0 , 2 π ] to H p [ 0 , 2 π ] .
Since the operator V σ is bounded from H p [ 0 , 2 π ] to H p + 1 [ 0 , 2 π ] , the operator V σ is also compact from H p [ 0 , 2 π ] to H p [ 0 , 2 π ] . □
Let B = κ 0 ( I 2 + K 2 t ) ; assuming 1 2 is not the eigenvalue of operator K 2 t , then the operator B has a bounded inverse B 1 . We can then turn the equation:
V 2 V 1 κ 0 ( I 2 + K 2 t ) I 2 K 1 t λ ^ ϕ ^ = γ u ^ i d ν u ^ i d
into the form
[ V 1 + V 2 B 1 ( I 2 K 1 t ) ] λ ^ = V 2 B 1 ν u ^ i d γ u ^ i d
Let A : = [ V 1 + V 2 B 1 ( I 2 K 1 t ) ] , f : = V 2 B 1 ν u ^ i d γ u ^ i d . We can reformulate the above equation as
A λ ^ = f .
Since V σ is a compact operator, Equation (11) is an integral equation of the first kind. For simplicity here, we only prove the existence of the solution of the regularized equation for the unit circle.
Let z ( t ) = ( cos t , sin t ) , z ( τ ) = ( cos τ , sin τ ) and f m ( t ) : = e i m t , ( t R and m Z ) . We use the incident waves (40) to ensure that ν u ^ i d , γ u ^ i d both belong to H p [ 0 , 2 π ] for some p > 0 ; thus, we have the following theorem:
Theorem 2. 
For the trigonometric monomials f m ( t ) : = e i m t , m = 0 , ± 1 , ± 2 , , the eigenvalues λ ± m ( m = 0 , 1 , 2 , ) of operator V σ are tende to zero as | m | + . Let H M denote the linear subspace of H p [ 0 , 2 π ] generated by { e ± i m t , m = 0 , ± 1 , ± M } and P M denote the regularizer operator from H p [ 0 , 2 π ] to H M . Then, for Equation (11), there exists a solution λ ^ M satisfies the regularized equation: P M A λ ^ = P M f .
Remark 1. 
Detailed proof of these eigenvalues; refer to Appendix A.
Proof of Theorem 2. 
With the eigenfunctions f m ( t ) : = e i m t , the eigenvalues are as follows:
for m = 0 ,
λ 0 = p = 1 ( 1 ) p + 1 k σ 2 p 4 p ( p ! ) 2 j = 0 p 1 C 2 p j ( 1 ) j p j + 1 4 { 2 i π ln i k σ 2 + 2 i π C + 1 } p = 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! p ! + i 2 π p = 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! p ! Ψ ( p ) + { ln i k σ 2 E C + i π 2 } .
  • Here, we define Ψ ( 0 ) : = 0 , Ψ ( p ) : = m = 1 p 1 m , p = 1 , 2 , , E C denote Euler’s constant.
  • For m = ± 1 , ± 2 , ,
λ ( ± m ) = 1 2 m + ( 1 ) p + 1 2 p = m + 1 k σ 2 p 4 p ( p ! ) 2 [ j = 0 p m 1 C 2 p j ( 1 ) j 2 p ( 1 ) j p m j + j = 0 p + m 1 C 2 p j ( 1 ) j p + m j ] + { i 2 π ln i k σ 2 i 2 π E C 1 4 } p = m ( 1 ) m + 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! ( p + m ) ! + i 2 π p = m ( 1 ) m + 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! ( p + m ) ! Ψ ( p )
For λ 0 , we first consider the series
p = 1 ( 1 ) p + 1 k σ 2 p 4 p ( p ! ) 2 j = 0 p 1 C 2 p j ( 1 ) j p j
It is easy to show that
| p = 1 ( 1 ) p + 1 k σ 2 p 4 p ( p ! ) 2 j = 0 p 1 C 2 p j ( 1 ) j p j | p = 1 p | k σ | 2 p 4 p ( p ! ) 2 C 2 p p
where the series p = 1 p | k σ | 2 p 4 p ( p ! ) 2 C 2 p p is absolutely convergent. Similarly, for the second and the third part of λ 0 , the series
p = 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! p ! ; p = 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! p ! Ψ ( p )
  • are both absolutely convergent.
  • For λ ± m , m = ± 1 , ± 2 , , we consider the second part of λ ± m :
p = m + 1 U p : = ( 1 ) p + 1 2 p = m + 1 k σ 2 p 4 p ( p ! ) 2 [ j = 0 p m 1 C 2 p j ( 1 ) j 2 p ( 1 ) j p m j + j = 0 p + m 1 C 2 p j ( 1 ) j p + m j ] .
If we assume that U p = 0 , 1 p m , it is easy to compute that the series p = 1 U p is absolutely convergent:
p = 1 | U p | 1 2 p = m + 1 | k σ | 2 p 4 p ( p ! ) 2 [ ( p m ) C 2 p p + ( p + m ) C 2 p p ] p = m + 1 | k σ | 2 p 4 p ( p ! ) 2 ( p + m ) C 2 p p
Similarly, for the second and third parts of λ ± m , it is easy to show that the series
p = m V p : = { i 2 π ln i k σ 2 i 2 π E C 1 4 } p = m ( 1 ) m + 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! ( p + m ) !
and
p = m W p : = i 2 π p = m ( 1 ) m + 1 k σ 2 p 4 p ( p ! ) 2 ( 2 p ) ! ( p + m ) ! Ψ ( p )
satisfy the inequality (assuming V p = 0 , p = 1 , m 1 ; W p = 0 , p = 1 , m 1 ):
p = 1 | V p | C p = 1 | k σ | 2 p 4 p ( p ! ) 2 ( 2 p ) ! ( p + m ) !
p = 1 | W p | 1 2 π p = 1 | k σ | 2 p 4 p ( p ! ) 2 ( 2 p ) ! ( p + m ) ! Ψ ( p )
for some constant C R . It is clear that the series p = 1 V p and p = 1 W p are both absolutely convergent. Accordingly, λ ± m tends to zero, as m . □

5. Time Discretization

We use the convolution quadrature method [29,31] to handle the time discretization of the boundary integral Equation (4). Briefly, the right-hand side of expression (3) can be written as
A ( t ) g : = 0 t w ( t τ ; c ) g ( τ ) d τ : = ( w g ) ( t ) ,
where w is a parameter-dependent integral operator:
( w ( t τ ; c ) g ( τ ) ) ( x ) : = Γ k ( t τ , x y ; c ) g ( y , τ ) d s ( y ) , x Γ .
The Laplace transform of w is defined by
W ( s ; c ) = 0 w ( t ) e s t d t .
Its specific expression has the form
( W ( s ; c ) g ) ( x ) = Γ K ( | x y | , s c ) g ( y ) d s y , x Γ ,
where K ( | x y | , s / c ) = i 4 H 0 ( 1 ) ( i s c | x y | ) .
In order to discretize the time convolution, we split the time interval [ 0 , T ] into N + 1 time steps of equal length Δ t = T / N with t n = n Δ t , n = 0 , 1 , , N . Then, using the convolution quadrature method [29,31], we replace the continuous convolution operator A ( t ) at the discrete times t n by the discrete convolution operator, for n = 0 , 1 , , N ,
( A ( t Δ t ) g Δ t ) ( x , t n ) : = ( w g ) ( t n ) = j = 0 n w n j Δ t ( W ) g Δ t ( t j ) .
The convolution weights w n Δ t ( W ) are defined below:
W ( Υ ( ζ ) Δ t ) = n = 0 w n Δ t ζ n , | ζ | < 1
where Υ ( ζ ) = 1 2 ( ζ 2 4 ζ + 3 ) is the quotient of the generating polynomials of the BDF2 scheme. As recommended in [31], the convolution weights w n Δ t ( W ) have their representation as a contour integral
w j Δ t ( W ) = 1 2 π i C W ( Υ ( ζ ) / Δ t ) ζ j + 1 d ζ ,
where C can be chosen as a circle centered at the origin of radius ς < 1 . Using the trapezoidal rule, the approximate convolution weights are given by
w j Δ t , ς ( W ) : = ς j N + 1 l = 0 N W ( s l ; c ) ζ N + 1 l j ,
where ζ N + 1 = e 2 π i N + 1 , s l = Υ ( ς ζ N + 1 l ) Δ t . Substituting the definition of w j Δ t , ς in (15), we obtain the expression as follows:
( A ( t Δ t ) g Δ t , ς ) ( x , t n ) : = ς n N + 1 l = 0 N ( W ( s l ; c ) g ^ l ) ( x ) ζ N + 1 n l , n = 0 , 1 , , N
where
g ^ l : = j = 0 N ς j g j ζ N + 1 l j .
Using the above results, for the time domain boundary integral to Equation (4), we can define new discrete convolution quadrature operators as follows:
( A ( V 2 Δ t ) λ Δ t , ς ) ( x , t n ) : = ς n N + 1 l = 0 N ( V 2 ( s l ; c ) λ ^ l ) ( x ) ζ N + 1 n l ; ( A ( V 1 Δ t ) ϕ Δ t , ς ) ( x , t n ) : = ς n N + 1 l = 0 N ( V 1 ( s l ; 1 ) ϕ ^ l ) ( x ) ζ N + 1 n l ; ( A ( K 2 Δ t ) λ Δ t , ς ) ( x , t n ) : = ς n N + 1 l = 0 N ( ν ( x ) K 2 t ( s l ; c ) λ ^ l ) ( x ) ζ N + 1 n l ; ( A ( K 1 Δ t ) ϕ Δ t , ς ) ( x , t n ) : = ς n N + 1 l = 0 N ( ν ( x ) K 1 t ( s l ; 1 ) ϕ ^ l ) ( x ) ζ N + 1 n l .
The time-discrete problem is given as follows: find ϕ j = ϕ Δ t , ς ( · , t j ) , λ j = λ Δ t , ς ( · , t j ) such that
( A ( V 2 Δ t ) λ Δ t , ς ) ( x ) ( A ( V 1 Δ t ) ϕ Δ t , ς ) ( x ) = u n i d ( x ) 1 2 ( κ 0 λ n ( x ) + ϕ n ( x ) ) + κ 0 ( A ( K 2 Δ t ) λ Δ t , ς ) ( x ) ( A ( K 1 Δ t ) ϕ Δ t , ς ) ( x ) = ν u n i d ( x )
n = 1 , 2 , , N , x Γ ,
where u n i d ( x ) and ν u n i d ( x ) are some approximations to u i d ( x , t n ) and ν ( x ) u i d ( x , t n ) , respectively. For the above Equation (22), applying the discrete Fourier transform to both sides, we finally get the following decoupled boundary integral equations
( V 2 ( s l ; c ) λ l ^ ) ( x ) ( V 1 ( s l ; 1 ) ϕ l ^ ) ( x ) = u ^ l i d ( x ) 1 2 ( κ 0 λ ^ l ( x ) + ϕ ^ l ( x ) ) + κ 0 ( ν ( x ) K 2 t ( s l ; c ) λ ^ l ) ( x ) ( ν ( x ) K 1 t ( s l ; 1 ) ϕ ^ l ) ( x ) = ν u ^ l i d ( x )
l = 0 , 1 , , , N , x Γ
where u ^ l i d and ν u ^ l i d are the scaled discrete Fourier transform
u ^ l i d : = n = 0 N ς n u n i d ζ N + 1 l n ; ν u ^ l i d : = n = 0 N ς n ν u n i d ζ N + 1 l n .
Similarly, λ ^ l and ϕ ^ l are the scaled discrete Fourier transform
λ ^ l : = n = 0 N ς n λ n ζ N + 1 l n ; ϕ ^ l : = n = 0 N ς n ϕ n ζ N + 1 l n .
Ultimately, we obtain the densities λ j and ϕ j by applying the inverse transform
λ j : = ς j N + 1 l = 0 N λ ^ l ζ N + 1 j l ; ϕ j : = ς j N + 1 l = 0 N ϕ ^ l ζ N + 1 j l
Because the scaled discrete Fourier transform of u n ( · ) = u ( · , t n ) has the expression
u ^ l ( x ) = Γ K ( | x y | , s l ) ϕ ^ l ( y ) d s y : = ( W L Γ ( s l ; c ) ϕ ^ l ) ( x )
for l = 0 , , N , x R 2 Ω ¯ , the scattering wave u n is given by
u n : = ς n N + 1 l = 0 N u ^ n ζ N + 1 n l

6. The Inverse Scheme

6.1. Nonlinear Integral Equations

For brevity, we use the symbols as follows:
A l ( p D , λ ^ l ) ( θ ) : = i 4 0 2 π H 0 ( 1 ) ( i s l c | p D ( θ ) p D ( η ) | ) G r ( η ) λ ^ l ( η ) d η A l ( p D , ϕ ^ l ) ( θ ) : = i 4 0 2 π H 0 ( 1 ) ( i s l | p D ( θ ) p D ( η ) | ) G r ( η ) ϕ ^ l ( η ) d η
and
B l ( p D , λ ^ l ) ( θ ) : = i 4 0 2 π ν ( θ ) H 0 ( 1 ) ( i s l c | p D ( θ ) p D ( η ) | ) G r ( η ) λ ^ l ( η ) d η B l ( p D , ϕ ^ l ) ( θ ) : = i 4 0 2 π ν ( θ ) H 0 ( 1 ) ( i s l | p D ( θ ) p D ( η ) | ) G r ( η ) ϕ ^ l ( η ) d η
where λ ^ l ( η ) = λ ^ l ( p ( η ) ) , ϕ ^ l ( η ) = ϕ ^ l ( p ( η ) ) and G r ( η ) = ( r 2 ( η ) + ( d r d η ( η ) ) 2 ) 1 / 2 . Then, we can get the parameterized expressions of Equation (23) as
A l ( p D , λ ^ l ) ( θ ) A l ( p D , ϕ ^ l ) ( θ ) = ω ^ l ( θ ) 1 2 ( κ 0 λ ^ l ( θ ) + ϕ ^ l ( θ ) ) + κ 0 B l ( p D , λ ^ l ) ( θ ) B l ( p D , ϕ ^ l ) ( θ ) = ω ^ l ( θ )
  • where ω ^ l ( θ ) = u ^ l i d ( p Γ ( θ ) ) , ω ^ l ( θ ) = ν ( θ ) u ^ l i d ( p Γ ( θ ) ) .
  • For simplicity, we use symbols to represent the retarded single layer potential (3)
( S L Γ g ) ( x , t ; c ) : = ( S g ) ( x , t ; c ) .
Let x B R , assuming the observation curve is denoted by B R ; then, we obtain the data equations
( S L Γ ϕ ) ( x , t n ) = u ( x , t n ) , n = 0 , , N , x B R .
Using the convolution quadrature method, a system of s-domain data equations are obtained (using the notation similiar as (27))
( W L Γ ( s l ; 1 ) ϕ ^ l ) ( x ) = u ^ l ( x ) , l = 0 , , N , x B R .
Consequently, the parameterized operator W L Γ ( s l ) is
A L l ( p D , p B , ϕ ^ l ) ( ξ ) = i 4 0 2 π H 0 ( 1 ) ( i s l | p B ( ξ ) p D ( η ) | ) G r ( η ) ϕ ^ l ( η ) d η .
And, we obtain the nolinear integral equation as
A L l ( p D , p B , ϕ ^ l ) ( ξ ) = ω ^ l B R ( ξ ) , l = 0 , , N ,
where ω ^ l B R ( ξ ) = u ^ l i d ( p B ( ξ ) ) . The linearization of Equation (34) with respect to p D requires the Frechet derivative of the operator A L l , that is [31]
( A L l ( p D , p B , ϕ ^ l ) q ) ( ξ )
= s l 4 0 2 π H 1 ( 1 ) ( i s l | p B ( ξ ) p D ( η ) | ) ( p B ( ξ ) p D ( η ) ) · q ( η ) | p B ( ξ ) p D ( η ) | ϕ ^ l ( η ) d η = s l 4 0 2 π H 1 ( 1 ) ( i s l | p B ( ξ ) p D ( η ) | ) | p B ( ξ ) p D ( η ) |
[ ( b 1 + R cos ξ c 1 r ( η ) cos η ) ( Δ c 1 + Δ r ( η ) cos η ) + ( b 2 + R sin ξ c 2 r ( η ) sin η ) ( Δ c 2 + Δ r ( η ) sin η ) ] ϕ ^ l ( η ) d η
where
q ( η ) = ( Δ c 1 , Δ c 2 ) + Δ r ( η ) ( cos η , sin η ) .
Then, the linearization of (34) leads to
A L l ( p D , p B , ϕ ^ l ) q = f l ,
where
f l = ω ^ l B R A L l ( p D , p B , ϕ ^ l ) .
Analogously to [38], we use the same relative error estimator for a stopping criterion:
E l l : = ω ^ l B R A L l ( p D l l , p B , ϕ ^ l ) L 2 ω ^ l B R L 2 ϵ ,
where ϵ is a user-specified small positive constant on the noise level, and P D l l is the l l th approximation of the boundary Γ . Iterative procedure for this scattering problem is similar to [31,38].

6.2. Fully Discretization

Next, we describe the full discretization of (29) and (36). Let η j n ˜ : = π j / n ˜ , j = 0 , , 2 n ˜ 1 , ξ i n ¯ : = π i / n ¯ , i = 0 , , 2 n ¯ 1 be equidistant sets of quadrature knots. Seting ω ^ l , i n ˜ = ω ^ l ( η i n ˜ ) , ω ^ l , i n ˜ = ω ^ l ( η i n ˜ ) and λ ^ l , j ( n ˜ ) = λ ^ l ( η j ( n ˜ ) ) , ϕ ^ l , j ( n ˜ ) = ϕ ^ l ( η j ( n ˜ ) ) for i , j = 0 , , 2 n ˜ 1 and l = 0 , , N . Using the Nystrom method [36], we can get the full discretization of (29)
j = 0 2 n ˜ 1 ( R | i j | n ˜ K 1 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; c ) + π n ˜ K 2 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; c ) ) λ ^ l , j n ˜ j = 0 2 n ˜ 1 ( R | i j | n ˜ K 1 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; 1 ) + π n ˜ K 2 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; 1 ) ) ϕ ^ l , j n ˜ = ω ^ l , i n ˜
j = 0 2 n ˜ 1 ( R | i j | n ˜ L 1 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; c ) + π n ˜ L 2 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; c ) ) λ ^ l , j n ˜ j = 0 2 n ˜ 1 ( R | i j | n ˜ L 1 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; 1 ) + π n ˜ L 2 ( l ) ( η i ( n ˜ ) , η j ( n ˜ ) ; 1 ) ) ϕ ^ l , j n ˜ + 1 2 ( κ 0 λ ^ l , j ( n ˜ ) + ϕ ^ l , j ( n ˜ ) ) = ω ^ l , i n ˜
for i , j = 0 , , 2 n ˜ 1 , l = 0 , , N , where
R j ( n ˜ ) = 2 π n ˜ m = 1 n ˜ 1 1 m cos m j π n ˜ ( 1 ) j π n ˜ 2 ,
K 1 ( l ) ( θ , η ; c ) = 1 4 π J 0 ( i s l c | p D ( θ ) p D ( η ) | ) ,
K 2 ( l ) ( θ , η ; c ) = i 4 H 0 ( 1 ) ( i s l c | p D ( θ ) p D ( η ) | ) K 1 ( l ) ( θ , η ; c ) ln ( 4 sin 2 θ η 2 ) .
Meanwhile, we can decuce the diagonal term as
K 2 ( l ) ( η , η ) { i 4 E C 2 π 1 2 π ln ( i s l G r ( η ) 2 ) } ,
with the Euler constant E C = 0.57721 . Similarly,
L 1 ( l ) ( θ , η ; c ) = i s l 4 π c x 2 ( θ ) ( x 1 ( θ ) x 1 ( η ) ) x 1 ( θ ) ( x 2 ( θ ) x 2 ( η ) ) | x ( θ ) | J 1 ( i s l c | x ( θ ) x ( η ) | ) | x ( θ ) x ( η ) |
L 2 ( l ) ( θ , η ; c ) = i 4 ν ( θ ) H 0 ( 1 ) ( i s l c | x ( θ ) x ( η ) | ) L 1 ( l ) ( θ , η ; c ) ln 4 sin 2 θ η 2 ,
and the diagonal term is
L 2 ( l ) ( η , η ; c ) = 1 4 π 1 | x ( η ) | 3 { x 2 ( η ) x 1 ( η ) x 1 ( η ) x 2 ( η ) } .
Next, we discretize the linearized Equation (36) to obtain the update by using least squares with Tikhonov regularization [37,38]. We choose the space of trigonometric polynomials of the form [31] to approximate the radial function r and its update Δ r
Δ r ( η ) = m = 0 M α m cos m η + m = 1 M β m sin m η ,
where the integer M > 1 is the truncation number. We can reformulate Equation (36) as follows; for details of the fully discretization, we refer to [31].
T 1 ( l ) ( ξ , η ) = s l 4 H 1 ( 1 ) ( i s l | p B ( ξ ) p D ( η ) | ) | p B ( ξ ) p D ( η ) | ( b 1 + R cos ξ c 1 r ( η ) cos η ) ϕ ^ l ( η ) ,
T 2 ( l ) ( ξ , η ) = s l 4 H 1 ( 1 ) ( i s l | p B ( ξ ) p D ( η ) | ) | p B ( ξ ) p D ( η ) | ( b 2 + R sin ξ c 2 r ( η ) sin η ) ϕ ^ l ( η ) ,
T 3 , m ( l ) ( ξ , η ) = s l 4 H 1 ( 1 ) ( i s l | p B ( ξ ) p D ( η ) | ) | p B ( ξ ) p D ( η ) | [ ( b 1 c 1 ) cos η + ( b 2 c 2 ) sin η + R cos ( ξ η ) r ( η ) ] cos m η ϕ ^ l ( η ) ,
T 4 , m ( l ) ( ξ , η ) = s l 4 H 1 ( 1 ) ( i s l | p B ( ξ ) p D ( η ) | ) | p B ( ξ ) p D ( η ) | [ ( b 1 c 1 ) cos η + ( b 2 c 2 ) sin η + R cos ( ξ η ) r ( η ) ] sin m η ϕ ^ l ( η ) ,
Utilizing the trapezoidal rule, we obtain the discretized linear system from (33)–(36)
G 1 ( l ) , c ( ξ i ( n ¯ ) ) Δ c 1 + G 2 ( l ) , c ( ξ i ( n ¯ ) ) Δ c 2 + m = 0 M α m G 3 , m ( l ) , r ( ξ i ( n ¯ ) ) + m = 1 M β m G 4 , m ( l ) , r ( ξ i ( n ¯ ) ) = f l ( ξ i ( n ¯ ) )
to determine the real coefficients Δ c 1 , Δ c 2 , α m , and β m , where
G k k ( l ) , c ( ξ i ( n ¯ ) ) = π n ˜ j = 0 2 n ˜ 1 T k k ( l ) ( ξ i ( n ˜ ) , η j ) , k k = 1 , 2 ,
and
G k k , m ( l ) , r ( ξ i ( n ¯ ) ) = π n ˜ j = 0 2 n ˜ 1 T k k , m ( l ) ( ξ i ( n ¯ ) , η j ) , k k = 3 , 4 .
Since 2 M + 1 2 n ¯ , due to the ill-posedness, the Tikhonov regularization can be used to tackle the overdetermined system (37). Thus, the linear system (37) is turned into the following function [31,38]:
i = 0 2 n ¯ 1 | G 1 ( l ) , c ( ξ i ( n ¯ ) ) Δ c 1 + G 2 ( l ) , c ( ξ i ( n ¯ ) ) Δ c 2 + m = 0 M α m G 3 , m ( l ) , r ( ξ i ( n ¯ ) ) + m = 1 M β m G 4 , m ( l ) , r ( ξ i ( n ¯ ) ) f l ( ξ i n ¯ ) | 2 + λ ˜ ( | Δ c 1 | 2 + | Δ c 2 | 2 + 2 π [ α 0 2 + 1 2 m = 1 M ( 1 + m 2 ) ( α m 2 + β m 2 ) ] )
with a positive regularization parameter λ ˜ and H 1 penalty term. It is clear that the minimizer of above equation is the solution of the system
( λ ˜ I ˜ + R ( G ˜ l G ˜ l ) ) ξ ˜ = R ( G ˜ l f ˜ l )
where
G ˜ l = ( G 1 ( l ) , c , G 2 ( l ) , c , G 3 , 0 ( l ) , r , , G 3 , M ( l ) , r , G 4 , 1 ( l ) , r , , G 4 , M ( l ) , r ) 2 n ¯ × ( 2 M + 3 )
ξ ˜ = ( Δ c 1 , Δ c 2 , α 0 , , α M , β 1 , , β M ) T ,
I ˜ = d i a g { 1 , 1 , 2 π , π ( 1 + 1 2 ) , , π ( 1 + M 2 ) , , π ( 1 + M 2 ) }
f ˜ l = ( f l ( ξ 0 ( n ¯ ) ) , , f l ( ξ 2 n ¯ 1 ( n ¯ ) ) ) T .
Consequently, the new approximation is obtained
p D n e w = ( c + Δ c ) + ( r ( x ) + Δ r ( x ) ) x

7. Numerical Experiments

For the numerical experiments, we considered the following income wave, defined by
u i d ( x , t ) = sin [ 4 ( t | x x 0 | ) 4 ] e x p ( 1.6 ( t | x x 0 | 3 ) 2 ) 2 π t 2 | x x 0 | 2 , t > | x x 0 | 0 , t | x x 0 | ,
which is emitted from a single launch position x 0 such that the incident wave clearly satisfies the two-dimensional time-domain wave equation. The scattered field data are numerically computed at 60 points, i .e., n ¯ = 30 . And 100 quadrature nodes are chosen for the direct problem and 64 quadrature nodes for the inverse problem. We construct the noisy data v σ ( y , t ) in the following way [38]: v σ = v ( 1 + δ Θ ) , where Θ are random numbers ranging in [ 1 , 1 ] , δ > 0 is the relative noise level. By using the Tikhonov regularization and H 1 penalty term, we will get the update ξ from a scaled Newton step, i.e.,
ξ ˜ = ρ ( λ ˜ I ˜ + R ( G ˜ l G ˜ l ) ) 1 R ( G ˜ l f ˜ l ) ,
where the scaling factor ρ 0 is a fixed number throughout the iteration. Analogously to [31], the regularization parameters λ ˜ in (39) are chosen as
λ ˜ l l = ω ^ l , δ B R A L l ( p l l , p B , ϕ ^ l ) L 2 , l = [ l l / l o o p ] , l l = 0 , 1 ,
Analogously to [31,38], we choose the update ξ = 0 when the norm of the right hand ω ^ l ( θ ) is less than the tolerance: ε ˜ = 10 6 .
Numerical Examples. Inverse acoustic scattering problem for a homogeneous penetrable obstacle with a single launch position. We investigate the inverse scattering problem of reconstructing a homogeneous penetrable obstacle from the scattered-field data in the time domain, including the shape and the position. The reconstructions with different noise levels for the acorn-shaped, bean-shaped, peanut-shaped, and kite-shaped obstacles are shown in Figure 1, Figure 2, Figure 3, and Figure 4, respectively. The numerical results show that the reconstruction of a homogeneous penetrable obstacle deals with the angle of the incident wave, the position and radius of the initial guess, the shape of the obstacle, and the size of the noise level. These results show that the reconstruction is not sensitive to the initial guess or the launch position of the incident wave, although there will be a large error in reconstructing the shape of the obstacle at some cusp positions, and the error is within our control. Note that all the programs are written using Matlab.
In all the following figures, the exact boundary curves are expressed by solid lines while the reconstructed boundary curves are displayed by dashed lines , and all the initial guesses are taken to be a circle with radius r 0 , which is indicated by the dash-dotted lines · . The position of incident waves is marked by an asterisk *. We choose T = 15 , the radius of the observation curve R = 2 , the center of the observation curve ( 0 , 0 ) , the scaling factor ρ = 0.9 , the cycle index for per l , l o o p = 6 , and the truncation M = 4 .

8. Conclusions

In this paper, we have studied the two-dimensional inverse acoustic scattering from a homogeneous penetrable obstacle. The challenge of the time domain inverse problem is due to the time dependence. The fact that we obtain a convolution equation suggests the possibility of using CQ methods for the time variable. Although we obtain expressions for the time-domain potentials, we will write all the equations in the frequency domain. However, it has to be understood that this method works in the time domain, and the solutions are computed in a time-stepping fashion. The fact that we use the operators in the frequency domain (which is a requisite of CQ) does not mean that we are going to solve at that domain and then invert the Laplace transform.
That scattered waves outside the obstacle and the total wave inside the obstacle are both represented by a single-layer potential, resulting in the boundary integral equation reformulating to an integral equation of the first kind. Thus, we only prove the existence of the solution of the boundary integral equation under regularization. But this is not conducive to accurate numerical analysis. This is one of the problems that we will solve in our follow-up work. A nonlinear integral equation method is developed for the inverse problem, and numerical examples are presented to demonstrate the effectiveness and stability of the method. In summary, the angle of the incident wave, the position and radius of the initial guess, the shape of the obstacle, and the size of the noise level all affect the reconstruction results. All the numerical experiment results show the method presented in this paper is very effective for retrieving the position of the obstacle, and there will be a large error in reconstructing the shape of the obstacle at some cusp positions, which is also related to the angle of the incident wave. For example, the results of reconstruction for kite-shaped obstacles do not perform as well as for bean-shaped obstacles. From the results of numerical experiments, we can also see that for a bean-shaped obstacle, even if we enhance the noise level to 20 % , the method still works, while for a kite-shaped obstacle, the results are barely acceptable for a 1 % noise level. Similar results can be found in the literature [31], which uses the same method to reconstruct the position and shape of sound soft obstacles. In general, these results show that the reconstruction is not sensitive to the initial guess or the launch position of the incident wave. Future work includes the application to other inverse acoustic scattering problems for non-homogeneous penetrable obstacles and error analysis.

Author Contributions

Writing—original draft, Z.Q.; Writing—review & editing, F.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

Appendix A

The main content of the appendix is how to calculate the eigenvalue of the single-layer operator in the case of the unit circle. Retrospective the Formula (8), its specific expression is:
( V σ φ ) ( t ) = 1 4 π 0 2 π ln ( 4 sin 2 t τ 2 ) J 0 ( i k σ | z ( t ) z ( τ ) | ) φ ( τ ) d τ + 0 2 π i 4 { 2 i π ln i k σ | z ( ξ ) | 2 + 2 i π C + 1 } J 0 ( i k σ | z ( t ) z ( τ ) | ) φ ( τ ) d τ + 0 2 π 1 2 π p = 1 ( 1 ) p ( p ! ) 2 Ψ ( p ) · ( i k σ | z ( t ) z ( τ ) | 2 ) 2 p φ ( τ ) d τ .
The main procedure is to divide the above operator into three parts to calculate. After a simple substitution, our aim is to calculate Equations (A3) and (A12). We solve (A3) by calculating (A4) and (A5). Solve (A13) to get the result of (A12). The main calculation skills see Problem A1 and Problem A2.
We consider the first part of Equation (A1):
1 4 π 0 2 π ln ( 4 sin 2 t τ 2 ) · J 0 ( i k σ | z ( t ) z ( τ ) | ) φ ( τ ) d τ = 1 4 π 0 2 π ln ( 4 sin 2 t τ 2 ) p = 0 ( 1 ) p ( p ! ) 2 ( i k σ 2 | sin t τ 2 | 2 ) 2 p φ ( τ ) d τ = 1 4 π p = 0 k σ 2 p ( p ! ) 2 0 2 π ( sin t τ 2 ) 2 p ln ( 4 sin 2 t τ 2 ) φ ( τ ) d τ
We substitute φ for f m ( t ) = e i m t ( m Z ) ; then, we have
1 4 π p = 0 k σ 2 p ( p ! ) 2 0 2 π ( sin t τ 2 ) 2 p ln ( 4 sin 2 t τ 2 ) e i m τ d τ = e i m t · 1 4 π p = 0 k σ 2 p ( p ! ) 2 0 2 π ( sin θ 2 ) 2 p ln ( 4 sin 2 θ 2 ) e i m θ d θ .
First we focus on the integral
0 2 π ( sin θ 2 ) 2 p ln ( 4 sin 2 θ 2 ) e i m θ d θ
= 2 0 π ( sin t 2 ) 2 p ln ( 2 sin t 2 ) ( e i m t + e i m t ) d t m Z
We use the integral followed to tackle Equation (A3):
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z , m Z +
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z , m Z +
Refer to Problem A1, we have
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z
= 0 , p > 0 , m p 2 π i ( 4 ) p j = 0 p m 1 C 2 p j ( 1 ) j + 1 p m j , p > 0 , 0 m < p 0 , p = 0 , m = 0 , 1 , 2 , 3 · ,
Similarly,
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z
= 0 , p > 0 , m p 2 π i ( 4 ) p j = 0 p + m 1 C 2 p j ( 1 ) j + 1 p + m j , p > 0 , 0 m < p 2 π i m , p = 0 , m = 1 , 2 , 3
Refer to Problem A1, we have
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) [ z m p 1 + z m p 1 ] d z = 2 i 0 π ( sin θ 2 ) 2 p ln ( 2 sin θ 2 ) ( e i m θ + e i m θ ) d θ
From (A2)–(A8), we conclude that
0 π ( sin θ 2 ) 2 p ln ( 2 sin θ 2 ) [ e i m θ + e i m θ ] d θ : = λ ( 1 ) ( p , m ) 2 = 0 , p > 0 , m p π ( 4 ) p j = 0 p m 1 C 2 p j ( 1 ) j p m j + π ( 4 ) p j = 0 m + p 1 C 2 p j ( 1 ) j m + p j , p > 0 , 0 m < p π m , p = 0 , m = 1 , 2 , 3 , 0 , p = 0 , m = 0
For the second part of Equation (A1), we substitute φ for e i m t ( m Z ) , then the Equation (A1) turns into
i 4 { 2 i π ln i k σ 2 + 2 i π C + 1 } p = 0 k σ 2 p ( p ! ) 2 0 2 π ( sin t τ 2 ) 2 p e i m τ d τ .
We first consider the expression
0 2 π ( sin t τ 2 ) 2 p e i m τ d τ = e i m t · 0 2 π ( sin θ 2 ) 2 p e i m θ d θ , m Z .
By simple calculation, we obtain
0 2 π ( sin θ 2 ) 2 p e i m θ d θ = 0 π ( sin t 2 ) 2 p e i m t d t + 0 π ( sin t 2 ) 2 p e i m t d t , m Z ,
and we utilize the contour integral
C 1 ( 4 ) p ( 1 z ) 2 p z m p 1 d z .
to handle the right side of the expression (A12), where C denote the unit circle and z = 0 is a possible singularity. Let z = e ± i θ , 0 θ < π ,
C 1 ( 4 ) p ( 1 z ) 2 p z m p 1 d z = i 0 π ( sin θ 2 ) 2 p e i m θ d θ + i 0 π ( sin θ 2 ) 2 p e i m θ d θ
Using the Residue theorem, we have
0 π ( sin θ 2 ) 2 p e i m θ d θ + 0 π ( sin θ 2 ) 2 p e i m θ d θ : = λ ( 2 ) ( p , m ) = 0 , p > 0 , m 1 + p i ( 1 ) m + 1 4 p ( 2 p ) ! ( p + m ) ! , p > 0 , 0 m < p + 1 2 π , p = 0 , m = 0 0 , p = 0 , m = 1 , 2 , 3 , .
for detailed proof we refer to Problem A2. Then, we can write that
i 4 { 2 i π ln i k σ 2 + 2 i π C + 1 } p = 0 k σ 2 p ( p ! ) 2 0 2 π ( sin t τ 2 ) 2 p e i m τ d τ = i 4 { 2 i π ln i k σ 2 + 2 i π C + 1 } p = 0 k σ 2 p ( p ! ) 2 λ ( 2 ) ( p , m ) · e i m t , m Z
For the second part of (A1), we consider the expression
1 2 π p = 0 k σ 2 p ( p ! ) 2 Ψ ( p ) 0 2 π ( sin t τ 2 ) 2 p e i m τ d τ , m Z
It is easy to show that
0 2 π ( sin t τ 2 ) 2 p e i m τ d τ = e i m t · 0 2 π ( sin θ 2 ) 2 p e i m θ d θ , m Z .
And for simple computation, we have
0 2 π ( sin θ 2 ) 2 p e i m θ d θ = 0 π ( sin t 2 ) 2 p e i m t d t + 0 π ( sin t 2 ) 2 p e i m t d t , m Z
From (A15), we will have
1 2 π p = 1 k σ 2 p ( p ! ) 2 Ψ ( p ) 0 2 π ( sin t τ 2 ) 2 p e i m τ d τ = 1 2 π p = 1 k σ 2 p ( p ! ) 2 Ψ ( p ) · λ ( 2 ) ( p , m ) · e i m t , m Z .
Problem A1. 
Compute the integral: 0 π ( sin θ 2 ) 2 p ln ( 2 sin θ 2 ) ( e i m θ + e i m θ ) d θ , m Z + .
Proof. 
We utilize contour integral
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z , m Z +
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z , m Z +
  • to resolve the problem. C denote the integral curve, which is unite circle and from [39,40], we have lim σ 0 c σ = 0 with C σ denote a half circle and its radius is σ .
  • Mathematics 13 00771 i001
  • Let a r g ( 1 z ) = π , for z = e ± i θ , 0 < θ < π , we have
ln ( 1 z ) | z = e ± i θ = ln ( 2 sin θ 2 ) i π θ 2
and
( 1 z ) 2 p = ( e i θ 2 2 i sin θ 2 ) 2 p = ( 4 ) p e i p θ ( sin θ 2 ) 2 p , z = e i θ ( 1 z ) 2 p = ( e i θ 2 2 i sin θ 2 ) 2 p = ( 4 ) p e i p θ ( sin θ 2 ) 2 p , z = e i θ
Thus, the integral in the upper semicircle
0 π 1 ( 4 ) p ( 4 e i θ sin 2 θ 2 ) p [ ln ( 2 sin θ 2 ) i π θ 2 ] ( e i θ ) m p 1 i e i θ d θ = i 0 π ( sin θ 2 ) 2 p [ ln ( 2 sin θ 2 ) i π θ 2 ] e i m θ d θ
and the integral in the lower semicircle
π 0 1 ( 4 ) p ( 4 e i θ sin 2 θ 2 ) p [ ln ( 2 sin θ 2 ) + i π θ 2 ] ( e i θ ) m p 1 ( i ) e i θ d θ = i 0 π ( sin θ 2 ) 2 p [ ln ( 2 sin θ 2 ) + i π θ 2 ] e i m θ d θ
Next,
0 π 1 ( 4 ) p ( 4 e i θ sin 2 θ 2 ) p [ ln ( 2 sin θ 2 ) i π θ 2 ] ( e i θ ) m p 1 i e i θ d θ = i 0 π ( sin θ 2 ) 2 p [ ln ( 2 sin θ 2 ) i π θ 2 ] e i m θ d θ
and
π 0 1 ( 4 ) p ( 4 e i θ sin 2 θ 2 ) p [ ln ( 2 sin θ 2 ) + i π θ 2 ] ( e i θ ) m p 1 ( i ) e i θ d θ = i 0 π ( sin θ 2 ) 2 p [ ln ( 2 sin θ 2 ) + i π θ 2 ] e i m θ d θ .
Thus we can write that
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z + C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z = 2 i 0 π ( sin θ 2 ) 2 p ln ( 2 sin θ 2 ) ( e i m θ + e i m θ ) d θ .
Next, we compute
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z
(1) if p > 0 and m p , then z = 0 is a removable singularity of ( 1 z ) 2 p ln ( 1 z ) z m p 1 ; thus, the integral is equal to zero.
(2) if p > 0 and 0 m < p , then z = 0 is a pole of
f ( z ) : = ( 1 z ) 2 p ln ( 1 z ) z m p 1
  • with order p m . Let φ ( z ) : = ( 1 z ) 2 p ln ( 1 z ) z m p 1 · z p m = ( 1 z ) 2 p ln ( 1 z ) z 1 .
  • Then, we have
R e s z = 0 f ( z ) = φ ( p m 1 ) ( 0 ) ( p m 1 ) ! .
For easy computation, we obtain
[ ( 1 z ) 2 p ln ( 1 z ) z ] ( p m 1 ) ( 0 ) = j = 0 p m 1 C p m 1 j [ ( 1 z ) 2 p ] ( j ) ( ln ( 1 z ) z ) ( p m j 1 ) = ( ) 2 p + 1 j j = 0 p m 1 C p m 1 j ( 2 p ) ! ( 2 p j ) ! ( p m j 1 ) ! p m j = ( ) 2 p + 1 j j = 0 p m 1 ( p m 1 ) ! p m j C 2 p j
thus,
R e s z = 0 f ( z ) = φ ( p m 1 ) ( 0 ) ( p m 1 ) ! = j = 0 p m 1 C 2 p j ( 1 ) j + 1 p m j .
We can conclude that, for p > 0 and 0 m < p ,
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z = 2 π i ( 4 ) p j = 0 p m 1 C 2 p j ( 1 ) j + 1 p m j .
Secondly, we compute
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z .
For p > 0 , m 0 , then z = 0 is always a singularity. Let f ( z ) : = ( 1 z ) 2 p ln ( 1 z ) z m p 1 , then z = 0 is a pole of it with order m + p . Let φ ( z ) : = ( 1 z ) 2 p ln ( 1 z ) z 1 ,
R e s z = 0 f ( z ) = φ ( p + m 1 ) ( 0 ) ( p + m 1 ) ! = ( ) 1 + j j = 0 m + p 1 ( m + p 1 ) ! m + p j C 2 p j .
For p > 0 and 0 m < p , we have
C 1 ( 4 ) p ( 1 z ) 2 p ln ( 1 z ) z m p 1 d z = 2 π i ( 4 ) p j = 0 p + m 1 C 2 p j ( 1 ) j + 1 p + m j .
Next for p = 0 ,
C ln ( 1 z ) z m 1 d z = 0 , m = 0 , 1 , 2 , C ln ( 1 z ) z m 1 d z = 2 π i m , m = 1 , 2 , .
And
C ln ( 1 z ) z m 1 d z + C ln ( 1 z ) z m 1 d z = 2 i { 0 π ln ( 2 sin θ 2 ) e i m θ d θ + 0 π ln ( 2 sin θ 2 ) e i m θ d θ }
Finally, we have
0 π ln ( 2 sin θ 2 ) e i m θ d θ + 0 π ln ( 2 sin θ 2 ) e i m θ d θ = π m , m = 1 , 2 , 3 , 0 , m = 0
Problem A2. 
Compute the integral: C 1 ( 4 ) p ( 1 z ) 2 p z m p 1 d z , p 0 , m 0 .
Proof. 
(1) if p > 0 and m p 1 , z = 0 is removable singularity; thus, the integral is equal to zero.
  • (2) if p > 0 and 0 m < p + 1 , z = 0 is a pole of order p + 1 m .
  • Let f ( z ) = ( 1 z ) 2 p z m p 1 , then we have
    R e z z = 0 f ( z ) = [ z p + 1 m f ( z ) ] ( p m ) ( 0 ) ( p m ) ! = ( 1 ) p m ( 2 p ) ! ( p + m ) !
    thus,
    1 ( 4 ) p ( 1 z ) 2 p z m p 1 d z = 2 π i ( 1 ) m ( 4 ) p ( 2 p ) ! ( p + m ) !
    (3) if p = 0 and m = 1 , 2 , , the integral is equal to zero. and for p = 0 , m = 0 , the integral is equal to 2 π i . □

References

  1. Ikehata, M. The framework of the enclosure method with dynamical data and its applications. Inverse Probl. 2011, 27, 065005. [Google Scholar] [CrossRef]
  2. Ikehata, M.; Ohe, T. A numerical method for finding the convex hull of polygonal cavities using the enclosure method. Inverse Probl. 2002, 18, 111. [Google Scholar] [CrossRef]
  3. Ikehata, M. The enclosure method for inverse obstacle scattering using a single electromagnetic wave in time domain. arXiv 2013, arXiv:1401.0083. [Google Scholar] [CrossRef]
  4. Ikehata, M.; Kawashita, M. The enclosure method for the heat equation. Inverse Probl. 2009, 25, 075005. [Google Scholar] [CrossRef]
  5. Ikehata, M. The enclosure method for inverse obstacle scattering problems with dynamical data over a finite time interval. Inverse Probl. 2010, 26, 055010. [Google Scholar] [CrossRef]
  6. Ikehata, M. Revisiting the probe and enclosure methods. Inverse Probl. 2022, 38, 075009. [Google Scholar] [CrossRef]
  7. Haddar, H.; Lechleiter, A.; Marmorat, S. An improved time domain linear sampling method for Robin and Neumann obstacles. Appl. Anal. 2014, 93, 369–390. [Google Scholar] [CrossRef]
  8. Guo, Y.; Monk, P.; Colton, D. Toward a time domain approach to the linear sampling method. Inverse Probl. 2013, 29, 095016. [Google Scholar] [CrossRef]
  9. Guo, Y.; Monk, P.; Colton, D. The linear sampling method for sparse small aperture data. Appl. Anal. 2016, 95, 1599–1615. [Google Scholar] [CrossRef]
  10. Cakoni, F.; Colton, D. On the mathematical basis of the linear sampling method. Georgian Math. J. 2003, 411–425. [Google Scholar] [CrossRef]
  11. Arens, T.; Lechleiter, A. The linear sampling method revisited. J. Integral Equ. Appl. 2009, 21, 179–202. [Google Scholar] [CrossRef]
  12. Arens, T. Why linear sampling works. Inverse Probl. 2003, 20, 163. [Google Scholar] [CrossRef]
  13. Cakoni, F.; Colton, D. The linear sampling method for cracks. Inverse Probl. 2003, 19, 279. [Google Scholar] [CrossRef]
  14. Chen, Q.; Haddar, H.; Lechleiter, A.; Monk, P. A sampling method for inverse scattering in the time domain. Inverse Probl. 2010, 26, 085001. [Google Scholar] [CrossRef]
  15. Cakoni, F.; Monk, P.; Selgas, V. Analysis of the linear sampling method for imaging penetrable obstacles in the time domain. Anal. PDE 2021, 14, 667–688. [Google Scholar] [CrossRef]
  16. Cakoni, F.; Haddar, H.; Lechleiter, A. On the factorization method for a far field inverse scattering problem in the time domain. SIAM J. Math. Anal. 2019, 51, 854–872. [Google Scholar] [CrossRef]
  17. Haddar, H.; Liu, X. A time domain factorization method for obstacles with impedance boundary conditions. Inverse Probl. 2020, 36, 105011. [Google Scholar] [CrossRef]
  18. Litynskyy, S.; Muzychuk, Y.; Muzychuk, A. On the numerical solution of the initial-boundary value problem with neumann condition for the wave equation by the use of the laguerre transform and boundary elements method. Acta Mech. Autom. 2016, 10, 285–290. [Google Scholar] [CrossRef]
  19. Hlova, A.; Litynskyy, S.; Muzychuk Yu, A.; Muzychuk, A. Coupling of Laguerre transform and Fast BEM for solving Dirichlet initial-boundary value problems for the wave equation. J. Comput. Appl. Math 2018, 128, 42–60. [Google Scholar]
  20. Litynskyy, S.; Muzychuk, A. Solving of initial-boundary value problems for the wave equation using retarded surface potential and Laguerre transform. Mat. Stud. 2015, 44, 185–203. [Google Scholar] [CrossRef]
  21. Lubich, C. Convolution quadrature and discretized operational calculus. I. Numer. Math. 1988, 52, 129–145. [Google Scholar] [CrossRef]
  22. Lubich, C. Convolution quadrature and discretized operational calculus. II. Numer. Math. 1988, 52, 413–425. [Google Scholar] [CrossRef]
  23. Laliena, A.R.; Sayas, F.J. Theoretical aspects of the application of convolution quadrature to scattering of acoustic waves. Numer. Math. 2009, 112, 637–678. [Google Scholar] [CrossRef]
  24. Lubich, C. Convolution quadrature revisited. BIT Numer. Math. 2004, 44, 503–514. [Google Scholar] [CrossRef]
  25. Labarca, I.; Hiptmair, R. Acoustic scattering problems with convolution quadrature and the method of fundamental solutions. Commun. Comput. Phys. 2021, 30, 985–1008. [Google Scholar] [CrossRef]
  26. Aldahham, E.; Banjai, L. A modified convolution quadrature combined with the method of fundamental solutions and Galerkin BEM for acoustic scattering. arXiv 2022, arXiv:2203.00996. [Google Scholar]
  27. Ballani, J.; Banjai, L.; Sauter, S.A.; Veit, A. Numerical solution of exterior Maxwell problems by Galerkin BEM and Runge-Kutta convolution quadrature. Numer. Math. 2013, 123, 643–670. [Google Scholar] [CrossRef]
  28. Lubich, C. On the multistep time discretization of linear initial-boundary value problems and their boundary integral equations. Numer. Math. 1994, 67, 365–389. [Google Scholar] [CrossRef]
  29. Banjai, L.; Sauter, S. Rapid solution of the wave equation in unbounded domains. SIAM J. Numer. Anal. 2009, 47, 227–249. [Google Scholar] [CrossRef]
  30. Banjai, L.; Lubich, C. An error analysis of Runge–Kutta convolution quadrature. BIT Numer. Math. 2011, 51, 483–496. [Google Scholar] [CrossRef]
  31. Zhao, L.; Dong, H.; Ma, F. Inverse obstacle scattering for acoustic waves in the time domain. Inverse Probl. Imaging 2021, 15, 1269. [Google Scholar] [CrossRef]
  32. Ivanyshyn, O.; Johansson, T. Nonlinear integral equation methods for the reconstruction of an acoustically sound-soft obstacle. J. Integral Equ. Appl. 2007, 19, 289–308. [Google Scholar] [CrossRef]
  33. Johansson, T.; Sleeman, B.D. Reconstruction of an acoustically sound-soft obstacle from one incident field and the far-field pattern. IMA J. Appl. Math. 2007, 72, 96–112. [Google Scholar] [CrossRef]
  34. Sayas, F.J. Retarded Potentials and Time Domain Boundary Integral Equations: A Road Map; Springer: Berlin/Heidelberg, Germany, 2016; Volume 50. [Google Scholar]
  35. Dong, H.; Lai, J.; Li, P. A highly accurate boundary integral method for the elastic obstacle scattering problem. Math. Comput. 2021, 90, 2785–2814. [Google Scholar] [CrossRef]
  36. Kress, R. Linear Integral Equations; Springer: Berlin/Heidelberg, Germany, 1989. [Google Scholar]
  37. Kirsch, A. An Introduction to the Mathematical Theory of Inverse Problems; Springer: Berlin/Heidelberg, Germany, 2011; Volume 120. [Google Scholar]
  38. Dong, H.; Zhang, D.; Guo, Y. A reference ball based iterative algorithm for imaging acoustic obstacle from phaseless far-field data. arXiv 2018, arXiv:1804.05062. [Google Scholar] [CrossRef]
  39. Courant, R.; Hilbert, D. Methoden der Mathematischen Physik; Springer: Berlin/Heidelberg, Germany, 2013. [Google Scholar]
  40. Dennery, P.; Krzywicki, A. Mathematics for Physicists; Courier Corporation: Chelmsford, MA, USA, 2012. [Google Scholar]
Figure 1. Reconstruction of an acorn-shaped obstacle at different levels of noise. The radius of the initial guess is r 0 = 0.3 . The position of the initial guess is ( 0.6 , 0.3 ) . The (ac) show that when we keep the initial guess unchanged and incident waves from different angles, we can have a better reconstruction effect, except that the error of the reconstruction far away from the point source is a little large. But the result is in line with our expectations. The results of (di) show that when we increase the noise level, the reconstruction method is still used, but the error will be larger.
Figure 1. Reconstruction of an acorn-shaped obstacle at different levels of noise. The radius of the initial guess is r 0 = 0.3 . The position of the initial guess is ( 0.6 , 0.3 ) . The (ac) show that when we keep the initial guess unchanged and incident waves from different angles, we can have a better reconstruction effect, except that the error of the reconstruction far away from the point source is a little large. But the result is in line with our expectations. The results of (di) show that when we increase the noise level, the reconstruction method is still used, but the error will be larger.
Mathematics 13 00771 g001
Figure 2. Reconstruction of a bean-shaped obstacle at different levels of noise. The angle of incident wave is θ = π / 4 . We keep the angle of the incident wave unchanged while the initial guess is in different position. (ac) show that for bean-shaped obstacles, the change in initial guess position does not affect the effectiveness of the reconstruction method, except that the error of the reconstruction far away from the point source is a little large, such as (f) shows. (di) shows that when we increase the noise level, the reconstruction method still works. But compared with the reconstruction results of acorn-shaped obstacles, it (i) tells us that even if we enhance the noise level to 20 % , the method still performs well (But when we enhance the noise level to 24 % , the error is too large to accept).
Figure 2. Reconstruction of a bean-shaped obstacle at different levels of noise. The angle of incident wave is θ = π / 4 . We keep the angle of the incident wave unchanged while the initial guess is in different position. (ac) show that for bean-shaped obstacles, the change in initial guess position does not affect the effectiveness of the reconstruction method, except that the error of the reconstruction far away from the point source is a little large, such as (f) shows. (di) shows that when we increase the noise level, the reconstruction method still works. But compared with the reconstruction results of acorn-shaped obstacles, it (i) tells us that even if we enhance the noise level to 20 % , the method still performs well (But when we enhance the noise level to 24 % , the error is too large to accept).
Mathematics 13 00771 g002
Figure 3. Reconstruction of a peanut-shaped obstacle at different levels of noise. The position of the initial guess is ( 0.6 , 0.3 ) . In (h), the radius of initial guess is r 0 = 0.15 , while the others are r 0 = 0.3 . (ac) show that for peanut-shaped obstacle, when we fixed the initial guess, the reconstruction method is effective for incident waves at different angles. (di) show that when we increase the noise level, the reconstruction method still works. However, by comparing (d,g), we find that after fixing the incident wave angle and noise level, adjusting the relative size of the initial guess and the obstacle has an impact on the accuracy of the reconstruction results. As the result of (g) shows, when we reduce the size of the obstacle, the reconstruction result is better than that of (d). We can get same results from (e,f,h,i).
Figure 3. Reconstruction of a peanut-shaped obstacle at different levels of noise. The position of the initial guess is ( 0.6 , 0.3 ) . In (h), the radius of initial guess is r 0 = 0.15 , while the others are r 0 = 0.3 . (ac) show that for peanut-shaped obstacle, when we fixed the initial guess, the reconstruction method is effective for incident waves at different angles. (di) show that when we increase the noise level, the reconstruction method still works. However, by comparing (d,g), we find that after fixing the incident wave angle and noise level, adjusting the relative size of the initial guess and the obstacle has an impact on the accuracy of the reconstruction results. As the result of (g) shows, when we reduce the size of the obstacle, the reconstruction result is better than that of (d). We can get same results from (e,f,h,i).
Mathematics 13 00771 g003
Figure 4. Reconstruction of a kite-shaped obstacle. The noise level is 1 % , and the radius of initial guess is r 0 = 0.3 . (af) shows that even if we keep the noise level at 1 % for the reconstruction of kite-shaped obstacle, the angle of the incident wave will have a relatively large impact on the reconstruction results. The (d) clearly shows that. But this is also in line with our expectations. Further, as the results of (df) show, when we reduce the size of the obstacle, the reconstruction result is better. Note that the parametric equations for kite-shaped obstacle are set to be s 1 = r ( c o s ( t ) + 0.65 c o s ( 2 t ) 0.65 ) ; s 2 = r 1.5 s i n ( t ) ; In (d,e), we choose r to be 1 / 6 and 1 / 7 , respectively, while in (f), r is set to be 1 / 8 .
Figure 4. Reconstruction of a kite-shaped obstacle. The noise level is 1 % , and the radius of initial guess is r 0 = 0.3 . (af) shows that even if we keep the noise level at 1 % for the reconstruction of kite-shaped obstacle, the angle of the incident wave will have a relatively large impact on the reconstruction results. The (d) clearly shows that. But this is also in line with our expectations. Further, as the results of (df) show, when we reduce the size of the obstacle, the reconstruction result is better. Note that the parametric equations for kite-shaped obstacle are set to be s 1 = r ( c o s ( t ) + 0.65 c o s ( 2 t ) 0.65 ) ; s 2 = r 1.5 s i n ( t ) ; In (d,e), we choose r to be 1 / 6 and 1 / 7 , respectively, while in (f), r is set to be 1 / 8 .
Mathematics 13 00771 g004
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

Qu, Z.; Ma, F. Inverse Acoustic Scattering from a Bounded Homogeneous Penetrable Obstacle. Mathematics 2025, 13, 771. https://doi.org/10.3390/math13050771

AMA Style

Qu Z, Ma F. Inverse Acoustic Scattering from a Bounded Homogeneous Penetrable Obstacle. Mathematics. 2025; 13(5):771. https://doi.org/10.3390/math13050771

Chicago/Turabian Style

Qu, Zhenpu, and Fuming Ma. 2025. "Inverse Acoustic Scattering from a Bounded Homogeneous Penetrable Obstacle" Mathematics 13, no. 5: 771. https://doi.org/10.3390/math13050771

APA Style

Qu, Z., & Ma, F. (2025). Inverse Acoustic Scattering from a Bounded Homogeneous Penetrable Obstacle. Mathematics, 13(5), 771. https://doi.org/10.3390/math13050771

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