arXiv subjects

Emilia Blåsten

Publications and source records attributed to Emilia Blåsten.

12 recordsLinked to original sources

arXiv2026

Statistical comparison of reconstruction methods for the inverse boundary problem of the one-dimensional wave equation

Several numerical reconstruction algorithms for the inverse boundary value problem of the 1-dimensional wave equation exist. In this paper we revisit two of them, the Sondhi-Gopinath (SG) method from 1971 and the Korpela-Lassas-Oksanen (KLO) method from 2016. Our main contribution is a systematic and statistical comparison of the performance of these two well established methods. The stability of the SG algorithm, even in practical applications, is well known. KLO has a regularisation scheme with a theoretical proof, and is an evolution of the boundary control method. Both are based on the idea of constructing solutions that are characteristic functions of a set at a given time. This similarity has been pointed out before, but no systematic comparison has been published. We compare the performance of the two algorithms with noisy simulated data. The application in our mind is the reconstruction of the internal cross-sectional area of a pressurised fluid pipe. The area corresponds to the first order $\partial_x$-term of the wave equation. Instead of just observing the performance on a few test cases, we generate $n=1000$ random area profiles of various smoothness levels and measurement noise up to $10\%$ of the signal energy and perform statistical tests. SG and KLO have a difference of one time-derivative in their standard boundary data, which complicates the analysis. Our results show that SG performs better in the low noise regime, and KLO with high noise. SG is easier to implement and runs faster.

math.NA↗

arXiv2024

Inverse Problems for Screens

We study the inverse scattering from a screen with using only one incoming time--harmonic plane wave but with measurements of the scattered wave done at all directions. Especially we focus on the 2D--case i.e. (inverse) scattering from an open bounded smooth curve. Besides the inverse scattering problem we also study the inverse electrostatic problem. We then show that one Cauchy--data of any continuous and bounded function vanishing on the screen and harmonic outside it, determines the screen uniquely.

math.AP↗

arXiv2023

Gel'fand's inverse problem for the graph Laplacian

We study the discrete Gel'fand's inverse boundary spectral problem of determining a finite weighted graph. Suppose that the set of vertices of the graph is a union of two disjoint sets: $X=B\cup G$, where $B$ is called the set of the boundary vertices and $G$ is called the set of the interior vertices. We consider the case where the vertices in the set $G$ and the edges connecting them are unknown. Assume that we are given the set $B$ and the pairs $(λ_j,ϕ_j|_B)$, where $λ_j$ are the eigenvalues of the graph Laplacian and $ϕ_j|_B$ are the values of the corresponding eigenfunctions at the vertices in $B$. We show that the graph structure, namely the unknown vertices in $G$ and the edges connecting them, along with the weights, can be uniquely determined from the given data, if every boundary vertex is connected to only one interior vertex and the graph satisfies the following property: any subset $S\subseteq G$ of cardinality $|S|\geqslant 2$ contains two extreme points. A point $x\in S$ is called an extreme point of $S$ if there exists a point $z\in B$ such that $x$ is the unique nearest point in $S$ from $z$ with respect to the graph distance. This property is valid for several standard types of lattices and their perturbations.

math.SP↗

arXiv2023

Inverse problems for discrete heat equations and random walks for a class of graphs

We study the inverse problem of determining a finite weighted graph $(X,E)$ from the source-to-solution map on a vertex subset $B\subset X$ for heat equations on graphs, where the time variable can be either discrete or continuous. We prove that this problem is equivalent to the discrete version of the inverse interior spectral problem, provided that there does not exist a nonzero eigenfunction of the weighted graph Laplacian vanishing identically on $B$. In particular, we consider inverse problems for discrete-time random walks on finite graphs. We show that under a novel geometric condition (called the Two-Points Condition), the graph structure and the transition matrix of the random walk can be uniquely recovered from the distributions of the first passing times on $B$, or from the observation on $B$ of one realization of the random walk.

math.SP↗

arXiv2022

Inverse problems for locally perturbed lattices -- Discrete Hamiltonian and quantum graph

We consider the inverse scattering problems for two types of Schrödinger operators on locally perturbed periodic lattices. For the discrete Hamiltonian, the knowledge of the S-matrix for all energies determines the graph structure and the coefficients of the Hamiltonian. For locally perturbed equilateral metric graphs, the knowledge of the S-matrix for all energies determines the graph structure.

math-ph↗

arXiv2021

Cones with convoluted geometry that always scatter or radiate

We investigate fixed energy scattering from conical potentials having an irregular cross-section. The incident wave can be any arbitrary non-trivial Herglotz wave. We show that a large number of such local conical scatterers scatter all incident waves, meaning that the far-field will always be non-zero. In essence there are no incident waves for which these potentials would seem transparent at any given energy. We show more specifically that there is a large collection of star-shaped cones whose local geometries always produce a scattered wave. In fact, except for a countable set, all cones from a family of deformations between a circular and a star-shaped cone will always scatter any non-trivial incident Herglotz wave. Our methods are based on the use of spherical harmonics and a deformation argument. We also investigate the related problem for sources. In particular if the support of the source is locally a thin cone, with an arbitrary cross-section, then it will produce a non-zero far-field.

math.AP↗

arXiv2021

Scattering by curvatures, radiationless sources, transmission eigenfunctions and inverse scattering problems

