betaFeedback

WorksMathematics

Reduced-order modeling for electromagnetic inverse problems: a layered medium benchmark

Abstract

We study reduced-order modeling for inverse problems in layered media, focusing on the recovery of impedance profiles from time-domain measurements. Using the Goupillaud structure, we formulate the forward problem as a discrete dynamical system and introduce a ROM-based objective defined at the level of reduced operators. Through numerical experiments on a 5-layer medium under various structured perturbations, we compare the ROM-based objective with a classical data misfit. The results show that the ROM-based inversion provides a more favorable reconstruction in the clean setting and in certain structured perturbation regimes, while remaining consistently competitive with the classical approach across all cases considered.

Introduction

Wave propagation in heterogeneous media plays a central role in many areas of science and engineering, including radar and sonar imaging [3, 13, 14, 20], seismology and geophysical exploration [25, 30] and medical imaging via ultrasound [27]. In these applications, one seeks to recover information about an inaccessible medium from measurements of waves generated by controlled sources and recorded by an array of sensors. This leads to inverse problems for wave equations, where the goal is to estimate spatially varying material parameters such as wave speed, density, or electromagnetic coefficients.

Mathematically, wave propagation is typically modeled by second-order wave equations or, more generally, by first-order hyperbolic systems [19, 23]. The unknown medium properties enter as coefficients in these equations and the measurements correspond to partial observations of the resulting wave field. The associated inverse problem is highly nonlinear and ill-posed, as the mapping from the coefficients to the observed data is complicated and sensitive to perturbations. Fundamental questions of uniqueness and stability have been extensively studied in the literature [1, 24, 33], but these results often rely on idealized data that are not available in practical applications.

In practice, waveform inversion is commonly formulated as a nonlinear least-squares optimization problem, known as full waveform inversion (FWI), where one minimizes the discrepancy between measured and simulated data. Despite its widespread use, FWI suffers from severe limitations due to the non-convexity of the objective function. In particular, for band-limited and high-frequency data, the objective function exhibits numerous local minima, a phenomenon known as cycle skipping, which causes gradient-based optimization methods to fail even when initialized close to the true solution.

Several approaches have been proposed to mitigate these difficulties. One direction consists of replacing the classical L2L^2 data misfit by alternative metrics, such as the Wasserstein distance from optimal transport theory [17, 32]. This approach can improve the convexity of the objective function in simple settings [18], although this property does not hold in general heterogeneous media [10]. Another approach is the so-called modeling operator extension or extended FWI [22, 29, 31], which introduces additional degrees of freedom in the inversion procedure. While effective in certain configurations, its theoretical guarantees are limited to simplified acquisition geometries [26].

A different and promising strategy is based on reduced-order modeling (ROM) [4, 5, 7, 8, 9, 10, 15, 16, 28]. In this framework, one constructs a low-dimensional dynamical system that captures the essential features of wave propagation in the unknown medium. These ROMs are data-driven: they are computed directly from the measurements without requiring knowledge of the wave field inside the medium. The construction relies on Galerkin projection onto spaces spanned by wave snapshots [2, 12, 21], leading to reduced operators that encode the propagation dynamics. Inversion methods based on ROM have been shown to yield objective functions with improved optimization properties compared to classical FWI. Despite these advances, several challenges remain. In particular, understanding the behavior of ROM-based inversion in structured media and under realistic perturbations is still an open problem. Moreover, while the general ROM framework applies to a wide class of wave equations, its concrete implementation and analysis often benefit from simplified settings that retain the essential features of wave propagation, such as multiple scattering and reflection phenomena.

In this work, we investigate reduced-order modeling for inverse problems in layered media, with a focus on Goupillaud-type structures. This setting provides a natural discrete representation of wave propagation, where scattering events occur at discrete times and the wave field evolves according to a dynamical system. This structure allows for an explicit connection between wave propagation, data acquisition and reduced-order modeling. Our main contributions are as follows. The reduced-order modeling framework that we use follows closely the construction introduced in [6, 11]. Our contribution is to adapt and analyze this framework in the specific setting of layered media, where the wave dynamics admit a discrete representation. First, we formulate a ROM-based objective for layered media that compares normalized reduced operators and removes global scaling effects. Then, we establish a precise connection between the Goupillaud structure and a data-driven discrete dynamical system, allowing for an explicit ROM construction. Finally, we provide a systematic numerical study under structured perturbations, identifying regimes in which the ROM-based inversion improves stability and reconstruction accuracy while remaining competitive in all cases.

The paper is organized as follows. In § 2, we introduce the electromagnetic forward problem and derive its first-order hyperbolic formulation. In § 3, we show how this system can be reduced to a scalar wave equation in a layered medium. § 5 is devoted to the analysis of one-dimensional layered media and the connection with the ROM framework. In § 6, we formulate the inverse problem and introduce the ROM-based objective function. § 7 presents numerical experiments comparing the ROM-based inversion with classical approaches under various perturbations. Finally, § 8 concludes the paper with a discussion of the results and perspectives for future work.

Problem formulation

We consider the inverse problem of recovering properties of an electromagnetic medium from measurements recorded by an array of antennas. The propagation of electromagnetic waves is governed by Maxwell’s equations. In this section we formulate the forward problem, introduce the frequency-domain representation, and describe the reduced-order modeling framework that will be used for inversion.

Maxwell’s equations

Let Ω⊂R3\Omega\subset\mathbb{R}^{3} be a compact domain with Lipschitz boundary ∂Ω\partial\Omega. For x∈Ωx \in\Omega and t∈Rt \in\mathbb{R}, the electromagnetic fields consist of the electric field E(t,x)\mathbf{E}(t,x) and the magnetic flux density B(t,x)\mathbf{B}(t,x). We assume that the medium is described by a dielectric permittivity tensor ε(x)\boldsymbol{\varepsilon}(x) and a scalar magnetic permeability μ(x)\mu(x). The tensor ε(x)\boldsymbol{\varepsilon}(x) is assumed to be symmetric and positive definite, while μ(x)\mu(x) is assumed to be strictly positive. Both coefficients are time independent.

The fields satisfy Maxwell’s equations

