This paper is concerned with the mathematical analysis of an inverse random source problem for the time fractional diffusion equation, where the source is driven by a fractional Brownian motion. Given the random source, the direct problem is to study the stochastic time fractional diffusion equation. The inverse problem is to determine the statistical properties of the source from the expectation and variance of the final time data. For the direct problem, we show that it is well-posed and has a unique mild solution under a certain condition. For the inverse problem, the uniqueness is proved and the instability is characterized. The major ingredients of the analysis are based on the properties of the Mittag–Leffler function and the stochastic integrals associated with the fractional Brownian motion.
more »
« less
Inverse Elastic Scattering for a Random Source
Consider the inverse random source scattering problem for the two-dimensional time-harmonic elastic wave equation with a linear load. The source is modeled as a microlocally isotropic generalized Gaussian random function whose covariance operator is a classical pseudodifferential operator. The goal is to recover the principal symbol of the covariance operator from the displacement measured in a domain away from the source. For such a distributional source, we show that the direct problem has a unique solution by introducing an equivalent Lippmann--Schwinger integral equation. For the inverse problem, we demonstrate that, with probability one, the principal symbol of the covariance operator can be uniquely determined by the amplitude of the displacement averaged over the frequency band, generated by a single realization of the random source. The analysis employs the Born approximation, asymptotic expansions of the Green tensor, and microlocal analysis of the Fourier integral operators.
more »
« less
- Award ID(s):
- 1912704
- PAR ID:
- 10182373
- Date Published:
- Journal Name:
- SIAM journal on mathematical analysis
- Volume:
- 51
- ISSN:
- 0036-1410
- Page Range / eLocation ID:
- 4570-4603
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
We study two-state (dichotomous, telegraph) random ergodic continuous-time processes with dynamics depending on their past. We take into account the history of the process in an explicit form by introducing integral nonlocal memory term into conditional probability function. We start from an expression for the conditional transition probability function describing additive multistep binary random chain and show that the telegraph processes can be considered as continuous-time interpolations of discrete-time dichotomous random sequences. An equation involving the memory function and the two-point correlation function of the telegraph process is analytically obtained. This integral equation defines the correlation properties of the processes with given memory functions. It also serves as a tool for solving the inverse problem, namely for generation of a telegraph process with a prescribed pair correlation function. We obtain analytically the correlation functions of the telegraph processes with two exactly solvable examples of memory functions and support these results by numerical simulations of the corresponding telegraph processes. Published by the American Physical Society2024more » « less
-
In this paper, we consider the inverse scattering problem for recovering either an isotropic or anisotropic scatterer from the measured scattered field initiated by a point source. We propose two new imaging functionals for solving the inverse problem. The first one employs a 'far-field' transform to the data which we then use to derive and provide an explicit decay rate for the imaging functional. In order to analyze the behavior of this imaging functional we use the factorization of the near field operator as well as the Funk-Hecke integral identity. For the second imaging functional the Cauchy data is used to define the functional and its behavior is analyzed using the Green's identities. Numerical experiments are given in two dimensions for both isotropic and anisotropic scatterers.more » « less
-
Abstract We consider the mapping properties of the integral operator arising in nonlocal slender body theory (SBT) for the model geometry of a straight, periodic filament. It is well known that the classical singular SBT integral operator suffers from high wavenumber instabilities, making it unsuitable for approximating theslender body inverse problem, where the fiber velocity is prescribed and the integral operator must be inverted to find the force density along the fiber. Regularizations of the integral operator must therefore be used instead. Here, we consider two regularization methods: spectral truncation and the‐regularization of Tornberg and Shelley (2004). We compare the mapping properties of these approximations to the underlying partial differential equation (PDE) solution, which for the inverse problem is simply the Stokes Dirichlet problem with data constrained to be constant on cross sections. For the straight‐but‐periodic fiber with constant radius, we explicitly calculate the spectrum of the operator mapping fiber velocity to force for both the PDE and the approximations. We prove that the spectrum of the original SBT operator agrees closely with the PDE operator at low wavenumbers but differs at high frequencies, allowing us to define a truncated approximation with a wavenumber cutoff. For both the truncated and‐regularized approximations, we obtain rigorous‐based convergence to the PDE solution as: A fiber velocity withregularity givesconvergence, while a fiber velocity with at leastregularity yieldsconvergence. Moreover, we determine the dependence of the‐regularized error estimate on the regularization parameter.more » « less
-
Oja's algorithm for Streaming Principal Component Analysis (PCA) for n data-points in a d dimensional space achieves the same sin-squared error O(r𝖾𝖿𝖿/n) as the offline algorithm in O(d) space and O(nd) time and a single pass through the datapoints. Here r𝖾𝖿𝖿 is the effective rank (ratio of the trace and the principal eigenvalue of the population covariance matrix Σ). Under this computational budget, we consider the problem of sparse PCA, where the principal eigenvector of Σ is s-sparse, and r𝖾𝖿𝖿 can be large. In this setting, to our knowledge, \textit{there are no known single-pass algorithms} that achieve the minimax error bound in O(d) space and O(nd) time without either requiring strong initialization conditions or assuming further structure (e.g., spiked) of the covariance matrix. We show that a simple single-pass procedure that thresholds the output of Oja's algorithm (the Oja vector) can achieve the minimax error bound under some regularity conditions in O(d) space and O(nd) time. We present a nontrivial and novel analysis of the entries of the unnormalized Oja vector, which involves the projection of a product of independent random matrices on a random initial vector. This is completely different from previous analyses of Oja's algorithm and matrix products, which have been done when the r𝖾𝖿𝖿 is bounded.more » « less
An official website of the United States government

