Junshan Lin

h-index17
2papers
1,064citations

2 Papers

1.2NAJun 13, 2018
An efficient Monte Carlo interior penalty discontinuous Galerkin method for the time-harmonic Maxwell's equations with random coefficients

Xiaobing Feng, Junshan Lin, Cody Lorton

This paper develops an efficient Monte Carlo interior penalty discontinuous Galerkin method for electromagnetic wave propagation in random media. This method is based on a multi-modes expansion of the solution to the time-harmonic random Maxwell equations. It is shown that each mode function satisfies a Maxwell system with random sources defined recursively. An unconditionally stable IP-DG method is employed to discretize the nearly deterministic Maxwell system and the Monte Carlo method combined with an efficient acceleration strategy is proposed for computing the mode functions and the statistics of the electromagnetic wave. A complete error analysis is established for the proposed multi-modes Monte Carlo IP-DG method. It is proved that the proposed method converges with an optimal order for each of three levels of approximations. Numerical experiments are provided to validate the theoretical results and to gauge the performance of the proposed numerical method and approach.

3.8NAJun 28
A Multi-Level Machine Learning Framework for Inverse Scattering Problems with Multi-Frequency Data

Yi Liu, Yanzhao Cao, Junshan Lin et al.

In this work, we propose a multi-level machine learning framework for solving inverse scattering problems with multi-frequency data. The multi-level neural network is built along the frequency axis of the scattering problem, wherein at each fixed frequency, a new level of network is added to the existing architecture to update the reconstruction. By marching through the frequency levels, the proposed multi-level computational framework is able to obtain higher-order Fourier modes of the imaging target as the depth of the neural network grows and higher-frequency data are used. Furthermore, the overall learning problem is decomposed into a sequence of simpler local tasks, each associated with a single frequency. This decomposition significantly reduces the complexity of the optimization problem and mitigates the risk of convergence to undesirable local minima, resulting in a robust and reliable training procedure for solving inverse scattering problems. We conduct various numerical experiments for the inverse source scattering problem and the inverse medium scattering problem to illustrate the effectiveness and robustness of the proposed machine learning framework. In addition, theoretical analysis in the neural tangent kernel regime shows that the proposed multi-level architecture progressively recovers the higher-order Fourier components of the imaging target.