{∇×E(t,x)+∂B∂t(t,x)=−Jm(t,x),−∇×(μ(x)−1B(t,x))+ε(x)∂E∂t(t,x)=−Je(t,x).(1)\left\{ \begin{aligned} \nabla\times\mathbf{E}(t,x) + \frac{\partial\mathbf{B}}{\partial t}(t,x) &= -\mathbf{J}_{m}(t,x),\\ -\nabla\times\left(\mu(x)^{-1}\mathbf{B}(t,x)\right) + \boldsymbol{\varepsilon}(x)\frac{\partial\mathbf{E}}{\partial t}(t,x) &= -\mathbf{J}_{e}(t,x). \end{aligned} \right. \tag*{(1)}

where Je\mathbf{J}_{e} and Jm\mathbf{J}_{m} denote the electric and magnetic current sources, respectively. We consider vanishing initial conditions prior to the excitation,

E(t,x)=0,B(t,x)=0,t≪0, x∈R3.(2)\mathbf{E}(t,x) = 0,\qquad\mathbf{B}(t,x) = 0,\qquad t \ll0,\ x \in\mathbb{R}^{3}. \tag*{(2)}

On the boundary of the truncated domain, we use a standard conservative Maxwell realization. For definiteness, we impose perfectly conducting boundary conditions,

n(x)×E(t,x)=0,x∈∂Ω.(3)\mathbf{n}(x) \times\mathbf{E}(t,x) = 0, \qquad x \in\partial\Omega. \tag*{(3)}

Lemma 2.1. Introducing the state vector

U(t,x):=(E(t,x)B(t,x)),(4)\mathbf{U}(t,x) := \begin{pmatrix} \mathbf{E}(t,x) \\ \mathbf{B}(t,x) \end{pmatrix}, \tag*{(4)}

Maxwell’s equations can be written as a first-order hyperbolic system of the form

(A+∂∂t)U(t,x)=S(t,x),(5)\left(\mathbf{A} + \frac{\partial}{\partial t}\right)\mathbf{U}(t,x) = \mathbf{S}(t,x), \tag*{(5)}

where

A=(0−ε(x)−1∇×μ(x)−1∇×0)(6)\mathbf{A} = \begin{pmatrix} 0 & -\varepsilon(x)^{-1}\nabla\times\mu(x)^{-1} \\ \nabla\times& 0 \end{pmatrix} \tag*{(6)}

and

S(t,x)=−(ε(x)−1Je(t,x)Jm(t,x)).(7)\mathbf{S}(t,x) = - \begin{pmatrix} \varepsilon(x)^{-1}\mathbf{J}_{e}(t,x) \\ \mathbf{J}_{m}(t,x) \end{pmatrix}. \tag*{(7)}

Here the notation ∇×μ−1\nabla\times\mu^{-1} means that the multiplication by μ(x)−1\mu(x)^{-1} is applied before taking the curl.

Proof. See Appendix § 9.§ 1.

Lemma 2.2. Using the normalized fields

E~(t,x)=ε(x)12E(t,x),B~(t,x)=μ(x)−12B(t,x),(8)\widetilde{\mathbf{E}}(t,x) = \varepsilon(x)^{\frac{1}{2}}\mathbf{E}(t,x), \qquad\widetilde{\mathbf{B}}(t,x) = \mu(x)^{-\frac{1}{2}}\mathbf{B}(t,x), \tag*{(8)}

where ε(x)1/2\varepsilon(x)^{1/2} denotes the symmetric positive definite square root of ε(x)\varepsilon(x), the system (5) becomes

(A~+∂∂t)U~(t,x)=S~(t,x),t∈R,x∈Ω,(9)\left(\widetilde{\mathbf{A}} + \frac{\partial}{\partial t}\right)\widetilde{\mathbf{U}}(t,x) = \widetilde{\mathbf{S}}(t,x), \qquad t \in\mathbb{R}, \quad x \in\Omega, \tag*{(9)}

with

U~(t,x)=(E~(t,x)B~(t,x)).(10)\widetilde{\mathbf{U}}(t,x) = \begin{pmatrix} \widetilde{\mathbf{E}}(t,x) \\ \widetilde{\mathbf{B}}(t,x) \end{pmatrix}. \tag*{(10)}

The differential operator A~\widetilde{\mathbf{A}} is

A~=(0−ε(x)−12∇×μ(x)−12μ(x)−12∇×ε(x)−120),(11)\widetilde{\mathbf{A}} = \begin{pmatrix} 0 & -\varepsilon(x)^{-\frac{1}{2}}\nabla\times\mu(x)^{-\frac{1}{2}} \\ \mu(x)^{-\frac{1}{2}}\nabla\times\varepsilon(x)^{-\frac{1}{2}} & 0 \end{pmatrix}, \tag*{(11)}

and

S~(t,x)=−(ε(x)−12Je(t,x)μ(x)−12Jm(t,x)).(12)\widetilde{\mathbf{S}}(t,x) = - \begin{pmatrix} \varepsilon(x)^{-\frac{1}{2}}\mathbf{J}_{e}(t,x) \\ \mu(x)^{-\frac{1}{2}}\mathbf{J}_{m}(t,x) \end{pmatrix}. \tag*{(12)}

In (11), the coefficient μ(x)−1/2\mu(x)^{-1/2} is part of the argument of the curl. Thus

∇×μ(x)−1/2v=∇×(μ(x)−1/2v).\nabla\times\mu(x)^{-1/2}\mathbf{v} = \nabla\times\left(\mu(x)^{-1/2}\mathbf{v}\right).

Proof. See Appendix § 9.§ 2.

Lemma 2.3. The operator matrix A~\widetilde{\mathbf{A}} is skew-symmetric on the above domain. With the standard perfectly conducting Maxwell realization, it is skew-adjoint.

Proof. See Appendix § 9.§ 3.

Frequency-domain formulation

Frequency-domain formulation

Excitation expression

We assume that the data for the inversion are collected by an array of mm antennas. Let p=1,2,…,6p=1,2,\ldots,6 denote the polarizations. Then the excitation of the sths^{\mathrm{th}} antenna is given by

Je(s,p)={ε12(x)f(t)Fe(s)(x)ep,s=1,…,m,p=1,2,3,0,s=1,…,m,p=4,5,6,(13)\mathbf{J}_{e}^{(s,p)}= \begin{cases} \varepsilon^{\frac{1}{2}}(x)f(t)F_{e}^{(s)}(x)e_p, & s=1,\ldots,m,\quad p=1,2,3,\\ 0, & s=1,\ldots,m,\quad p=4,5,6, \end{cases} \tag*{(13)}

and

Jm(s,p)={0,s=1,…,m,p=1,2,3,μ12(x)f(t)Fm(s)(x)ep−3,s=1,…,m,p=4,5,6.(14)\mathbf{J}_{m}^{(s,p)}= \begin{cases} 0, & s=1,\ldots,m,\quad p=1,2,3,\\ \mu^{\frac{1}{2}}(x)f(t)F_{m}^{(s)}(x)e_{p-3}, & s=1,\ldots,m,\quad p=4,5,6. \end{cases} \tag*{(14)}

This choice ensures that the normalized source has the same form in all polarizations. Here e1,e2,e3e_1,e_2,e_3 are the canonical basis vectors in R3\mathbb{R}^3.

Here, ff denotes the probing pulses emitted by the antennas. They are supported in a short time interval (−Tf,Tf)(-T_f,T_f) and have Fourier transform f^\hat{f} that is non-negligible at frequencies ω\omega satisfying ∣ω±ω0∣<πb|\omega\pm\omega_0|<\pi b. The pulse satisfies

f^(0)=∫−TfTff(t) dt=0.(15)\hat{f}(0)=\int_{-T_f}^{T_f}f(t)\,\mathrm{d}t=0. \tag*{(15)}

Component-wise problem formulation

Using the polarization of each antenna, we write

U~(s,p)(t,x)=(E~(s,p)(t,x)B~(s,p)(t,x)),s=1,…,m,p=1,2,…,6.(16)\widetilde{\mathbf{U}}^{(s,p)}(t,x)= \begin{pmatrix} \widetilde{\mathbf{E}}^{(s,p)}(t,x)\\ \widetilde{\mathbf{B}}^{(s,p)}(t,x) \end{pmatrix}, \qquad s=1,\ldots,m,\quad p=1,2,\ldots,6. \tag*{(16)}

Substituting (13), (14) and (16) into (9), we get

(A~+∂∂t)U~(s,p)(t,x)=−(ε(x)−12Je(s,p)(t,x)μ(x)−12Jm(s,p)(t,x)).\left(\widetilde{A}+\frac{\partial}{\partial t}\right)\widetilde{\mathbf{U}}^{(s,p)}(t,x) = -\begin{pmatrix} \varepsilon(x)^{-\frac{1}{2}}\mathbf{J}_{e}^{(s,p)}(t,x)\\ \mu(x)^{-\frac{1}{2}}\mathbf{J}_{m}^{(s,p)}(t,x) \end{pmatrix}.

Let {e~p}p=16\{\widetilde{e}_p\}_{p=1}^{6} be the canonical basis in R6\mathbb{R}^6 and introduce the antenna excitation matrix

F(s)(x):=(Fe(s)(x)I300Fm(s)(x)I3)∈R6×6.(17)\mathbf{F}^{(s)}(x):= \begin{pmatrix} F_{e}^{(s)}(x)\mathbf{I}_3 & 0\\ 0 & F_{m}^{(s)}(x)\mathbf{I}_3 \end{pmatrix}\in\mathbb{R}^{6\times6}. \tag*{(17)}

Then the component-wise system becomes

(A~+∂∂t)U~(s,p)(t,x)=−f(t)F(s)(x)e~p.(18)\left(\widetilde{A}+\frac{\partial}{\partial t}\right)\widetilde{\mathbf{U}}^{(s,p)}(t,x) =-f(t)\mathbf{F}^{(s)}(x)\widetilde{e}_p. \tag*{(18)}

The associated initial condition is

U~(s,p)(t,x)=0,t<−Tf,x∈Ω.(19)\widetilde{\mathbf{U}}^{(s,p)}(t,x)=0,\qquad t<-T_f,\quad x\in\Omega. \tag*{(19)}

The boundary conditions are chosen so that the boundary contribution in the curl Green formula vanishes. For the perfectly conducting realization used here, this corresponds in the normalized variables to

n×(ε−12E~(s,p))=0.n\times\left(\varepsilon^{-\frac{1}{2}}\widetilde{\mathbf{E}}^{(s,p)}\right)=0.

The natural domain of A~\widetilde{A} is therefore

D:={ψ(x):=(ψ1(x)ψ2(x)):∇×(ε(x)−12ψ1(x))∈L2(Ω), ∇×(μ(x)−12ψ2(x))∈L2(Ω), n×(ε−12ψ1)∣∂Ω=0}.(20)\mathcal{D}:=\left\{\psi(x):= \begin{pmatrix} \psi_1(x)\\ \psi_2(x) \end{pmatrix}: \nabla\times\left(\varepsilon(x)^{-\frac{1}{2}}\psi_1(x)\right)\in L^2(\Omega),\ \nabla\times\left(\mu(x)^{-\frac{1}{2}}\psi_2(x)\right)\in L^2(\Omega),\ n\times\left(\varepsilon^{-\frac{1}{2}}\psi_1\right)\big|_{\partial\Omega}=0 \right\}. \tag*{(20)}

Wave decomposition

For the potential representation of the null-space component, we assume for simplicity that Ω\Omega is simply connected with connected boundary.

Theorem 2.4 (Helmholtz decomposition). The solution to (18) with the initial and boundary conditions above has the Helmholtz decomposition

U~(s,p)(t,x)=∇~N(s,p)(t,x)+U(s,p)(t,x),(21)\widetilde{\mathbf{U}}^{(s,p)}(t,x)=\widetilde{\nabla}\mathbf{N}^{(s,p)}(t,x)+\mathbf{U}^{(s,p)}(t,x), \tag*{(21)}

where ∇~N(s,p)∈null⁡(A~)\widetilde{\nabla}\mathbf{N}^{(s,p)}\in\operatorname{null}(\widetilde{A}) and U(s,p)∈range⁡(A~)=null⁡(A~)⊥\mathbf{U}^{(s,p)}\in\operatorname{range}(\widetilde{A})=\operatorname{null}(\widetilde{A})^\perp, for s=1,…,ms=1,\ldots,m and p=1,2,…,6p=1,2,\ldots,6. The operator ∇~\widetilde{\nabla} is defined by

∇~ψ(x)=(ε(x)12∇ψ1(x)μ(x)12∇ψ2(x)),ψ=(ψ1ψ2).(22)\widetilde{\nabla}\psi(x)=\begin{pmatrix}\varepsilon(x)^{\frac{1}{2}}\nabla\psi_1(x)\\ \mu(x)^{\frac{1}{2}}\nabla\psi_2(x)\end{pmatrix},\qquad\psi=\begin{pmatrix}\psi_1\\\psi_2\end{pmatrix}. \tag*{(22)}

Proof. See Appendix A.4.

Remark. The propagating component U(s,p)\mathbf{U}^{(s,p)} is orthogonal to the null space of A~\widetilde{A} and satisfies the corresponding weak divergence constraints. This is the analogue of the standard Maxwell decomposition; see, for instance, Lemma 4.5 in [23].

Let P0P_0 denote the orthogonal projection onto null⁡(A~)\operatorname{null}(\widetilde{A}), and let Pr=I−P0P_r=I-P_0. For

F(s,p)(x):=F(s)(x)e~p,\mathbf{F}^{(s,p)}(x):=\mathbf{F}^{(s)}(x)\widetilde{\mathbf{e}}_p,

we write

F0(s,p):=P0F(s,p),F(s,p):=PrF(s,p).\mathbf{F}_0^{(s,p)}:=P_0\mathbf{F}^{(s,p)},\qquad\mathbf{F}^{(s,p)}:=P_r\mathbf{F}^{(s,p)}.

The null-space component satisfies

∂∂t∇~N(s,p)(t,x)=−f(t)F0(s,p)(x).(23)\frac{\partial}{\partial t}\widetilde{\nabla}\mathbf{N}^{(s,p)}(t,x)=-f(t)\mathbf{F}_0^{(s,p)}(x). \tag*{(23)}

The range component satisfies

(A~+∂∂t)U(s,p)(t,x)=−f(t)F(s,p)(x),t∈R, x∈Ω,(24)\left(\widetilde{A}+\frac{\partial}{\partial t}\right)\mathbf{U}^{(s,p)}(t,x)=-f(t)\mathbf{F}^{(s,p)}(x),\qquad t\in\mathbb{R},\ x\in\Omega, \tag*{(24)}

where F(s,p)\mathbf{F}^{(s,p)} is the range component of F(s,p)(x)\mathbf{F}^{(s,p)}(x).

Array response matrix

Let us assume that the antenna profiles F(s)\mathbf{F}^{(s)} are spatially localized in a small neighborhood of the receiver position xsx_s. More precisely, each F(s)\mathbf{F}^{(s)} is supported in a region whose diameter is small compared with the wavelength and satisfies the normalization condition

∫ΩF(s)(x) dx=I6.\int_{\Omega}\mathbf{F}^{(s)}(x)\,\mathrm{d}x=I_6.

In this sense, the functions F(s)\mathbf{F}^{(s)} act as approximate Dirac distributions centered at xsx_s. As a result, the measurements correspond to localized averages of the wave field, and we use the approximation

∫ΩF(s′)(x)U(t,x) dx≈U(t,xs′).\int_{\Omega}\mathbf{F}^{(s')}(x)\mathbf{U}(t,x)\,\mathrm{d}x\approx\mathbf{U}(t,x_{s'}).

We define the array response matrix to be the 6m×6m6m\times6m time dependent matrix W\mathcal{W}. In the (s,p)(s,p) column of this matrix, we store the recording of U~(s,p)\widetilde{\mathbf{U}}^{(s,p)} at all the antennas. Then,

W(s′,p′),(s,p)(t)=e~p′T∫ΩF(s′)(x)U~(s,p)(t,x) dx≈e~p′TU~(s,p)(t,xs′).(25)\mathcal{W}^{(s',p'),(s,p)}(t)=\widetilde{\mathbf{e}}_{p'}^{\mathsf{T}}\int_{\Omega}\mathbf{F}^{(s')}(x)\widetilde{\mathbf{U}}^{(s,p)}(t,x)\,\mathrm{d}x\approx\widetilde{\mathbf{e}}_{p'}^{\mathsf{T}}\widetilde{\mathbf{U}}^{(s,p)}(t,x_{s'}). \tag*{(25)}

Let us emphasize that, although the general formulation allows for anisotropic media and variable permeability, we assume that the medium is known, isotropic and homogeneous in the vicinity of the array. In this region, ε=ε0I\varepsilon= \varepsilon_0 I and μ=μ0\mu= \mu_0, so the reference scalar wave speed is

c0=1μ0ε0.c_0 = \frac{1}{\sqrt{\mu_0\varepsilon_0}}.

By vicinity, we mean within a distance 2c0Tf2c_0T_f traveled by the waves over the duration of the probing pulse ff.

Thus, since the medium is known and homogeneous within a distance 2c0Tf2c_0T_f from the array, we can compute U~(s,p)\widetilde{\mathbf{U}}^{(s,p)} for t∈(−Tf,Tf)t \in(-T_f,T_f) and remove the component lying in the null space. Then, we obtain the transformed array response matrix W(t)∈R6m×6m\mathbf{W}(t) \in\mathbb{R}^{6m\times6m}, with entries

W(s′,p′),(s,p)(t)=e~p′T∫ΩF(s′)(x)U(s,p)(t,x) dx≈e~p′TU~(s,p)(t,xs′).(26)W^{(s',p'),(s,p)}(t)=\widetilde{\mathbf{e}}_{p'}^{\mathsf{T}}\int_{\Omega}\mathbf{F}^{(s')}(x)\mathbf{U}^{(s,p)}(t,x)\,\mathrm{d}x\approx\widetilde{\mathbf{e}}_{p'}^{\mathsf{T}}\widetilde{\mathbf{U}}^{(s,p)}(t,x_{s'}). \tag*{(26)}

Spectral decomposition

Since we have removed the null space components of A~\widetilde{A}, let

Hr:=null⁡(A~)⊥=range⁡(A~)‾(27)\mathcal{H}_r := \operatorname{null}(\widetilde{A})^\perp= \overline{\operatorname{range}(\widetilde{A})} \tag*{(27)}

be the propagating subspace. We denote by

A:=A~∣D(A~)∩Hr(28)A := \left.\widetilde{A}\right|_{D(\widetilde{A})\cap\mathcal{H}_r} \tag*{(28)}

the restriction of the Maxwell operator to this subspace. The operator AA is skew-adjoint on the projected range space. Hence −A2-A^2 is positive self-adjoint. Under the Maxwell compactness property for the chosen realization, the operator −A2-A^2 has compact resolvent on Hr\mathcal{H}_r; see, e.g., [23]. Therefore there exists an orthonormal basis (ϕj)j≥1(\phi_j)_{j\ge1} of the considered space and a sequence of strictly positive eigenvalues (λj)j≥1(\lambda_j)_{j\ge1}, possibly with multiplicity, such that

−A2ϕj=λjϕj,λj>0,λj→∞.(29)-A^2\phi_j=\lambda_j\phi_j,\qquad\lambda_j>0,\qquad\lambda_j\to\infty. \tag*{(29)}

We then define

ψj:=Aϕjλj.(30)\psi_j:=\frac{A\phi_j}{\sqrt{\lambda_j}}. \tag*{(30)}

It follows that for each j≥1j\ge1, the pair (ϕj,ψj)(\phi_j,\psi_j) spans a two-dimensional invariant subspace of AA, and satisfies

Aϕj=λj ψj,Aψj=−λj ϕj.(31)A\phi_j=\sqrt{\lambda_j}\,\psi_j,\qquad A\psi_j=-\sqrt{\lambda_j}\,\phi_j. \tag*{(31)}

In the case of multiple eigenvalues, the construction is understood within each eigenspace. For the full proof, we refer to Appendix § 9.§ 6.

For initial data expanded in the ϕj\phi_j components,

v0(x)=∑j≥1αjϕj(x),v_0(x)=\sum_{j\ge1}\alpha_j\phi_j(x),

the solution to the homogeneous problem

(A+∂∂t)v(t,x)=0(32)\left(A+\frac{\partial}{\partial t}\right)v(t,x)=0 \tag*{(32)}

is

v(t,x)=∑j≥1αj(cos⁡(λjt)ϕj(x)−sin⁡(λjt)ψj(x)),(33)v(t,x)=\sum_{j\ge1}\alpha_j\left(\cos(\sqrt{\lambda_j}t)\phi_j(x)-\sin(\sqrt{\lambda_j}t)\psi_j(x)\right), \tag*{(33)}

where

αj=∫Ωϕj(x)Tv0(x) dx.(34)\alpha_j=\int_{\Omega}\phi_j(x)^{\mathsf T}v_0(x)\,\mathrm{d}x. \tag*{(34)}

We now return to the forced problem. The solution U(s,p)\mathsf{U}^{(s,p)} can be written as a convolution in time between the source term and the homogeneous propagator. In the same spirit as in [11], this can be interpreted as mapping the source excitation to an effective initial condition.

Remark. Since A\mathsf{A} is skew-adjoint on the projected range space, −A2-\mathsf{A}^2 is positive self-adjoint. We therefore define the source filter through the functional calculus of the positive operator Λ=(−A2)1/2\Lambda=(-\mathsf{A}^2)^{1/2}, rather than through A\mathsf{A} itself.

More precisely, we write

U(s,p)(t,x)=∣f^(Λ)∣v(s,p)(t,x),Λ=(−A2)1/2,(35)\mathsf{U}^{(s,p)}(t,x)=\left|\widehat{f}(\Lambda)\right|v^{(s,p)}(t,x),\qquad\Lambda=(-\mathsf{A}^2)^{1/2}, \tag*{(35)}

where

v(s,p)(t,x):=e−tAv0(s,p)(x)(36)v^{(s,p)}(t,x):=e^{-t\mathsf{A}}v_0^{(s,p)}(x) \tag*{(36)}

solves the homogeneous problem. Equivalently, using the spectral decomposition of −A2-\mathsf{A}^2,

U(s,p)(t,x)=∑j≥1∣f^(λj)∣αj(s,p)[cos⁡(λjt)ϕj(x)−sin⁡(λjt)ψj(x)],(37)\mathsf{U}^{(s,p)}(t,x)=\sum_{j\geq1}\left|\widehat{f}(\sqrt{\lambda_j})\right|\alpha_j^{(s,p)}\left[\cos(\sqrt{\lambda_j}t)\phi_j(x)-\sin(\sqrt{\lambda_j}t)\psi_j(x)\right], \tag*{(37)}

with

αj(s,p)=∫Ωϕj(x′)TF(s)(x′)e~p dx′.(38)\alpha_j^{(s,p)}=\int_{\Omega}\phi_j(x')^{\mathsf T}\mathbf{F}^{(s)}(x')\widetilde{e}_p\,\mathrm{d}x'. \tag*{(38)}

Remark. Since A\mathsf{A} is skew-adjoint, Stone’s theorem implies that A\mathsf{A} generates a strongly continuous unitary group (e−tA)t∈R(e^{-t\mathsf{A}})_{t\in\mathbb{R}}. Thus, the notation e−tAv0e^{-t\mathsf{A}}v_0 is understood in this semigroup sense. On each two-dimensional invariant subspace associated with an eigenfunction of −A2-\mathsf{A}^2, this unitary evolution is represented by (33).

Remark. The representation (35) should be understood as the source-filtered formulation used in the ROM construction, following the data transformation in [11]. It is not meant as a pointwise identity for the raw causal field before processing. Rather, after the source filtering and time symmetrization of the measured response, the probing pulse is represented by the positive spectral multiplier ∣f^(Λ)∣\left|\widehat{f}(\Lambda)\right|, while v(s,p)v^{(s,p)} denotes the corresponding homogeneous evolution.