We consider several intriguingly connected topics in the theory of wave propagation: geometrical characterizations of radiationless sources, non-radiating incident waves, interior transmission eigenfunctions, and their applications to inverse scattering. Our major novel discovery is a localization and geometrization property. We first show that a scatterer, which might be an active source or an inhomogeneous index of refraction, cannot be completely invisible if its support is small compared to the wavelength and scattering intensity. Next, we localize and geometrize the "smallness" results to the case where there is a high-curvature point on the boundary of the scatterer's support. We derive explicit bounds between the intensity of an invisible scatterer and its diameter or its curvature at the aforementioned point. These results can be used to characterize radiationless sources or non-radiating waves near high-curvature points. As significant applications we derive new intrinsic geometric properties of interior transmission eigenfunctions near high-curvature points. This is of independent interest in spectral theory. We further establish unique determination results for the single-wave Schiffer's problem in certain scenarios of practical interest, such as collections of well-separated small scatterers. These are the first results for Schiffer's problem with generic smooth scatterers.

math.AP↗

arXiv2020

Unique determination of the shape of a scattering screen from a passive measurement

We consider the problem of fixed frequency acoustic scattering from a sound-soft flat screen. More precisely the obstacle is restricted to a two-dimensional plane and interacting with a arbitrary incident wave, it scatters acoustic waves to three-dimensional space. The model is particularly relevant in the study and design of reflecting sonars and antennas, cases where one cannot assume that the incident wave is a plane wave. Our main result is that given the plane where the screen is located, the far-field pattern produced by any single arbitrary incident wave determines the exact shape of the screen, as long as it is not antisymmetric with respect to the plane. This holds even for screens whose shape is an arbitrary simply connected smooth domain. This is in contrast to earlier work where the incident wave had to be a plane wave, or more recent work where only polygonal scatterers are determined.

math.AP↗

arXiv2020

Recovering piecewise constant refractive indices by a single far-field pattern

We are concerned with the inverse scattering problem of recovering an inhomogeneous medium by the associated acoustic wave measurement. We prove that under certain assumptions, a single far-field pattern determines the values of a perturbation to the refractive index on the corners of its support. These assumptions are satisfied for example in the low acoustic frequency regime. As a consequence if the perturbation is piecewise constant with either a polyhedral nest geometry or a known polyhedral cell geometry, such as a pixel or voxel array, we establish the injectivity of the perturbation to far-field map given a fixed incident wave. This is the first unique determinancy result of its type in the literature, and all of the existing results essentially make use of infinitely many measurements.

math.AP↗

arXiv2019

Blockage detection in networks: the area reconstruction method

In this note we present a reconstructive algorithm for solving the cross-sectional pipe area from boundary measurements in a tree network with one inaccessbile end. This is equivalent to reconstructing the first order perturbation to a wave equation on a quantum graph from boundary measurements at all network ends except one. The method presented here is based on a time reversal boundary control method originally presented by Sondhi and Gopinath for one dimensional problems and later by Oksanen to higher dimensional manifolds. The algorithm is local, so is applicable to complicated networks if we are interested only in a part isomorphic to a tree. Moreover the numerical implementation requires only one matrix inversion or least squares minimization per discretization point in the physical network. We present a theoretical solution existence proof, a step-by-step algorithm, and a numerical implementation applied to two numerical experiments.

math.AP↗

arXiv2019

On an electromagnetic problem in a corner and its applications

Let $\mathcal{K}^{r_0}_{x_0}$ be a (non-degenerate) truncated corner in $\mathbb{R}^3$ with $x_0\in\mathbb{R}^3$ being its apex, and $\mathbf{F}_j\in C^α(\overline{\mathcal{K}^{r_0}_{x_0}}; \mathbb{C}^3)$, $j=1,2$, where $α$ is the positive Hölder index. Consider the following electromagnetic problem $$\left\{\begin{split} & \nabla\wedge \mathbf{E}-\mathrm{i}ωμ_0 \mathbf{H}=\mathbf{F}_{1} \quad \mbox{in $\mathcal{K}^{r_0}_{x_0}$},\\ & \, \nabla\wedge \mathbf{H}+\mathrm{i}ω\varepsilon_0 \mathbf{E}=\mathbf{F}_{2} \quad \mbox{in $\mathcal{K}^{r_0}_{x_0}$}, \\ &\, ν\wedge \mathbf{E}=ν\wedge\mathbf{H}=0 \qquad\mbox{on $\partial \mathcal{K}^{r_0}_{x_0}\setminus \partial B_{r_0}(x_0)$}, \end{split}\right.$$ where $ν$ denotes the exterior unit normal vector of $\partial \mathcal{K}^{r_0}_{x_0}$. We prove that $\mathbf{F}_1$ and $\mathbf{F}_2$ must vanish at the apex $x_0$. There are a series of interesting consequences of this vanishing property in several separate but intriguingly connected topics in electromagnetism. First, we can geometrically characterize non-radiating sources in time-harmonic electromagnetic scattering. Secondly, we consider the inverse source scattering problem for time-harmonic electromagnetic waves and establish the uniqueness result in determining the polyhedral support of a source by a single far-field measurement. Thirdly, we derive a property of the geometric structure of electromagnetic interior transmission eigenfunctions near corners. Finally, we also discuss its implication to invisibility cloaking.

math.AP↗

arXiv2019

Non-Scattering Energies and Transmission Eigenvalues in $\mathbb H^n$

We consider non-scattering energies and transmission eigenvalues of compactly supported potentials in the hyperbolic spaces $\mathbb H^n$. We prove that in $\mathbb H^2$ a corner bounded by two hyperbolic lines intersecting at an angle smaller than $180^\circ$ always scatters, and that one of the lines may be replaced by a horocycle. In higher dimensions, we obtain similar results for corners bounded by hyperbolic hyperplanes intersecting each other pairwise orthogonally, and that one of the hyperplanes may be replaced by a horosphere. The corner scattering results are contrasted by proving discreteness and existence results for the related transmission eigenvalue problems.

math.AP↗