Data generated internal solutions for the plasma wave equation: error bounds and numerical experiments in two dimensions
Abstract
We consider the computation of internal solutions for a time domain plasma wave equation with an unknown potential $q$ from boundary response data. The internal solutions are computed by transforming known background snapshots using the Cholesky decomposition of the data-driven Gramian, or mass matrix. It was recently shown that in one dimension these data generated internal solutions converge in $L^2$ at order $\sqrtτ$ for well chosen initial waves. Here we study the internal solution reconstru...
Description / Details
We consider the computation of internal solutions for a time domain plasma wave equation with an unknown potential from boundary response data. The internal solutions are computed by transforming known background snapshots using the Cholesky decomposition of the data-driven Gramian, or mass matrix. It was recently shown that in one dimension these data generated internal solutions converge in at order for well chosen initial waves. Here we study the internal solution reconstruction in two dimensions, where a multiple input/multiple output (MIMO) setup and a block Gramian are needed, with the number of boundary sources increasing as the time sampling is refined. We show that the general error bound carries over to this setting: the distance between the data generated solutions and the best causal approximation from background snapshots is controlled by the best approximation mass matrix mismatch. Numerical refinement studies on a square domain measure the convergence of the data generated solutions alongside the best causal approximation from the background snapshots, with the relative errors appearing to go to zero at rate , and the absolute errors going to zero in . We also show that the solution reconstructions remain accurate for high contrast composite media. Finally, since the mass matrix assembled from noisy response data can fail to be positive definite, regularization is needed; comparing a diagonal shift with an eigenvalue floor, we find the floor more robust, with reconstructions that remain more accurate than the unperturbed background field with noise that is up to ten percent of the root mean square data amplitude.
Source: arXiv:2608.04989v1 - http://arxiv.org/abs/2608.04989v1 PDF: https://arxiv.org/pdf/2608.04989v1 Original Link: http://arxiv.org/abs/2608.04989v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Aug 6, 2026
Mathematics
Mathematics
0