The effective initial condition is

v0(s,p)(x):=∑j≥1[∫Ωϕj(x′)TF(s)(x′)e~p dx′]ϕj(x).(39)v_0^{(s,p)}(x):=\sum_{j\geq1}\left[\int_{\Omega}\phi_j(x')^{\mathsf T}\mathbf{F}^{(s)}(x')\widetilde{e}_p\,\mathrm{d}x'\right]\phi_j(x). \tag*{(39)}

Following the data transformation in [11], we now work with the processed array response, obtained from the measured response by source filtering and time symmetrization. This transformation absorbs the effect of the probing pulse into the effective initial condition and allows the data to be written as inner products of homogeneous wave fields. We denote the transformed data matrix by D(t)\mathsf{D}(t):

D(s′,p′),(s,p)(t):=e~pT∫ΩF(s′)(x)U(s,p)(t,x) dx.(40)\mathsf{D}^{(s',p'),(s,p)}(t):=\widetilde{e}_p^{\mathsf T}\int_{\Omega}\mathbf{F}^{(s')}(x)\mathsf{U}^{(s,p)}(t,x)\,\mathrm{d}x. \tag*{(40)}

With the above definition, the transformed data satisfy

D(s′,p′),(s,p)(t)=∫Ω[v0(s′,p′)(x)]Tv(s,p)(t,x) dx.(41)\mathsf{D}^{(s',p'),(s,p)}(t)=\int_{\Omega}\left[v_0^{(s',p')}(x)\right]^{\mathsf T}v^{(s,p)}(t,x)\,\mathrm{d}x. \tag*{(41)}

This data transformation follows the ROM framework developed for wave-based inverse scattering in [4, 5, 7, 8, 10].

ROM formulation

ROM formulation

The reduced-order modeling framework used here follows the general approach developed in [11].

Wave snapshots

We are interested in the evolution of the wave fields (36) on a uniform time grid given by

{tj=jτ, j≥0},\{t_j = j\tau,\ j \ge0\},

where the step is chosen according to the Nyquist criterion τ≲πω0\tau\lesssim\frac{\pi}{\omega_0}. In order to ease the notation, we define the 6×6m6 \times6m dimensional fields vjv_j, called the wave snapshot at time tjt_j, given by

vj(x)=(v(1,1)(tj,x),…,v(1,6)(tj,x),…,v(m,1)(tj,x),…,v(m,6)(tj,x)).(42)v_j(x) = \left(v^{(1,1)}(t_j,x),\ldots,v^{(1,6)}(t_j,x),\ldots,v^{(m,1)}(t_j,x),\ldots,v^{(m,6)}(t_j,x)\right). \tag*{(42)}

Since AA is skew-adjoint on the propagating subspace, Stone’s theorem implies that it generates a unitary group (e−tA)t∈R(e^{-tA})_{t\in\mathbb{R}}. Hence, from (36),

vj(x)=e−jτAv0(x),(43)v_j(x) = e^{-j\tau A}v_0(x), \tag*{(43)}

for x∈Ωx \in\Omega and j≥0j \ge0. In particular, we know that

e(j+1)α=eαejα,e^{(j+1)\alpha} = e^\alpha e^{j\alpha},

for α∈C\alpha\in\mathbb{C}. Thus, we obtain

vj+1(x)=Pvj(x),j≥0,x∈Ω,(44)v_{j+1}(x) = \mathcal{P}v_j(x),\quad j \ge0,\quad x \in\Omega, \tag*{(44)}

where P\mathcal{P} is the propagator operator, given by

P=e−τA.(45)\mathcal{P} = e^{-\tau A}. \tag*{(45)}

Thus, (44) defines a discrete-time dynamical system with initial state v0v_0.

The ROM is an algebraic discrete dynamical system, obtained via the Galerkin projection of (44) on the space

S:=span⁡{V(x)},V(x)=(v0(x),…,vn−1(x)),x∈Ω.(46)\mathcal{S} := \operatorname{span}\{\mathcal{V}(x)\},\quad\mathcal{V}(x) = \left(v_0(x),\ldots,v_{n-1}(x)\right),\quad x \in\Omega. \tag*{(46)}

The end time index nn is chosen according to the distance from the array at which we wish to image. If the characteristic length of the medium is LL, then we should have nc0τ≳2Lnc_0\tau\gtrsim2L. This construction is standard in data-driven ROM approaches based on wave snapshots and Galerkin projections [11].

Remark. The condition nc0τ≳2Lnc_0\tau\gtrsim2L ensures that the observation time window is sufficiently long for waves to propagate across the medium and return to the array. In particular, this guarantees that the collected snapshots contain information about reflections from the entire domain. If this condition is not satisfied, deeper parts of the medium are not adequately probed and the resulting reduced-order model may fail to capture the relevant wave interactions.

Data-driven ROM

The Galerkin approximation of (43) is defined by

vjGal(x)=V(x)gj,j≥0,x∈Ω,(47)v_j^{\mathrm{Gal}}(x) = \mathcal{V}(x)g_j,\quad j \ge0,\quad x \in\Omega, \tag*{(47)}

where gj∈R6mn×6mg_j \in\mathbb{R}^{6mn\times6m} are the Galerkin coefficients, calculated so that when substituting (47) in (44), the residual is orthogonal to the space S\mathcal{S}.

In order to obtain the Galerkin equation, we use an orthonormal basis Z(x)\mathcal{Z}(x), given by

Z(x)=(z0(x),…,zn−1(x)),\mathcal{Z}(x) = \left(z_0(x),\ldots,z_{n-1}(x)\right),

The ROM

whose components satisfy

∫ΩzjT(x)zk(x) dx=I6mδjk,j,k=0,…,n−1.(48)\int_{\Omega} z_j^{\mathsf{T}}(x)z_k(x)\,\mathrm{d}x = I_{6m}\delta_{jk}, \qquad j,k=0,\ldots,n-1. \tag*{(48)}

Since our basis is causal, we have

zj(x)∈span⁡{v0(x),…,vj(x)},j=0,…,n−1.(49)z_j(x) \in\operatorname{span}\{v_0(x),\ldots,v_j(x)\}, \qquad j=0,\ldots,n-1. \tag*{(49)}

Explicitly, Z\mathcal{Z} is defined via the Gram-Schmidt orthogonalisation of V\mathcal{V}, i.e.

V(x)=Z(x)R,x∈Ω,(50)\mathcal{V}(x)=\mathcal{Z}(x)R,\qquad x\in\Omega, \tag*{(50)}

where RR is block upper triangular.

The equation for the Galerkin coefficients can now be written as

0=∫ΩZT(x)[V(x)gj+1−PV(x)gj] dx=R−T[Mgj+1−Sgj],j≥0,(51)\begin{aligned} 0 &= \int_{\Omega}\mathcal{Z}^{\mathsf{T}}(x)\left[\mathcal{V}(x)g_{j+1}-\mathcal{P}\mathcal{V}(x)g_j\right]\,\mathrm{d}x \\ &= R^{-\mathsf{T}}\left[Mg_{j+1}-Sg_j\right],\qquad j\geq0, \tag*{(51)} \end{aligned}

with initial condition

g0=i0 such that v0Gal(x)=v0(x),x∈Ω,(52)g_0=i_0\ \text{such that}\ v_0^{\mathrm{Gal}}(x)=v_0(x),\qquad x\in\Omega, \tag*{(52)}

where we have introduced the mass matrix MM, given by

M:=∫ΩVT(x)V(x) dx∈R6nm×6nm,(53)M:=\int_{\Omega}\mathcal{V}^{\mathsf{T}}(x)\mathcal{V}(x)\,\mathrm{d}x\in\mathbb{R}^{6nm\times6nm}, \tag*{(53)}

and the stiffness matrix SS, given by

S:=∫ΩVT(x)PV(x) dx∈R6nm×6nm,(54)S:=\int_{\Omega}\mathcal{V}^{\mathsf{T}}(x)\mathcal{P}\mathcal{V}(x)\,\mathrm{d}x\in\mathbb{R}^{6nm\times6nm}, \tag*{(54)}

of the Galerkin scheme. This construction is the standard data-driven ROM construction based on snapshot Gram matrices; see, for example, [5, 7, 15, 16]. The following results hold for the mass and stiffness matrices.

Lemma 2.5. It can be shown that

M=RTR(55)M=R^{\mathsf{T}}R \tag*{(55)}

and that the first nn Galerkin coefficients are the 6nm×6m6nm\times6m block columns of I6nmI_{6nm},

gj=ij,j=0,…,n−1,(56)g_j=i_j,\qquad j=0,\ldots,n-1, \tag*{(56)}

where iji_j denotes the jj-th block column of I6mnI_{6mn}.

Proof. The proof follows the same logic as in [11].

Lemma 2.6. We can show that both the mass and the stiffness matrix are data driven, i.e.

Mj,l={D(tl−j),0≤j≤l≤n−1,D(tj−l)T,0≤l≤j≤n−1(57)M_{j,l}= \begin{cases} \mathbb{D}(t_{l-j}), & 0\leq j\leq l\leq n-1,\\ \mathbb{D}(t_{j-l})^{\mathsf{T}}, & 0\leq l\leq j\leq n-1 \end{cases} \tag*{(57)}

and

Sj,l={D(tl+1−j),0≤j≤l≤n−1,D(tj−1−l)T,0≤l≤j−1, with j=2,…,n−1.(58)S_{j,l}= \begin{cases} \mathbb{D}(t_{l+1-j}), & 0\leq j\leq l\leq n-1,\\ \mathbb{D}(t_{j-1-l})^{\mathsf{T}}, & 0\leq l\leq j-1,\ \text{with }j=2,\ldots,n-1. \end{cases} \tag*{(58)}

Proof. See Appendix § 9.§ 7.

These identities show that the ROM can be constructed directly from the data, a key feature of the approach introduced in [10].

The ROM

We define the ROM to be the discrete time analog of (44), with states

vjROM=Rgj,j≥0,(59)v_j^{\mathrm{ROM}} = R g_j,\quad j \ge0, \tag*{(59)}

called the ROM snapshots. The first nn such snapshots are the 6nm×6m6nm \times6m block columns of RR, as follows from (56),

(v0ROM,…,vn−1ROM)=R.(60)\left(v_0^{\mathrm{ROM}},\ldots,v_{n-1}^{\mathrm{ROM}}\right)=R. \tag*{(60)}

Theorem 2.7. The ROM snapshots evolve as follows

vj+1ROM=PROMvjROM,(61)v_{j+1}^{\mathrm{ROM}}=\mathcal{P}^{\mathrm{ROM}}v_j^{\mathrm{ROM}}, \tag*{(61)}

where

PROM:=R−TSR−1(62)\mathcal{P}^{\mathrm{ROM}}:=R^{-\mathsf{T}}\mathbf{S}R^{-1} \tag*{(62)}

is the 6nm×6nm6nm \times6nm ROM propagator matrix.

Proof. In order to obtain this, we see from (51) that

0=R−T[Mgj+1−Sgj]⇒R−TMgj+1=R−TSgj0=R^{-\mathsf{T}}\left[\mathbf{M}g_{j+1}-\mathbf{S}g_j\right]\Rightarrow R^{-\mathsf{T}}\mathbf{M}g_{j+1}=R^{-\mathsf{T}}\mathbf{S}g_j

and applying (55), we get

Rgj+1=R−TSgj⇒vj+1ROM=R−TSR−1Rgj⇒vj+1ROM=R−TSR−1vjROM=:PROMvjROM,\begin{aligned} Rg_{j+1}=R^{-\mathsf{T}}\mathbf{S}g_j\Rightarrow v_{j+1}^{\mathrm{ROM}}=R^{-\mathsf{T}}\mathbf{S}R^{-1}Rg_j \\ &\Rightarrow v_{j+1}^{\mathrm{ROM}}=R^{-\mathsf{T}}\mathbf{S}R^{-1}v_j^{\mathrm{ROM}}=:\mathcal{P}^{\mathrm{ROM}}v_j^{\mathrm{ROM}}, \end{aligned}

which gives the desired result. □

Remark. From (57) and (58), we see that both RR and M\mathbf{M} are data driven and so, the ROM can be computed directly from D(tj)\mathbb{D}(t_j), for j=0,…,nj=0,\ldots,n.

Reduction to scalar wave equation

In this section, we show how the full three-dimensional Maxwell system introduced in § 2 can be reduced to a one-dimensional scalar wave equation under appropriate assumptions on the geometry and polarization of the fields. This reduction provides the connection between the electromagnetic formulation and the one-dimensional layered media model considered later in this work.

In the reduced-order modeling framework introduced in § 2, the effect of the source term can be incorporated into an equivalent initial condition using a Duhamel-type representation. Consequently, in the following, we consider the homogeneous Maxwell system

(∂t+A)U=0,(63)(\partial_t+A)\mathbf{U}=0, \tag*{(63)}

with initial data determined by the excitation. This allows us to focus on the propagation properties of the wave field.

Let Ω⊂R3\Omega\subset\mathbb{R}^3. In this section we specialize to a layered isotropic medium, with scalar coefficients depending only on one spatial variable:

ε(x)=ε(x1),μ(x)=μ(x1).(64)\varepsilon(x)=\varepsilon(x_1),\qquad\mu(x)=\mu(x_1). \tag*{(64)}

This corresponds to a medium composed of planar layers orthogonal to the x1x_1-axis. We further consider transverse electromagnetic fields that depend only on x1x_1 and are polarized orthogonally to the direction of variation:

E(t,x)=(0E2(t,x1)0),B(t,x)=(00B3(t,x1)).(65)\mathbf{E}(t,x)= \begin{pmatrix} 0\\ E_2(t,x_1)\\ 0 \end{pmatrix}, \qquad \mathbf{B}(t,x)= \begin{pmatrix} 0\\ 0\\ B_3(t,x_1) \end{pmatrix}. \tag*{(65)}

One-dimensional layered media

Theorem 3.1. Under the assumptions (64)–(65), the source-free Maxwell equations (1) reduce to the one-dimensional first-order system

{∂B3∂t=−∂E2∂x1,ε(x1)∂E2∂t=−∂∂x1(μ(x1)−1B3).(66)\begin{cases} \frac{\partial B_3}{\partial t}=-\frac{\partial E_2}{\partial x_1},\\ \varepsilon(x_1)\frac{\partial E_2}{\partial t}=-\frac{\partial}{\partial x_1}\left(\mu(x_1)^{-1}B_3\right). \tag*{(66)} \end{cases}

Consequently, E2E_2 satisfies the scalar wave equation in divergence form

ε(x1)∂2E2∂t2−∂∂x1(μ(x1)−1∂E2∂x1)=0.(67)\varepsilon(x_1)\frac{\partial^2 E_2}{\partial t^2}-\frac{\partial}{\partial x_1}\left(\mu(x_1)^{-1}\frac{\partial E_2}{\partial x_1}\right)=0. \tag*{(67)}

Equivalently,

∂2E2∂t2−ε(x1)−1∂∂x1(μ(x1)−1∂E2∂x1)=0.(68)\frac{\partial^2 E_2}{\partial t^2}-\varepsilon(x_1)^{-1}\frac{\partial}{\partial x_1}\left(\mu(x_1)^{-1}\frac{\partial E_2}{\partial x_1}\right)=0. \tag*{(68)}

The magnetic flux component satisfies

∂2B3∂t2=∂∂x1[ε(x1)−1∂∂x1(μ(x1)−1B3)].(69)\frac{\partial^2 B_3}{\partial t^2}=\frac{\partial}{\partial x_1}\left[\varepsilon(x_1)^{-1}\frac{\partial}{\partial x_1}\left(\mu(x_1)^{-1}B_3\right)\right]. \tag*{(69)}

In a layer where ε\varepsilon and μ\mu are constant, (67) reduces to

∂2E2∂t2−c(x1)2∂2E2∂x12=0,c(x1)=1ε(x1)μ(x1).(70)\frac{\partial^2 E_2}{\partial t^2}-c(x_1)^2\frac{\partial^2 E_2}{\partial x_1^2}=0,\qquad c(x_1)=\frac{1}{\sqrt{\varepsilon(x_1)\mu(x_1)}}. \tag*{(70)}

Proof. See Appendix B.1.

Assuming time-harmonic solutions of the form

E2(t,x1)=u(x1)e−iωt,E_2(t,x_1)=u(x_1)e^{-i\omega t},

we obtain the one-dimensional Helmholtz equation

ddx1(μ(x1)−1dudx1)+ω2ε(x1)u=0.(71)\frac{\mathrm{d}}{\mathrm{d}x_1}\left(\mu(x_1)^{-1}\frac{\mathrm{d}u}{\mathrm{d}x_1}\right)+\omega^2\varepsilon(x_1)u=0. \tag*{(71)}

Inside a homogeneous layer, where ε\varepsilon and μ\mu are constant, this becomes

d2udx12+ω2μ(x1)ε(x1)u=0,(72)\frac{\mathrm{d}^2u}{\mathrm{d}x_1^2}+\omega^2\mu(x_1)\varepsilon(x_1)u=0, \tag*{(72)}

or equivalently

d2udx12+ω2c(x1)2u=0.(73)\frac{\mathrm{d}^2u}{\mathrm{d}x_1^2}+\frac{\omega^2}{c(x_1)^2}u=0. \tag*{(73)}

This reduction leads to the class of one-dimensional layered media, where the wave speed is piecewise constant:

c(x1)=ck,x1∈(zk,zk+1),k∈Z.(74)c(x_1)=c_k,\qquad x_1\in(z_k,z_{k+1}),\qquad k\in\mathbb{Z}. \tag*{(74)}

At interfaces, the Maxwell transmission conditions correspond to continuity of the tangential electric field and of the tangential magnetic field. In the scalar formulation, this gives continuity of uu and of μ−1u′\mu^{-1}u' across interfaces. In each layer, the scalar wave equation admits explicit solutions, with reflection and transmission generated by these interface conditions. A particularly important example is the Goupillaud medium, in which layer thicknesses are proportional to the local wave speed. This model provides a convenient framework for both analytical calculations and numerical simulations.

One-dimensional layered media

Layered media provide a classical setting in which multiple scattering and wave reflections can be described explicitly [19]. Related reduced-order approaches in layered media include [6]. In § 3, we showed that, under suitable assumptions on the polarization and spatial variability of the fields, Maxwell’s equations reduce to a one-dimensional scalar wave equation with variable electromagnetic coefficients. We now specialize this reduced Maxwell model to layered media and introduce an electromagnetic analogue of the Goupillaud construction. The goal is to obtain a benchmark in which propagation, reflection, transmission and multiple scattering are represented explicitly, while remaining directly connected to the electromagnetic formulation.

The classical Goupillaud model is formulated for acoustic waves in layered media. Here we adapt the same idea to the reduced Maxwell setting by working with electromagnetic impedance variables and imposing an equal travel-time condition across layers. In these variables, the right- and left-going wave amplitudes satisfy explicit interface scattering relations, and the equal travel-time assumption leads to an exact discrete-time propagation model. Thus, the model considered below should be understood as a Maxwell-adapted Goupillaud medium: it preserves the ROM-relevant mechanisms of two-way propagation, reflection and transmission at interfaces, multiple scattering, and data-driven reduced dynamics.

Layered medium and wave propagation

We consider the scalar wave equation obtained in § 3, written here in the form

∂2∂t2u(t,z)−c(z)2∂2∂z2u(t,z)=0,(75)\frac{\partial^{2}}{\partial t^{2}}u(t,z)-c(z)^{2}\frac{\partial^{2}}{\partial z^{2}}u(t,z)=0, \tag*{(75)}

where the wave speed c(z)c(z) is piecewise constant. This corresponds to a layered medium composed of layers in which the physical parameters are constant. To make the connection with the underlying physical model explicit, we recall that this equation can be derived from the one-dimensional acoustic system

{ρ(z)∂tu+∂zp=0,1K(z)∂tp+∂zu=0,(76)\begin{cases} \rho(z)\partial_t u+\partial_z p=0,\\ \frac{1}{K(z)}\partial_t p+\partial_z u=0, \tag*{(76)} \end{cases}

where ρ(z)\rho(z) is the density and K(z)K(z) the bulk modulus. The wave speed and impedance are given by

c(z)=K(z)ρ(z)andζ(z)=K(z)ρ(z).(77)c(z)=\sqrt{\frac{K(z)}{\rho(z)}}\quad\text{and}\quad\zeta(z)=\sqrt{K(z)\rho(z)}. \tag*{(77)}

In particular, we observe for the impedance ζ(⋅)\zeta(\cdot) that it can be written as follows:

ζ(z)=c(z)ρ(z)(78)\zeta(z)=c(z)\rho(z) \tag*{(78)}

Introducing the right- and left-going modes

A(t,z)=ζ(z)−1/2p(t,z)+ζ(z)1/2u(t,z),B(t,z)=−ζ(z)−1/2p(t,z)+ζ(z)1/2u(t,z),(79)\begin{aligned} A(t,z)&=\zeta(z)^{-1/2}p(t,z)+\zeta(z)^{1/2}u(t,z),\\ B(t,z)&=-\zeta(z)^{-1/2}p(t,z)+\zeta(z)^{1/2}u(t,z), \tag*{(79)} \end{aligned}

we obtain the transport equations

∂zA(t,z)+1c(z)∂tA(t,z)=0and∂zB(t,z)−1c(z)∂tB(t,z)=0.(80)\partial_z A(t,z)+\frac{1}{c(z)}\partial_t A(t,z)=0\quad\text{and}\quad\partial_z B(t,z)-\frac{1}{c(z)}\partial_t B(t,z)=0. \tag*{(80)}

In addition, since our medium is composed of nn layers, we have that

c(z)=ckandζ(z)=ζk=ρkck,z∈(zk−1,zk)(81)c(z)=c_k\quad\text{and}\quad\zeta(z)=\zeta_k=\rho_kc_k,\quad z\in(z_{k-1},z_k) \tag*{(81)}

and so, we can write the solutions of the wave equation (75) in the following form:

uk(t,z)=Ak(t−zck)+Bk(t+zck),(82)u_k(t,z)=A_k\left(t-\frac{z}{c_k}\right)+B_k\left(t+\frac{z}{c_k}\right), \tag*{(82)}

where AkA_k represents right-going waves and BkB_k represents left-going waves, as described in (79), for k=1,2,…,nk = 1, 2, \ldots, n. At each interface x=xkx = x_k, continuity conditions give rise to reflection and transmission of the right- and left-going waves. In the impedance-normalized variables used here, the corresponding coefficients are

Rk=ζk−ζk+1ζk+ζk+1andTk=2ζkζk+1ζk+ζk+1.(83)R_k = \frac{\zeta_k-\zeta_{k+1}}{\zeta_k+\zeta_{k+1}} \qquad\text{and}\qquad T_k = \frac{2\sqrt{\zeta_k\zeta_{k+1}}}{\zeta_k+\zeta_{k+1}}. \tag*{(83)}

for k=1,2,…,nk = 1, 2, \ldots, n.

Goupillaud medium

We now introduce a particular class of layered media, known as Goupillaud media, defined by the condition that each layer has the same travel time:

Lj−Lj−1cj=τ,for all j.(84)\frac{L_j-L_{j-1}}{c_j} = \tau,\qquad\text{for all }j. \tag*{(84)}

This assumption plays a crucial role as it implies that waves propagate from one interface to the next in a fixed time τ>0\tau> 0. As a consequence, scattering events occur only at discrete times t=kτt = k\tau, k∈Nk \in\mathbb{N}, which induces a natural discrete-time dynamical system. Between these discrete times, the right- and left-going waves propagate freely, while reflections and transmissions occur instantaneously at the interfaces. The wave field at time t=kτt = k\tau can therefore be written as

vk(z)=∑j=0N(Ajk+Bjk)δ(z−Lj),(85)v_k(z) = \sum_{j=0}^{N}\left(A_j^k+B_j^k\right)\delta(z-L_j), \tag*{(85)}

where AjkA_j^k and BjkB_j^k represent the amplitudes of right- and left-going waves at interface LjL_j. These amplitudes satisfy the recurrence relation

\begin{pmatrix} A_j^{k+1}\\ B_j^{k+1} \end{pmatrix} = \begin{pmatrix} T_j & -R_j\\ R_j & T_j \end{pmatrix} \begin{pmatrix} A_{j-1}^{k}\\ B_{j+1}^{k} \end{pmatrix}, \tag*{(86)}\end{pmatrix}

where RjR_j and TjT_j are the reflection and transmission coefficients.

Connection to ROM formulation

We consider measurements of the wave field at discrete times t=kτt = k\tau. The sequence of states (vk)k=1n(v_k)_{k=1}^{n} defines a collection of snapshots of the system. The observed data are given by

D(kτ)=⟨v0,vk⟩,(87)D(k\tau) = \langle v_0,v_k\rangle, \tag*{(87)}

as also described by (41), which depends on the reflection and transmission coefficients through multiple scattering interactions. Each data point corresponds to a superposition of contributions associated with different scattering paths. The discrete evolution of the wave field takes the form

vk+1=Pvk,(88)v_{k+1} = \mathcal{P}v_k, \tag*{(88)}

where P\mathcal{P} is the propagator over one time step. This structure matches exactly the reduced-order modeling framework introduced in § 2. In particular, from Lemma 2.6, we see that the reduced-order model can be constructed directly from the observed data.

This explicit connection between wave propagation, discrete dynamics, and data-driven reduced-order modeling makes the layered medium an ideal test case for analyzing the stability and performance of ROM-based inversion methods.

Inverse problem and objective functions

We now turn to the inverse problem associated with the layered medium. The goal is to recover the impedance profile

ζ=(ζ1,ζ2,…,ζn)(89)\zeta= (\zeta_1,\zeta_2,\ldots,\zeta_n) \tag*{(89)}

from measurements of the reflected wave.

Forward map

As described above, the wave propagation through the layered medium gives rise to a sequence of observations

Dk=D(kτ)=⟨v0,vk⟩(90)\mathbb{D}_k = \mathbb{D}(k\tau) = \langle v_0,v_k\rangle \tag*{(90)}

which depend on the impedance parameters through multiple scattering effects. This defines a nonlinear forward map

ζ↦D(ζ).(91)\zeta\mapsto\mathbb{D}(\zeta). \tag*{(91)}

This map is highly nonlinear since the waves interact with multiple interfaces, which lead to products of reflection and transmission coefficients.

A natural approach consists of minimizing the difference between modeled and observed data:

OFWI(ζ~)=τ∑k=1n−1∥D(kτ;ζ)−D(kτ;ζ~)∥2.(92)\mathcal{O}^{\mathrm{FWI}}(\widetilde{\zeta}) = \tau\sum_{k=1}^{n-1} \left\lVert\mathbb{D}(k\tau;\zeta)-\mathbb{D}(k\tau;\widetilde{\zeta})\right\rVert^2. \tag*{(92)}

This objective directly compares the data in the observation space. However, it is sensitive to amplitude errors and scaling effects, which may arise from modeling inaccuracies or measurement noise.

Remark. The quadratic data misfit OFWI\mathcal{O}^{\mathrm{FWI}} can be interpreted in a Bayesian framework as a maximum a posteriori estimator under the assumption of additive white Gaussian noise on the data. In this setting, minimizing the L2L^2 discrepancy between observed and modeled data is statistically optimal. This observation explains why the classical misfit is expected to perform well when the perturbations are predominantly unstructured and additive.

Inverse problem

We formulate the inverse problem as an optimization problem. Given observed data corresponding to an unknown impedance profile ζ~\widetilde{\zeta}, we seek to recover ζ\zeta by solving

min⁡ζ∈ZO(ζ)+regularization.(93)\min_{\zeta\in\mathcal{Z}} \mathcal{O}(\zeta) + \text{regularization}. \tag*{(93)}

Following the reduced-order modeling framework, the inversion can be formulated in terms of the internal wavefield. Denoting by vk(ζ)v_k(\zeta) the true wavefield snapshots and by vkest(ζ)v_k^{\mathrm{est}}(\zeta) their ROM-based reconstruction, we define the objective

O(ζ)=∑k=0nt−1∥vkest(ζ)−vk(ζ)∥F2.(94)\mathcal{O}(\zeta) = \sum_{k=0}^{n_t-1} \left\lVert v_k^{\mathrm{est}}(\zeta)-v_k(\zeta)\right\rVert_F^2. \tag*{(94)}

As in the general ROM framework, this objective can be expressed in terms of a reduced operator. In particular, one obtains

O(ζ)=∥R−R(ζ)∥F2,(95)\mathcal{O}(\zeta) = \left\lVert R-R(\zeta)\right\rVert_F^2, \tag*{(95)}

where RR is the reduced operator constructed from the observed data and R(ζ)R(\zeta) is the one associated with the model.

This normalized operator comparison is motivated by ROM-based waveform inversion methods, where the inverse problem is reformulated at the level of reduced propagators or reduced operators rather than directly at the level of the measured traces [5, 7, 8, 9, 10]. Instead of directly minimizing O\mathcal{O}, we consider the modified objective

min⁡ζ∈ZOROM(ζ)+regularization,(96)\min_{\zeta\in\mathcal{Z}} \mathcal{O}^{\mathrm{ROM}}(\zeta) + \text{regularization}, \tag*{(96)}

where

OROM(ζ):=∥R(ζ)R−1−I2nm∥F2.(97)\mathcal{O}^{\mathrm{ROM}}(\zeta) := \left\|R(\zeta)R^{-1}-I_{2nm}\right\|_{F}^{2}. \tag*{(97)}

Remark. The objective O\mathcal{O} measures discrepancies between reconstructed and true internal wavefields through their reduced representation, while OROM\mathcal{O}^{\mathrm{ROM}} compares the associated reduced operators. The latter formulation removes global scaling effects and leads to improved stability properties, as will be demonstrated in the numerical experiments.

Numerical protocol and stability metrics

We now describe the numerical protocol used to compare the direct data misfit and the ROM-based objective. The goal of this section is to specify the benchmark medium, the perturbation models and the evaluation metrics before presenting the numerical results in § 7. Further implementation details, including the exact construction of the data vector, the ROM matrix and the perturbation grids, are given in Appendix § 11.

Benchmark configuration

All numerical experiments are performed on a five-layer Goupillaud medium. The reference impedance vector is

ζ⋆=(1,2,4,8,10,12).(98)\zeta^\star= (1,2,4,8,10,12). \tag*{(98)}

The exterior impedance ζ0=1\zeta_0=1 is kept fixed, and the unknown parameter is

θ=(ζ1,…,ζ5).(99)\theta= (\zeta_1,\ldots,\zeta_5). \tag*{(99)}

For each impedance vector ζ\zeta, the Goupillaud recurrence generates a discrete data vector

D(ζ)=(D0,D1,…,D8),(100)D(\zeta) = (D_0,D_1,\ldots,D_8), \tag*{(100)}

where the odd entries vanish by the parity structure of the model. The corresponding ROM matrix is denoted by R(ζ)R(\zeta).

Compared inversion objectives

We compare two inversion strategies. The first one is the direct data misfit

OFWI(ζ)=τ∥D(ζ)−Dobs∥22.(101)\mathcal{O}^{\mathrm{FWI}}(\zeta) = \tau\left\|D(\zeta)-D^{\mathrm{obs}}\right\|_2^2. \tag*{(101)}

The second one is the normalized ROM objective

OROM(ζ)=∥R(ζ)R(ζref)α†−I5∥F2,(102)\mathcal{O}^{\mathrm{ROM}}(\zeta) = \left\|R(\zeta)R(\zeta_{\mathrm{ref}})_{\alpha}^{\dagger}-I_5\right\|_F^2, \tag*{(102)}

where, since RR is rectangular, we use the Tikhonov-regularized right inverse

Rα†:=RT(RRT+αI)−1.(103)R_{\alpha}^{\dagger} := R^{\mathsf{T}}(RR^{\mathsf{T}}+\alpha I)^{-1}. \tag*{(103)}

Here ζref\zeta_{\mathrm{ref}} denotes the reference impedance used to build the ROM normalization. In the clean experiment, this is ζ⋆\zeta^\star and in the layer-perturbation experiment, this is the perturbed medium generating the data. In perturbation models that act directly on the data and may not correspond exactly to an admissible layered medium, an effective reference impedance is first fitted from the perturbed data. The precise numerical construction is described in Appendix § 11. This form is a finite-dimensional analogue of the normalized ROM objectives used in [8, 9, 10].

Perturbation models

We consider several structured perturbation models. These perturbations are intended to represent different sources of uncertainty in either the medium or the measurements.

First, we consider the clean inverse problem, where the observed data are generated exactly from ζ⋆\zeta^\star. This experiment isolates the effect of the optimization landscape, without any additional perturbation.

Second, we perturb the layer impedances themselves. In this case, the perturbed medium is the actual ground truth for the trial, and the goal is to recover this perturbed layered structure.

Third, we consider perturbations acting directly on the data. These include multiplicative data noise, propagation-speed uncertainty, receiver-position errors and systematic acquisition errors. Propagation-speed uncertainty and receiver-position errors are modeled as structured perturbations whose effect can grow with the arrival time. Systematic errors include global gain errors, additive bias and time-origin shifts.

The purpose of these experiments is not to show that the ROM objective is uniformly better for every possible perturbation. Rather, we aim to identify the regimes in which the normalization built into the ROM formulation gives a genuine advantage, and to distinguish them from regimes where the two objectives behave similarly.

Evaluation metrics

For each experiment, we compare the reconstructed impedances obtained from the two objectives. We denote these reconstructions by

ζ^FWI,ζ^ROM.(104)\widehat{\zeta}_{\mathrm{FWI}}, \qquad\widehat{\zeta}_{\mathrm{ROM}}. \tag*{(104)}

The reconstruction error is measured with respect to a comparison impedance ζcomp\zeta_{\mathrm{comp}}:

err⁡FWI=∥ζ^FWI−ζcomp∥2,(105)\operatorname{err}_{\mathrm{FWI}} = \left\lVert\widehat{\zeta}_{\mathrm{FWI}} - \zeta_{\mathrm{comp}} \right\rVert_2, \tag*{(105)}
err⁡ROM=∥ζ^ROM−ζcomp∥2.(106)\operatorname{err}_{\mathrm{ROM}} = \left\lVert\widehat{\zeta}_{\mathrm{ROM}} - \zeta_{\mathrm{comp}} \right\rVert_2. \tag*{(106)}

In the clean experiment, ζcomp=ζ⋆\zeta_{\mathrm{comp}} = \zeta^\star. In the layer-perturbation experiment, ζcomp\zeta_{\mathrm{comp}} is the perturbed medium. For data perturbations, the comparison impedance is chosen according to the procedure described in Appendix § 11.

For each perturbation level, we report the median reconstruction error over the Monte Carlo trials. We also report the win fraction

Win⁡=P(err⁡ROM<err⁡FWI),(107)\operatorname{Win} = \mathbb{P}\left(\operatorname{err}_{\mathrm{ROM}} < \operatorname{err}_{\mathrm{FWI}}\right), \tag*{(107)}

estimated empirically over the trials. A win fraction larger than 0.5 indicates that the ROM-based reconstruction is more accurate than the direct data-misfit reconstruction in a majority of trials.

Numerical results

We now present the numerical results obtained with the protocol described in § 6. We focus on the perturbation regimes that are most informative for comparing the two objectives. The remaining perturbation models are summarized at the end of the section.

Clean inversion

We first consider the unperturbed inverse problem. Both methods are initialized from the same family of random initial guesses and are applied to the exact synthetic data generated by ζ⋆\zeta^\star. Thus, the experiment tests the optimization behavior of the two objectives in the absence of measurement or modeling errors.

In the clean setting, the median reconstruction error is

1.88×10−31.88 \times10^{-3} for the direct data misfit and 1.34×10−41.34 \times10^{-4} for the ROM-based objective.

Thus, the ROM-based objective yields a substantially smaller median reconstruction error than the direct data misfit. Since no perturbation is present in this experiment, this improvement cannot be attributed to noise filtering. It indicates instead that, for this benchmark, the ROM objective has a more favorable numerical landscape for the reconstruction of the impedance profile.

Layer perturbations

We next perturb the layer impedances themselves. In each Monte Carlo trial, the perturbed medium is treated as the ground truth, and both inversion methods are asked to recover it from the corresponding data. This experiment tests robustness with respect to changes in the layered structure, rather than perturbations added only at the measurement level.

Figure 2a. Median reconstruction error.

Figure 2b. Win fraction P(errROM<errFWI)\mathbb{P}(\mathrm{err}_{\mathrm{ROM}} < \mathrm{err}_{\mathrm{FWI}}).

Figure 2. Comparison of the two inversion strategies under simultaneous perturbations of all layers.

Figure 2(a) shows that the ROM-based inversion has a smaller median error over the perturbation levels considered. Figure 2(b) supports the same conclusion: the win fraction remains above 0.5, showing that the ROM reconstruction is more accurate in a majority of trials. This suggests that the ROM normalization is beneficial when the uncertainty acts directly on the layered medium.

Time-origin error

We now consider a systematic time-origin error. This perturbation shifts the temporal alignment of the measured data and therefore affects the organization of the arrivals. It is a structured perturbation rather than an independent random perturbation of each data component.

Figure 3a. Median reconstruction error.

Figure 3b. Win fraction P(errROM<errFWI)\mathbb{P}(\mathrm{err}_{\mathrm{ROM}} < \mathrm{err}_{\mathrm{FWI}}).

As shown in Figure 3, the ROM-based inversion gives smaller median errors over most of the tested range. The win fraction is also frequently well above 0.5. This is one of the clearest regimes in which the ROM objective improves stability. The result is consistent with the fact that the ROM formulation compares normalized reduced operators, and is therefore less sensitive to certain coherent distortions of the data than the direct signal misfit.

Figure 3. Comparison of the two inversion strategies under a time-origin error.

Receiver-position amplitude perturbation

We also consider receiver-position errors modeled as amplitude perturbations of the measured arrivals. This type of perturbation represents errors in coupling or geometric spreading that modify the strength of the recorded signal without explicitly shifting its arrival time.

In Figure 4, the two methods are closer than in the clean and time-origin experiments. The ROM-based inversion still shows a mild advantage for small to moderate perturbations, visible both in the median errors and in the win fraction, but the improvement is less pronounced. This provides an intermediate regime: the ROM objective remains competitive and slightly preferable, but the perturbation does not produce as clear a separation between the two methods.

Image not extracted

Figure 4. Comparison of the two inversion strategies under receiver-position errors modeled as amplitude perturbations.

Perturbations with comparable behavior

We also tested additional structured perturbations, including multiplicative data noise, propagation-speed uncertainty, receiver-position errors modeled as time shifts, constant gain bias and additive bias. In these cases, the two inversion procedures behave comparably. The median errors remain close, and the win fraction typically fluctuates around 0.5, without revealing a persistent dominance of either method.

These experiments are important because they show that the ROM objective is not uniformly superior under all perturbations. Its advantage appears most clearly in the clean inversion, in layer perturbations and in coherent temporal distortions such as the time-origin error. For other perturbation mechanisms, the normalization in the ROM objective does not significantly change the reconstruction accuracy, but it also does not lead to a systematic degradation.

Summary of numerical observations

The numerical experiments support a balanced conclusion. In the clean deterministic inverse problem, the ROM-based objective produces a more favorable reconstruction than the direct data misfit. This advantage persists when the layered medium itself is perturbed, and it is especially visible under time-origin errors, where the perturbation has a coherent temporal structure.

At the same time, the ROM formulation does not dominate the direct data misfit in every perturbation regime. For several structured data perturbations, the two methods perform similarly. Thus, the main conclusion is not that ROM-based inversion is universally better, but that it can provide a clear advantage in regimes where the reduced operator normalization captures the relevant structure of the wave propagation more effectively than a direct comparison of the measured signals.

Conclusion

In this work, we investigated reduced-order modeling for wave-based inverse problems in layered media within the framework of Goupillaud media. This setting provides a natural discrete representation of wave propagation and allows for a direct comparison between classical data misfit and a ROM-based objective defined at the level of reduced operators. In this sense, the numerical study complements the ROM-based inversion program developed in [5, 7, 8, 9, 10], by testing the behavior of a normalized ROM objective in an exactly discretizable layered benchmark.

The numerical experiments highlight a nuanced but consistent picture. In the clean inversion setting, the ROM-based formulation yields a significantly improved reconstruction, indicating a more favorable optimization landscape. This advantage persists in certain structured perturbation regimes, such as perturbations of the layered medium and time-origin errors, where the ROM-based inversion achieves smaller median errors and higher win fractions. These results suggest that the normalization inherent in the ROM formulation is particularly effective in handling global or structurally coherent distortions of the data. At the same time, the ROM-based approach does not uniformly outperform the classical misfit. For several other perturbations, including additive noise and propagation-related distortions, the two methods exhibit comparable performance, with no systematic dominance of either approach. This indicates that the benefit of the ROM formulation depends on the nature of the perturbation and how it interacts with the underlying wave dynamics.

Overall, the results show that reduced-order modeling provides a meaningful and, in some regimes, advantageous alternative to standard inversion approaches. Its strength lies in capturing structural features of the problem that are not directly emphasized by the data misfit, while remaining competitive across a broad range of perturbations.

Proofs of Section 2

Proof of Lemma 2.1

From (1), we have

∂B∂t=−∇×E−Jm(108)\frac{\partial\mathbf{B}}{\partial t}=-\nabla\times\mathbf{E}-\mathbf{J}_m \tag*{(108)}

and

∂E∂t=ε−1∇×(μ−1B)−ε−1Je(109)\frac{\partial\mathbf{E}}{\partial t}=\varepsilon^{-1}\nabla\times\left(\mu^{-1}\mathbf{B}\right)-\varepsilon^{-1}\mathbf{J}_e \tag*{(109)}

Thus, for

U=(EB),\mathbf{U}=\begin{pmatrix}\mathbf{E}\\\mathbf{B}\end{pmatrix},

we obtain

∂∂t(EB)=(0ε−1∇×μ−1−∇×0)(EB)−(ε−1JeJm).(110)\frac{\partial}{\partial t}\begin{pmatrix}\mathbf{E}\\\mathbf{B}\end{pmatrix}= \begin{pmatrix} 0 & \varepsilon^{-1}\nabla\times\mu^{-1}\\ -\nabla\times& 0 \end{pmatrix} \begin{pmatrix}\mathbf{E}\\\mathbf{B}\end{pmatrix} - \begin{pmatrix}\varepsilon^{-1}\mathbf{J}_e\\\mathbf{J}_m\end{pmatrix}. \tag*{(110)}

Equivalently,

(A+∂∂t)U=−(ε−1JeJm).(111)\left(\mathbf{A}+\frac{\partial}{\partial t}\right)\mathbf{U} = -\begin{pmatrix}\varepsilon^{-1}\mathbf{J}_e\\\mathbf{J}_m\end{pmatrix}. \tag*{(111)}

where

A=(0−ε−1∇×μ−1∇×0).(112)\mathbf{A}= \begin{pmatrix} 0 & -\varepsilon^{-1}\nabla\times\mu^{-1}\\ \nabla\times& 0 \end{pmatrix}. \tag*{(112)}

This proves the result.

Proof of Lemma 2.2

From (8), we have

E=ε−12E~,B=μ12B~.(113)\mathbf{E}=\varepsilon^{-\frac{1}{2}}\widetilde{\mathbf{E}},\qquad\mathbf{B}=\mu^{\frac{1}{2}}\widetilde{\mathbf{B}}. \tag*{(113)}

Since ε\varepsilon and μ\mu are independent of time,

∂E~∂t=ε12∂E∂t(114)\frac{\partial\widetilde{\mathbf{E}}}{\partial t}=\varepsilon^{\frac{1}{2}}\frac{\partial\mathbf{E}}{\partial t} \tag*{(114)}
=ε−12∇×(μ−12B~)−ε−12Je(115)=\varepsilon^{-\frac{1}{2}}\nabla\times\left(\mu^{-\frac{1}{2}}\widetilde{\mathbf{B}}\right)-\varepsilon^{-\frac{1}{2}}\mathbf{J}_{e} \tag*{(115)}
=ε−12∇×(μ−12B~)−ε−12Je.(116)=\varepsilon^{-\frac{1}{2}}\nabla\times\left(\mu^{-\frac{1}{2}}\widetilde{\mathbf{B}}\right)-\varepsilon^{-\frac{1}{2}}\mathbf{J}_{e}. \tag*{(116)}

Similarly,

∂B~∂t=μ−12∂B∂t(117)\frac{\partial\widetilde{\mathbf{B}}}{\partial t}=\mu^{-\frac{1}{2}}\frac{\partial\mathbf{B}}{\partial t} \tag*{(117)}
=−μ−12∇×(ε−12E~)−μ−12Jm.(118)=-\mu^{-\frac{1}{2}}\nabla\times\left(\varepsilon^{-\frac{1}{2}}\widetilde{\mathbf{E}}\right)-\mu^{-\frac{1}{2}}\mathbf{J}_{m}. \tag*{(118)}

Therefore,

∂∂t(E~B~)=(0ε−12∇×μ−12−μ−12∇×ε−120)(E~B~)−(ε−12Jeμ−12Jm).(119)\frac{\partial}{\partial t} \begin{pmatrix} \widetilde{\mathbf{E}}\\ \widetilde{\mathbf{B}} \end{pmatrix} = \begin{pmatrix} 0 & \varepsilon^{-\frac{1}{2}}\nabla\times\mu^{-\frac{1}{2}}\\ -\mu^{-\frac{1}{2}}\nabla\times\varepsilon^{-\frac{1}{2}} & 0 \end{pmatrix} \begin{pmatrix} \widetilde{\mathbf{E}}\\ \widetilde{\mathbf{B}} \end{pmatrix} - \begin{pmatrix} \varepsilon^{-\frac{1}{2}}\mathbf{J}_{e}\\ \mu^{-\frac{1}{2}}\mathbf{J}_{m} \end{pmatrix}. \tag*{(119)}

Thus

(A~+∂∂t)U~=−(ε−12Jeμ−12Jm),(120)\left(\widetilde{A}+\frac{\partial}{\partial t}\right)\widetilde{U} = -\begin{pmatrix} \varepsilon^{-\frac{1}{2}}\mathbf{J}_{e}\\ \mu^{-\frac{1}{2}}\mathbf{J}_{m} \end{pmatrix}, \tag*{(120)}

with

A~=(0−ε−12∇×μ−12μ−12∇×ε−120).(121)\widetilde{A}= \begin{pmatrix} 0 & -\varepsilon^{-\frac{1}{2}}\nabla\times\mu^{-\frac{1}{2}}\\ \mu^{-\frac{1}{2}}\nabla\times\varepsilon^{-\frac{1}{2}} & 0 \end{pmatrix}. \tag*{(121)}

This proves the normalized formulation.

Proof of Lemma 2.3

Let

u=(u1u2),v=(v1v2).\mathbf{u}= \begin{pmatrix} \mathbf{u}_{1}\\ \mathbf{u}_{2} \end{pmatrix}, \qquad \mathbf{v}= \begin{pmatrix} \mathbf{v}_{1}\\ \mathbf{v}_{2} \end{pmatrix}.

belong to the domain of A~\widetilde{A}. The boundary condition (3) implies, in the normalized variables, that

n×(ε−12u1)=0,n×(ε−12v1)=0,x∈∂Ω.(122)\mathbf{n}\times\left(\varepsilon^{-\frac{1}{2}}\mathbf{u}_{1}\right)=0,\qquad \mathbf{n}\times\left(\varepsilon^{-\frac{1}{2}}\mathbf{v}_{1}\right)=0,\qquad x\in\partial\Omega. \tag*{(122)}

Indeed, if u1=E~\mathbf{u}_{1}=\widetilde{\mathbf{E}}, then

ε−12u1=E.\varepsilon^{-\frac{1}{2}}\mathbf{u}_{1}=\mathbf{E}.

Thus (A.15) is the normalized form of the perfectly conducting condition

n×E=0.\mathbf{n}\times\mathbf{E}=0.

Then,

⟨A~u,v⟩=−∫Ω[ε−12∇×(μ−12u2)]⋅v1 dx+∫Ω[μ−12∇×(ε−12u1)]⋅v2 dx.(123)\langle\widetilde{A}\mathbf{u},\mathbf{v}\rangle = -\int_{\Omega}\left[\varepsilon^{-\frac{1}{2}}\nabla\times\left(\mu^{-\frac{1}{2}}\mathbf{u}_{2}\right)\right]\cdot\mathbf{v}_{1}\,dx + \int_{\Omega}\left[\mu^{-\frac{1}{2}}\nabla\times\left(\varepsilon^{-\frac{1}{2}}\mathbf{u}_{1}\right)\right]\cdot\mathbf{v}_{2}\,dx. \tag*{(123)}

Equivalently,

⟨A~u,v⟩=−∫Ω∇×(μ−12u2)⋅ε−12v1 dx+∫Ω∇×(ε−12u1)⋅μ−12v2 dx.(124)\langle\widetilde{A}u,v\rangle=-\int_{\Omega}\nabla\times\left(\mu^{-\frac{1}{2}}u_2\right)\cdot\varepsilon^{-\frac{1}{2}}v_1\,dx+\int_{\Omega}\nabla\times\left(\varepsilon^{-\frac{1}{2}}u_1\right)\cdot\mu^{-\frac{1}{2}}v_2\,dx. \tag*{(124)}

Using the curl integration-by-parts formula

∫Ω(∇×a)⋅b dx=∫Ωa⋅(∇×b) dx+∫∂Ω(n×a)⋅b dS,(125)\int_{\Omega}(\nabla\times a)\cdot b\,dx=\int_{\Omega}a\cdot(\nabla\times b)\,dx+\int_{\partial\Omega}(n\times a)\cdot b\,dS, \tag*{(125)}

the boundary terms vanish because of the tangential boundary conditions above. Hence

⟨A~u,v⟩=−∫Ωμ−12u2⋅∇×(ε−12v1) dx+∫Ωε−12u1⋅∇×(μ−12v2) dx.(126)\langle\widetilde{A}u,v\rangle=-\int_{\Omega}\mu^{-\frac{1}{2}}u_2\cdot\nabla\times\left(\varepsilon^{-\frac{1}{2}}v_1\right)\,dx+\int_{\Omega}\varepsilon^{-\frac{1}{2}}u_1\cdot\nabla\times\left(\mu^{-\frac{1}{2}}v_2\right)\,dx. \tag*{(126)}

Therefore,

⟨A~u,v⟩=−∫Ωu2⋅[μ−12∇×(ε−12v1)] dx+∫Ωu1⋅[ε−12∇×(μ−12v2)] dx.(127)\langle\widetilde{A}u,v\rangle=-\int_{\Omega}u_2\cdot\left[\mu^{-\frac{1}{2}}\nabla\times\left(\varepsilon^{-\frac{1}{2}}v_1\right)\right]\,dx+\int_{\Omega}u_1\cdot\left[\varepsilon^{-\frac{1}{2}}\nabla\times\left(\mu^{-\frac{1}{2}}v_2\right)\right]\,dx. \tag*{(127)}

By the definition of A~\widetilde{A}, this is

⟨A~u,v⟩=−⟨u,A~v⟩.(128)\langle\widetilde{A}u,v\rangle=-\langle u,\widetilde{A}v\rangle. \tag*{(128)}

Thus A~\widetilde{A} is skew-symmetric. The skew-adjointness of the corresponding perfectly conducting Maxwell realization is a standard result; see, for instance, [23].

Proof of Theorem 2.4

Let

ψ=(ψ1ψ2)∈null⁡(A~).\psi=\begin{pmatrix}\psi_1\\\psi_2\end{pmatrix}\in\operatorname{null}(\widetilde{A}).

Then A~ψ=0\widetilde{A}\psi=0 implies

∇×(μ−12ψ2)=0,∇×(ε−12ψ1)=0.(129)\nabla\times\left(\mu^{-\frac{1}{2}}\psi_2\right)=0,\qquad\nabla\times\left(\varepsilon^{-\frac{1}{2}}\psi_1\right)=0. \tag*{(129)}

On a simply connected domain, there exist scalar potentials N1N_1 and N2N_2 such that

ε−12ψ1=∇N1,μ−12ψ2=∇N2.(130)\varepsilon^{-\frac{1}{2}}\psi_1=\nabla N_1,\qquad\mu^{-\frac{1}{2}}\psi_2=\nabla N_2. \tag*{(130)}

Therefore

ψ1=ε12∇N1,ψ2=μ12∇N2.(131)\psi_1=\varepsilon^{\frac{1}{2}}\nabla N_1,\qquad\psi_2=\mu^{\frac{1}{2}}\nabla N_2. \tag*{(131)}

This gives

ψ=∇~(N1N2),(132)\psi=\widetilde{\nabla}\begin{pmatrix}N_1\\N_2\end{pmatrix}, \tag*{(132)}

where

∇~(N1N2)=(ε12∇N1μ12∇N2).(133)\widetilde{\nabla}\begin{pmatrix}N_1\\N_2\end{pmatrix}=\begin{pmatrix}\varepsilon^{\frac{1}{2}}\nabla N_1\\\mu^{\frac{1}{2}}\nabla N_2\end{pmatrix}. \tag*{(133)}

Using the orthogonal decomposition

L2(Ω)6=null⁡(A~)⊕range⁡(A~)‾,L^2(\Omega)^6=\operatorname{null}(\widetilde{A})\oplus\overline{\operatorname{range}(\widetilde{A})},

which follows from the general identity

null⁡(A)=range⁡(A)⊥\operatorname{null}(A)=\operatorname{range}(A)^\perp

for skew-adjoint operators, see for instance [23], the solution decomposes as

U~(s,p)(t,x)=∇~N(s,p)(t,x)+U(s,p)(t,x).(134)\widetilde{U}^{(s,p)}(t,x)=\widetilde{\nabla}N^{(s,p)}(t,x)+U^{(s,p)}(t,x). \tag*{(134)}

This proves the decomposition.

Claim in spectral decomposition

We justify the construction of the family (ψj)j≥1(\psi_j)_{j\geq1} associated with the orthonormal eigenbasis (ϕj)j≥1(\phi_j)_{j\geq1}, and prove the identities

Aϕj=λj ψj,Aψj=−λj ϕj.(135)A\phi_j = \sqrt{\lambda_j}\,\psi_j,\qquad A\psi_j = -\sqrt{\lambda_j}\,\phi_j. \tag*{(135)}

Let Hr=null⁡(A~)⊥\mathcal{H}_r = \operatorname{null}(\widetilde{A})^\perp be the propagating subspace and let

A=A~∣D(A~)∩Hr.(136)A = \left.\widetilde{A}\right|_{D(\widetilde{A})\cap\mathcal{H}_r}. \tag*{(136)}

We work with the standard skew-adjoint Maxwell realization on Hr\mathcal{H}_r. Hence −A2-A^2 is positive self-adjoint. Assuming the corresponding Maxwell compactness property, −A2-A^2 has compact resolvent on Hr\mathcal{H}_r. Therefore there exists an orthonormal eigenbasis (ϕj)j≥1(\phi_j)_{j\geq1} of Hr\mathcal{H}_r and positive eigenvalues (λj)j≥1(\lambda_j)_{j\geq1}, with λj→∞\lambda_j\to\infty, such that

−A2ϕj=λjϕj.(137)-A^2\phi_j = \lambda_j\phi_j. \tag*{(137)}

We do not assume that the eigenvalues (λj)j≥1(\lambda_j)_{j\geq1} are simple. In general, they may have multiplicity. In that case, the construction above is performed within each eigenspace and an orthonormal basis of eigenfunctions is chosen.

Now, for each j≥1j\geq1, we define

ψj:=Aϕjλj.(138)\psi_j := \frac{A\phi_j}{\sqrt{\lambda_j}}. \tag*{(138)}

This is well-defined since λj>0\lambda_j>0 and ϕj∈D(A)\phi_j\in D(A). We will first show that (ψj)j(\psi_j)_j is an orthonormal family. Using the skew-symmetry of AA, we compute

∥ψj∥2=1λj⟨Aϕj,Aϕj⟩=−1λj⟨ϕj,A2ϕj⟩=1λj⟨ϕj,−A2ϕj⟩=1λjλj⟨ϕj,ϕj⟩=1.\begin{aligned} \lVert\psi_j\rVert^2 &= \frac{1}{\lambda_j}\langle A\phi_j,A\phi_j\rangle = -\frac{1}{\lambda_j}\langle\phi_j,A^2\phi_j\rangle = \frac{1}{\lambda_j}\langle\phi_j,-A^2\phi_j\rangle\\ &= \frac{1}{\lambda_j}\lambda_j\langle\phi_j,\phi_j\rangle = 1. \end{aligned}

Thus, ∥ψj∥=1\lVert\psi_j\rVert=1. Then, let j,ℓ≥1j,\ell\geq1. It holds that

⟨ψj,ψℓ⟩=1λjλℓ⟨Aϕj,Aϕℓ⟩=−1λjλℓ⟨ϕj,A2ϕℓ⟩=1λjλℓ⟨ϕj,−A2ϕℓ⟩=λℓλjλℓ⟨ϕj,ϕℓ⟩=λℓλj δjℓ.\begin{aligned} \langle\psi_j,\psi_\ell\rangle &= \frac{1}{\sqrt{\lambda_j\lambda_\ell}}\langle A\phi_j,A\phi_\ell\rangle = -\frac{1}{\sqrt{\lambda_j\lambda_\ell}}\langle\phi_j,A^2\phi_\ell\rangle = \frac{1}{\sqrt{\lambda_j\lambda_\ell}}\langle\phi_j,-A^2\phi_\ell\rangle\\ &= \frac{\lambda_\ell}{\sqrt{\lambda_j\lambda_\ell}}\langle\phi_j,\phi_\ell\rangle = \sqrt{\frac{\lambda_\ell}{\lambda_j}}\,\delta_{j\ell}. \end{aligned}

Hence,

⟨ψj,ψℓ⟩=δjℓ.(139)\langle\psi_j,\psi_\ell\rangle=\delta_{j\ell}. \tag*{(139)}

which gives the orthogonality.

Let us also show the orthogonality between ψj\psi_j and ϕj\phi_j, for j≥1j\geq1. Using skew-symmetry,

⟨ϕj,ψj⟩=1λj⟨ϕj,Aϕj⟩=−1λj⟨Aϕj,ϕj⟩=−⟨ϕj,ψj⟩.(140)\langle\phi_j,\psi_j\rangle = \frac{1}{\sqrt{\lambda_j}}\langle\phi_j,A\phi_j\rangle = -\frac{1}{\sqrt{\lambda_j}}\langle A\phi_j,\phi_j\rangle = -\langle\phi_j,\psi_j\rangle. \tag*{(140)}

which implies

⟨ϕj,ψj⟩=0.(141)\langle\phi_j,\psi_j\rangle=0. \tag*{(141)}

In general, the functions ψj\psi_j belong to the span of the family (ϕk)k(\phi_k)_k, so orthogonality between ϕj\phi_j and ψℓ\psi_\ell does not hold for ℓ≠j\ell\neq j, with j,ℓ≥1j,\ell\geq1.

Finally, let us prove (A.28). By definition,

Aϕj=λj ψj.(142)A\phi_j=\sqrt{\lambda_j}\,\psi_j. \tag*{(142)}

Furthermore,

Aψj=1λjA2ϕj=−λjλjϕj=−λj ϕj.(143)A\psi_j=\frac{1}{\sqrt{\lambda_j}}A^2\phi_j=-\frac{\lambda_j}{\sqrt{\lambda_j}}\phi_j=-\sqrt{\lambda_j}\,\phi_j. \tag*{(143)}

This concludes the proof.

Proof of Lemma 2.6

Proof. For 0≤j≤l≤n−10 \le j \le l \le n-1, it holds from (53) that

Mj,l=∫ΩvjT(x)vl(x) dx=∫Ωv0T(x)ejτATe−lτAv0(x) dx=∫Ωv0T(x)e−(l−j)τAv0(x) dx.\mathbb{M}_{j,l}=\int_{\Omega} \mathbf{v}_j^{\mathsf{T}}(x)\mathbf{v}_l(x)\,\mathrm{d}x=\int_{\Omega}\mathbf{v}_0^{\mathsf{T}}(x)e^{j\tau A^{\mathsf{T}}}e^{-l\tau A}\mathbf{v}_0(x)\,\mathrm{d}x =\int_{\Omega}\mathbf{v}_0^{\mathsf{T}}(x)e^{-(l-j)\tau A}\mathbf{v}_0(x)\,\mathrm{d}x.

which, from (41), becomes

Mj,l=D(tl−j).\mathbb{M}_{j,l}=\mathbb{D}(t_{l-j}).

In addition, we have from (55), that the mass matrix M\mathbb{M} is symmetric, which implies that for 0≤l≤j≤n−10 \le l \le j \le n-1, we have

Mj,l=(Ml,j)T.(144)\mathbb{M}_{j,l}=\left(\mathbb{M}_{l,j}\right)^{\mathsf{T}}. \tag*{(144)}

Similarly, for 0≤j≤l≤n−10 \le j \le l \le n-1, we have from (54) and (44) that

Sj,l=∫ΩvjT(x)Pvl(x) dx=∫ΩvjT(x)vl+1(x) dx=∫Ωv0T(x)ejτATe−(l+1)τAv0(x) dx=∫Ωv0T(x)e−(l+1−j)τAv0(x) dx,\mathbb{S}_{j,l}=\int_{\Omega}\mathbf{v}_j^{\mathsf{T}}(x)\mathcal{P}\mathbf{v}_l(x)\,\mathrm{d}x=\int_{\Omega}\mathbf{v}_j^{\mathsf{T}}(x)\mathbf{v}_{l+1}(x)\,\mathrm{d}x=\int_{\Omega}\mathbf{v}_0^{\mathsf{T}}(x)e^{j\tau A^{\mathsf{T}}}e^{-(l+1)\tau A}\mathbf{v}_0(x)\,\mathrm{d}x =\int_{\Omega}\mathbf{v}_0^{\mathsf{T}}(x)e^{-(l+1-j)\tau A}\mathbf{v}_0(x)\,\mathrm{d}x,

which gives

Sj,l=D(tl+1−j).\mathbb{S}_{j,l}=\mathbb{D}(t_{l+1-j}).

Then, for 0≤l<j−10 \le l < j-1, with j=2,…,n−1j=2,\ldots,n-1, we have

Sj,l=∫ΩvjT(x)Pvl(x) dx=∫Ω[PTvj(x)]Tvl(x) dx=∫Ωvj−1T(x)vl(x) dx=[∫ΩvlT(x)vj−1(x) dx]T,\mathbb{S}_{j,l}=\int_{\Omega}\mathbf{v}_j^{\mathsf{T}}(x)\mathcal{P}\mathbf{v}_l(x)\,\mathrm{d}x=\int_{\Omega}\left[\mathcal{P}^{\mathsf{T}}\mathbf{v}_j(x)\right]^{\mathsf{T}}\mathbf{v}_l(x)\,\mathrm{d}x=\int_{\Omega}\mathbf{v}_{j-1}^{\mathsf{T}}(x)\mathbf{v}_l(x)\,\mathrm{d}x =\left[\int_{\Omega}\mathbf{v}_l^{\mathsf{T}}(x)\mathbf{v}_{j-1}(x)\,\mathrm{d}x\right]^{\mathsf{T}},

which gives

Sj,l=[D(tj−1−l)]T.(145)\mathbb{S}_{j,l}=\left[\mathbb{D}(t_{j-1-l})\right]^{\mathsf{T}}. \tag*{(145)}

This concludes the proof.

Proofs of Section 3

Proof of Theorem 3.1

Proof. We compute the curl operators explicitly under the assumptions (64)–(65). Since

E(t,x)=(0E2(t,x1)0),\mathbf{E}(t,x)= \begin{pmatrix} 0\\ E_2(t,x_1)\\ 0 \end{pmatrix},

we obtain

∇×E=(00∂E2∂x1).(146)\nabla\times\mathbf{E}= \begin{pmatrix} 0\\ 0\\ \frac{\partial E_2}{\partial x_1} \end{pmatrix}. \tag*{(146)}

Similarly, since

B(t,x)=(00B3(t,x1)),\mathbf{B}(t,x)=\begin{pmatrix} 0 \\ 0 \\ B_{3}(t,x_{1}) \end{pmatrix},

and μ=μ(x1)\mu=\mu(x_{1}), we have

μ−1B=(00μ(x1)−1B3(t,x1)).\mu^{-1}\mathbf{B}=\begin{pmatrix} 0 \\ 0 \\ \mu(x_{1})^{-1}B_{3}(t,x_{1}) \end{pmatrix}.

Therefore

∇×(μ−1B)=(0−∂∂x1(μ(x1)−1B3)0).(147)\nabla\times\left(\mu^{-1}\mathbf{B}\right)=\begin{pmatrix} 0 \\ -\frac{\partial}{\partial x_{1}}\left(\mu(x_{1})^{-1}B_{3}\right) \\ 0 \end{pmatrix}. \tag*{(147)}

Substituting into the source-free Maxwell equations

∇×E+∂B∂t=0,−∇×(μ−1B)+ε(x1)∂E∂t=0,(148)\nabla\times\mathbf{E}+\frac{\partial\mathbf{B}}{\partial t}=0,\qquad-\nabla\times\left(\mu^{-1}\mathbf{B}\right)+\varepsilon(x_{1})\frac{\partial\mathbf{E}}{\partial t}=0, \tag*{(148)}

we obtain

{∂B3∂t=−∂E2∂x1,ε(x1)∂E2∂t=−∂∂x1(μ(x1)−1B3).(149)\begin{cases} \frac{\partial B_{3}}{\partial t}=-\frac{\partial E_{2}}{\partial x_{1}},\\ \varepsilon(x_{1})\frac{\partial E_{2}}{\partial t}=-\frac{\partial}{\partial x_{1}}\left(\mu(x_{1})^{-1}B_{3}\right). \tag*{(149)} \end{cases}

This proves (66).

We now derive the second-order equation for E2E_{2}. Differentiating the second equation with respect to time gives

ε(x1)∂2E2∂t2=−∂∂x1(μ(x1)−1∂B3∂t).(150)\varepsilon(x_{1})\frac{\partial^{2}E_{2}}{\partial t^{2}}=-\frac{\partial}{\partial x_{1}}\left(\mu(x_{1})^{-1}\frac{\partial B_{3}}{\partial t}\right). \tag*{(150)}

Using

∂B3∂t=−∂E2∂x1,\frac{\partial B_{3}}{\partial t}=-\frac{\partial E_{2}}{\partial x_{1}},

we obtain

ε(x1)∂2E2∂t2=∂∂x1(μ(x1)−1∂E2∂x1).(151)\varepsilon(x_{1})\frac{\partial^{2}E_{2}}{\partial t^{2}}=\frac{\partial}{\partial x_{1}}\left(\mu(x_{1})^{-1}\frac{\partial E_{2}}{\partial x_{1}}\right). \tag*{(151)}

Hence

ε(x1)∂2E2∂t2−∂∂x1(μ(x1)−1∂E2∂x1)=0.(152)\varepsilon(x_{1})\frac{\partial^{2}E_{2}}{\partial t^{2}}-\frac{\partial}{\partial x_{1}}\left(\mu(x_{1})^{-1}\frac{\partial E_{2}}{\partial x_{1}}\right)=0. \tag*{(152)}

We also derive the equation for B3B_{3}. Differentiating the first equation with respect to time gives

∂2B3∂t2=−∂∂x1(∂E2∂t).(153)\frac{\partial^{2}B_{3}}{\partial t^{2}}=-\frac{\partial}{\partial x_{1}}\left(\frac{\partial E_{2}}{\partial t}\right). \tag*{(153)}

From the second equation,

∂E2∂t=−ε(x1)−1∂∂x1(μ(x1)−1B3).(154)\frac{\partial E_{2}}{\partial t}=-\varepsilon(x_{1})^{-1}\frac{\partial}{\partial x_{1}}\left(\mu(x_{1})^{-1}B_{3}\right). \tag*{(154)}

Therefore

∂2B3∂t2=∂∂x1[ε(x1)−1∂∂x1(μ(x1)−1B3)].(155)\frac{\partial^2 B_3}{\partial t^2}=\frac{\partial}{\partial x_1}\left[\varepsilon(x_1)^{-1}\frac{\partial}{\partial x_1}\left(\mu(x_1)^{-1}B_3\right)\right]. \tag*{(155)}

Finally, if ε\varepsilon and μ\mu are constant inside a layer, the equation for E2E_2 becomes

∂2E2∂t2−1εμ∂2E2∂x12=0.(156)\frac{\partial^2 E_2}{\partial t^2}-\frac{1}{\varepsilon\mu}\frac{\partial^2 E_2}{\partial x_1^2}=0. \tag*{(156)}

Thus the local wave speed is

c(x1)=1ε(x1)μ(x1).(157)c(x_1)=\frac{1}{\sqrt{\varepsilon(x_1)\mu(x_1)}}. \tag*{(157)}

This concludes the proof.

Details of the numerical implementation

This appendix describes the numerical procedure used in § 7. The purpose is to make the construction of the data, the ROM matrices and the perturbation experiments reproducible.

Reference medium and unknown parameters

All experiments are performed on a five-layer Goupillaud medium. The reference impedance vector is

ζ⋆=(1,2,4,8,10,12).(158)\boldsymbol{\zeta}^{\star}=(1,2,4,8,10,12). \tag*{(158)}

The first impedance ζ0=1\zeta_0=1 is kept fixed throughout the inversion, in order to remove the global scaling ambiguity. The unknown parameter vector is therefore

θ=(ζ1,…,ζ5).(159)\theta=(\zeta_1,\ldots,\zeta_5). \tag*{(159)}

The admissible set used in the numerical optimization is

10−6≤ζj≤50,j=1,…,5.(160)10^{-6}\leq\zeta_j\leq50,\qquad j=1,\ldots,5. \tag*{(160)}

The time step is normalized to

τ=1.(161)\tau=1. \tag*{(161)}

We use nine snapshots, indexed by k=0,…,8k=0,\ldots,8.

Forward data

For each impedance vector ζ\zeta, the reflection and transmission coefficients at the interfaces are

rj(ζ)=ζj−ζj+1ζj+ζj+1,tj(ζ)=2ζjζj+1ζj+ζj+1,j=0,…,4.(162)r_j(\zeta)=\frac{\zeta_j-\zeta_{j+1}}{\zeta_j+\zeta_{j+1}},\qquad t_j(\zeta)=\frac{2\sqrt{\zeta_j\zeta_{j+1}}}{\zeta_j+\zeta_{j+1}},\qquad j=0,\ldots,4. \tag*{(162)}

The right- and left-going amplitudes are then propagated by the Goupillaud recurrence described in § 5. This gives the snapshot coefficients

vk(ζ)=∑jCk,j(ζ)δLj,k=0,…,8.(163)v_k(\zeta)=\sum_j C_{k,j}(\zeta)\delta_{L_j},\qquad k=0,\ldots,8. \tag*{(163)}

The discrete data vector is computed from the snapshot inner products

Dm(ζ)=⟨v0(ζ),vm(ζ)⟩,m=0,…,8.(164)D_m(\zeta)=\langle v_0(\zeta),v_m(\zeta)\rangle,\qquad m=0,\ldots,8. \tag*{(164)}

By the parity structure of the Goupillaud model, the odd entries vanish:

D1=D3=D5=D7=0.(165)D_1=D_3=D_5=D_7=0. \tag*{(165)}

Thus, the data used in the experiments are

D(ζ)=(D0,0,D2,0,D4,0,D6,0,D8).(166)D(\zeta)=(D_0,0,D_2,0,D_4,0,D_6,0,D_8). \tag*{(166)}

ROM matrix and normalized objective

The ROM matrix is assembled from the nonzero Goupillaud amplitudes. In the five-layer experiment it has size 5×95 \times9 and sparsity pattern

R(ζ)=(R000R020R040R060R080R110R130R150R17000R220R240R260R28000R330R350R3700000R440R460R48).(167)R(\zeta)=\begin{pmatrix} R_{00} & 0 & R_{02} & 0 & R_{04} & 0 & R_{06} & 0 & R_{08}\\ 0 & R_{11} & 0 & R_{13} & 0 & R_{15} & 0 & R_{17} & 0\\ 0 & 0 & R_{22} & 0 & R_{24} & 0 & R_{26} & 0 & R_{28}\\ 0 & 0 & 0 & R_{33} & 0 & R_{35} & 0 & R_{37} & 0\\ 0 & 0 & 0 & 0 & R_{44} & 0 & R_{46} & 0 & R_{48} \end{pmatrix}. \tag*{(167)}

The entries RijR_{ij} are obtained from the Goupillaud amplitudes computed by the forward recurrence. Since RR is rectangular, we use the Tikhonov-regularized right inverse

Rα†=RT(RRT+αI)−1,α=10−8.(168)R_{\alpha}^{\dagger}=R^{\mathsf{T}}\left(RR^{\mathsf{T}}+\alpha I\right)^{-1},\qquad\alpha=10^{-8}. \tag*{(168)}

The ROM objective used in the computations is

OROM(ζ)=∥R(ζ)R(ζref)α†−I5∥F2.(169)\mathcal{O}^{\mathrm{ROM}}(\zeta)=\left\|R(\zeta)R(\zeta_{\mathrm{ref}})_{\alpha}^{\dagger}-I_{5}\right\|_{\mathrm{F}}^{2}. \tag*{(169)}

Here ζref\zeta_{\mathrm{ref}} denotes the reference impedance for the corresponding experiment. In the clean and layer-perturbation experiments it is the true medium used to generate the data. In data-perturbation experiments, it is the effective impedance fitted from the perturbed data. The direct data misfit is

OFWI(ζ)=τ∥D(ζ)−Dobs∥22.(170)\mathcal{O}^{\mathrm{FWI}}(\zeta)=\tau\left\|D(\zeta)-D^{\mathrm{obs}}\right\|_{2}^{2}. \tag*{(170)}

Optimization procedure

All minimizations are performed with the L-BFGS-B algorithm under the box constraints

θj∈[10−6,50],j=1,…,5.(171)\theta_j\in[10^{-6},50],\qquad j=1,\ldots,5. \tag*{(171)}

For the clean inversion, we use 20 random initializations of the form

θ(0)=θ⋆⊙(1+0.3ξ),ξ∼N(0,I5),(172)\theta^{(0)}=\theta^{\star}\odot(1+0.3\xi),\qquad\xi\sim\mathcal{N}(0,I_{5}), \tag*{(172)}

with clipping to the admissible interval.

For each perturbation level σ\sigma, the reported statistics are computed over 50 independent Monte Carlo trials. The random seed for the perturbation in trial kk is kk, and the random seed for the initialization is 1000+k1000+k.

Perturbation models

We use the following perturbation models.

Layer perturbation. The physical medium itself is perturbed. We set

ζjpert=ζj⋆(1+σξj),j=1,…,5,(173)\zeta_{j}^{\mathrm{pert}}=\zeta_{j}^{\star}(1+\sigma\xi_j),\qquad j=1,\ldots,5, \tag*{(173)}

where ξj∼N(0,1)\xi_j\sim\mathcal{N}(0,1) are independent. The exterior impedance ζ0=1\zeta_0=1 is kept fixed. Negative or zero values are clipped to 10−610^{-6}. The observed data are

Dobs=D(ζpert).(174)D^{\mathrm{obs}}=D(\zeta^{\mathrm{pert}}). \tag*{(174)}

The reconstruction error is measured with respect to ζpert\zeta^{\mathrm{pert}}.

Perturbation grids

Multiplicative data noise. The physical medium is not changed. The observed data are

Djobs=Dj(ζ⋆)(1+σξj),ξj∼N(0,1).(175)\mathbb{D}^{\mathrm{obs}}_j = \mathbb{D}_j(\zeta^\star)(1+\sigma\xi_j), \qquad\xi_j \sim\mathcal{N}(0,1). \tag*{(175)}

Since the perturbed data do not necessarily correspond exactly to an admissible layered medium, we first compute an effective reference impedance ζref\zeta_{\mathrm{ref}} by minimizing the direct data misfit against Dobs\mathbb{D}^{\mathrm{obs}}. The ROM objective is then formed using R(ζref)R(\zeta_{\mathrm{ref}}), and the reconstruction errors are measured relative to ζref\zeta_{\mathrm{ref}}.

Propagation-speed uncertainty. Propagation-speed uncertainty is modeled as a multiplicative perturbation of the nonzero even-time data entries, with larger perturbations at later times:

Djobs=Dj(ζ⋆)(1+σ(1+j8)ξj),j=0,2,4,6,8.(176)\mathbb{D}^{\mathrm{obs}}_j = \mathbb{D}_j(\zeta^\star)\left(1+\sigma\left(1+\frac{j}{8}\right)\xi_j\right), \qquad j=0,2,4,6,8. \tag*{(176)}

The odd entries are kept equal to zero. The reconstruction error is measured with respect to ζ⋆\zeta^\star.

Receiver-position error: time-shift model. A receiver-position error is first modeled as a coherent time-shift distortion. A single Gaussian variable ξ\xi is drawn and we set

Djobs=Dj(ζ⋆)(1+σξ)j,j=0,2,4,6,8.(177)\mathbb{D}^{\mathrm{obs}}_j = \mathbb{D}_j(\zeta^\star)(1+\sigma\xi)^j, \qquad j=0,2,4,6,8. \tag*{(177)}

The odd entries are kept equal to zero.

Receiver-position error: amplitude model. We also model receiver-position errors as amplitude perturbations of the recorded arrivals:

Djobs=Dj(ζ⋆)(1+σwjξj),j=0,2,4,6,8,(178)\mathbb{D}^{\mathrm{obs}}_j = \mathbb{D}_j(\zeta^\star)(1+\sigma w_j\xi_j), \qquad j=0,2,4,6,8, \tag*{(178)}

with weights

w0=0,w2=1,w4=2,w6=3,w8=4.(179)w_0=0,\qquad w_2=1,\qquad w_4=2,\qquad w_6=3,\qquad w_8=4. \tag*{(179)}

Thus the first datum is kept fixed, while later arrivals are perturbed more strongly. The odd entries remain zero.

Constant gain bias. A calibration error is modeled by multiplying the full data vector by a single random gain:

Dobs=(1+σξ)D(ζ⋆),ξ∼N(0,1).(180)\mathbb{D}^{\mathrm{obs}}=(1+\sigma\xi)\mathbb{D}(\zeta^\star), \qquad\xi\sim\mathcal{N}(0,1). \tag*{(180)}

Additive bias. A baseline error is modeled by adding a constant offset to all entries of the data vector:

Dobs=D(ζ⋆)+b1,(181)\mathbb{D}^{\mathrm{obs}}=\mathbb{D}(\zeta^\star)+b\mathbf{1}, \tag*{(181)}

where

b=σsξ,s=max⁡{∥D(ζ⋆)∥29,1},ξ∼N(0,1).(182)b=\sigma s\xi,\qquad s=\max\left\{\frac{\lVert\mathbb{D}(\zeta^\star)\rVert_2}{\sqrt{9}},1\right\},\qquad\xi\sim\mathcal{N}(0,1). \tag*{(182)}

Time-origin error. A time-origin error is modeled by shifting the data vector by an integer number of time steps. We draw

k=clip⁡(round⁡(σξ),−2,2),ξ∼N(0,1),(183)k=\operatorname{clip}(\operatorname{round}(\sigma\xi),-2,2),\qquad\xi\sim\mathcal{N}(0,1), \tag*{(183)}

and shift D(ζ⋆)\mathbb{D}(\zeta^\star) by kk entries, using zero padding at the boundaries. Here clip⁡(y,−2,2)\operatorname{clip}(y,-2,2) denotes the projection of yy onto the interval [−2,2][-2,2].

Perturbation grids

The perturbation amplitudes used in the numerical experiments are as follows:

σlayer∈{0.5,0.6,0.7,0.8,0.9,1.0},(184)\sigma_{\mathrm{layer}} \in\{0.5, 0.6, 0.7, 0.8, 0.9, 1.0\}, \tag*{(184)}
σdata∈{10−2,2⋅10−2,…,10−1},(185)\sigma_{\mathrm{data}} \in\{10^{-2}, 2\cdot10^{-2}, \ldots, 10^{-1}\}, \tag*{(185)}
σspeed∈{10−2,2⋅10−2,…,10−1},(186)\sigma_{\mathrm{speed}} \in\{10^{-2}, 2\cdot10^{-2}, \ldots, 10^{-1}\}, \tag*{(186)}
σrec,time∈{10−2,2⋅10−2,…,10−1},(187)\sigma_{\mathrm{rec,time}} \in\{10^{-2}, 2\cdot10^{-2}, \ldots, 10^{-1}\}, \tag*{(187)}
σrec,amp∈{10−2,2⋅10−2,…,10−1},(188)\sigma_{\mathrm{rec,amp}} \in\{10^{-2}, 2\cdot10^{-2}, \ldots, 10^{-1}\}, \tag*{(188)}
σgain∈{10−2,2⋅10−2,…,10−1,2⋅10−1,…,6⋅10−1},(189)\sigma_{\mathrm{gain}} \in\{10^{-2}, 2\cdot10^{-2}, \ldots, 10^{-1}, 2\cdot10^{-1}, \ldots, 6\cdot10^{-1}\}, \tag*{(189)}
σadd∈{10−3,2⋅10−3,…,10−2},(190)\sigma_{\mathrm{add}} \in\{10^{-3}, 2\cdot10^{-3}, \ldots, 10^{-2}\}, \tag*{(190)}
σorigin∈{0.4,0.5,0.6,0.7,0.8,0.9,1.0}.(191)\sigma_{\mathrm{origin}} \in\{0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1.0\}. \tag*{(191)}

Reported statistics

For each perturbation level, we compute the reconstruction errors

err⁡FWI=∥ζ^FWI−ζcomp∥2,err⁡ROM=∥ζ^ROM−ζcomp∥2.(192)\operatorname{err}_{\mathrm{FWI}} = \lVert\widehat{\zeta}_{\mathrm{FWI}}-\zeta_{\mathrm{comp}}\rVert_2,\qquad\operatorname{err}_{\mathrm{ROM}} = \lVert\widehat{\zeta}_{\mathrm{ROM}}-\zeta_{\mathrm{comp}}\rVert_2. \tag*{(192)}

Here ζcomp\zeta_{\mathrm{comp}} is the comparison impedance: it is the perturbed medium for the layer-perturbation experiment, the fitted effective reference medium for the data-noise experiment, and the original reference medium ζ⋆\zeta^\star for the remaining perturbation models.

The figures report the median of these errors over the Monte Carlo trials, together with the win fraction

Win⁡=P(err⁡ROM<err⁡FWI),(193)\operatorname{Win} = \mathbb{P}\left(\operatorname{err}_{\mathrm{ROM}} < \operatorname{err}_{\mathrm{FWI}}\right), \tag*{(193)}

estimated empirically over the 50 trials.

Image not extracted

Figure 1. Propagation in a Goupillaud medium. The equal travel-time condition ensures that waves move from one interface to the next in a single time step τ\tau, leading to a discrete dynamical system for the amplitudes AjkA_j^k and BjkB_j^k.

References

  1. [1]M. I. Belishev. Recent progress in the boundary control method. Inverse problems, 23(5):R1–R67, 2007.DOI
  2. [2]P. Benner, S. Gugercin, and K. Willcox. A survey of projection-based model reduction methods for parametric dynamical systems. SIAM review, 57(4):483–531, 2015.DOI
  3. [3]P. Blondel and B. J. Murton. Handbook of seafloor sonar imagery, volume 7. Wiley Chichester, 1997.
  4. [4]L. Borcea, V. Druskin, A. V. Mamonov, and M. Zaslavsky. Untangling the nonlinearity in inverse scattering with data-driven reduced order models. Inverse Problems, 34(6):065008, 2018.DOI
  5. [5]L. Borcea, V. Druskin, A. V. Mamonov, M. Zaslavsky, and J. Zimmerling. Reduced order model approach to inverse scattering. SIAM Journal on Imaging Sciences, 13(2):685–723, 2020.arxiv.org/abs/1910.13014
  6. [6]L. Borcea, V. Druskin, and J. Zimmerling. A reduced order model approach to inverse scattering in lossy layered media. Journal of Scientific Computing, 89(1):1, 2021.arxiv.org/abs/2012.00861
  7. [7]L. Borcea, J. Garnier, A. V. Mamonov, and J. Zimmerling. Reduced order model approach for imaging with waves. Inverse Problems, 38(2):025004, 2022.DOI
  8. [8]L. Borcea, J. Garnier, A. V. Mamonov, and J. Zimmerling. Waveform inversion via reduced order modeling. Geophysics, 88(2):R175–R191, 2023.arxiv.org/abs/2202.01824
  9. [9]L. Borcea, J. Garnier, A. V. Mamonov, and J. Zimmerling. Waveform inversion with a data driven estimate of the internal wave. SIAM Journal on Imaging Sciences, 16(1):280–312, 2023.arxiv.org/abs/2208.11051
  10. [10]L. Borcea, J. Garnier, A. V. Mamonov, and J. Zimmerling. When data driven reduced order modeling meets full waveform inversion. SIAM Review, 66(3):501–532, 2024.arxiv.org/abs/2302.05988
  11. [11]L. Borcea, Y. Liu, and J. Zimmerling. Electromagnetic inverse wave scattering in anisotropic media via reduced order modeling. Journal of Computational Physics, 515:113272, 2024.arxiv.org/abs/2403.03844
  12. [12]S. L. Brunton and J. N. Kutz. Data-driven science and engineering: Machine learning, dynamical systems, and control. Cambridge University Press, 2022.
  13. [13]M. Cheney and B. Borden. Fundamentals of radar imaging. SIAM, 2009.DOI
  14. [14]J. C. Curlander and R. N. McDonough. Synthetic aperture radar, volume 11. Wiley, New York, 1991.
  15. [15]V. Druskin, A. V. Mamonov, A. E. Thaler, and M. Zaslavsky. Direct, nonlinear inversion algorithm for hyperbolic problems via projection-based model reduction. SIAM Journal on Imaging Sciences, 9(2):684–747, 2016.DOI
  16. [16]V. Druskin, A. V. Mamonov, and M. Zaslavsky. A nonlinear method for imaging with acoustic waves via reduced order model backprojection. SIAM Journal on Imaging Sciences, 11(1):164–196, 2018.DOI
  17. [17]B. Engquist and B. D. Froese. Application of the wasserstein metric to seismic signals. arXiv preprint arXiv:1311.4581, 2013.arxiv.org/abs/1311.4581
  18. [18]B. Engquist and Y. Yang. Optimal transport based seismic inversion: Beyond cycle skipping. Communications on Pure and Applied Mathematics, 75(10):2201–2244, 2022.arxiv.org/abs/2002.00031
  19. [19]J.-P. Fouque, J. Garnier, G. Papanicolaou, and K. Solna. Wave propagation and time reversal in randomly layered media, volume 56. Springer Science & Business Media, 2007.
  20. [20]M. Gilman, E. Smith, and S. Tsynkov. Transionospheric synthetic aperture imaging. Springer, 2017.DOI
  21. [21]J. S. Hesthaven, C. Pagliantini, and G. Rozza. Reduced basis methods for time-dependent problems. Acta Numerica, 31:265–345, 2022.DOI
  22. [22]G. Huang, R. Nammour, and W. W. Symes. Source-independent extended waveform inversion based on space-time source extension: Frequency-domain implementation. Geophysics, 83(5):R449–R461, 2018.DOI
  23. [23]P. Monk. Finite element methods for Maxwell’s equations. Oxford university press, 2003.
  24. [24]P. Stefanov and G. Uhlmann. Stable determination of generic simple metrics from the hyperbolic dirichlet-to-neumann map. International Mathematics Research Notices, 2005(17):1047–1061, 2005.
  25. [25]W. W. Symes. Migration velocity analysis and waveform inversion. Geophysical prospecting, 56(6):765–790, 2008.DOI
  26. [26]W. W. Symes. Error bounds for extended source inversion applied to an acoustic transmission inverse problem. Inverse Problems, 38(11):115002, 2022.DOI
  27. [27]T. L. Szabo. Diagnostic ultrasound imaging: inside out. Academic press, 2013.
  28. [28]A. Tether. Construction of minimal linear state-variable models from finite input-output data. IEEE Transactions on Automatic Control, 15(4):427–436, 1970.
  29. [29]T. Van Leeuwen and F. J. Herrmann. Mitigating local minima in full-waveform inversion by expanding the search space. Geophysical Journal International, 195(1):661–667, 2013.DOI
  30. [30]J. Virieux and S. Operto. An overview of full-waveform inversion in exploration geophysics. Geophysics, 2010.DOI
  31. [31]M. Warner and L. Guasch. Adaptive waveform inversion: Theory. Geophysics, 81(6):R429–R445, 2016.
  32. [32]Y. Yang, B. Engquist, J. Sun, and B. F. Hamfeldt. Application of optimal transport and the quadratic wasserstein metric to full-waveform inversion. Geophysics, 83(1):R43–R62, 2018.arxiv.org/abs/1612.05075
  33. [33]O. Yu. Imanuvilov and M. Yamamoto. Global uniqueness and stability in determining coefficients of wave equations. Communications in Partial Differential Equations, 26(7-8):1409–1425, 2001.

Paper details

vlnc:W_fydt944f
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents