Search arXivSearch

arXiv · 2103.12472

Non-intrusive reduced order modeling of parametric electromagnetic scattering problems through Gaussian process regression

Abstract

This paper is concerned with the design of a non-intrusive model order reduction (MOR) for the system of parametric time-domain Maxwell equations. A time- and parameter-independent reduced basis (RB) is constructed by using a two-step proper orthogonal decomposition (POD) technique from a collection of full-order electromagnetic field solutions, which are generated via a discontinuous Galerkin time-domain (DGTD) solver. The mapping between the time/parameter values and the projection coefficients onto the RB space is approximated by a Gaussian process regression (GPR). Based on the data characteristics of electromagnetic field solutions, the singular value decomposition (SVD) is applied to extract the principal components of the training data of each projection coefficient, and the GPR models are trained for time- and parameter-modes respectively, by which the final global regression function can be represented as a linear combination of these time- and parameter-Gaussian processes. The extraction of the RB and the training of GPR surrogate models are both completed in the offline stage. Then the field solution at any new input time/parameter point can be directly recovered in the online stage as a linear combination of the RB with the regression outputs as the coefficients. In virtue of its non-intrusive nature, the proposed POD-GPR framework, which is equation-free, decouples the offline and online stages completely, and hence can predict the electromagnetic solution fields at unseen parameter locations quickly and effectively. The performance of our method is illustrated by a scattering problem of a multi-layer dielectric cylinder.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ying Zhao, Liang Li, Kun Li. 2021-03-23. Non-intrusive reduced order modeling of parametric electromagnetic scattering problems through Gaussian process regression. https://arxiv.org/abs/2103.12472

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA