Robust Adaptive Least Squares Polynomial Chaos Expansions in High-Frequency Applications

Abstract

We present an algorithm for computing sparse, least squares-based polynomial chaos expansions, incorporating both adaptive polynomial bases and sequential experimental designs. The algorithm is employed to approximate stochastic high-frequency electromagnetic models in a black-box way, in particular, given only a dataset of random parameter realizations and the corresponding observations regarding a quantity of interest, typically a scattering parameter. The construction of the polynomial basis is based on a greedy, adaptive, sensitivity-related method. The sequential expansion of the experimental design employs different optimality criteria, with respect to the algebraic form of the least squares problem. We investigate how different conditions affect the robustness of the derived surrogate models, that is, how much the approximation accuracy varies given different experimental designs. It is found that relatively optimistic criteria perform on average better than stricter ones, yielding superior approximation accuracies for equal dataset sizes. However, the results of strict criteria are significantly more robust, as reduced variations regarding the approximation accuracy are obtained, over a range of experimental designs. Two criteria are proposed for a good accuracy-robustness trade-off.

arXiv comment17 pages, 7 figures, 2 tables

References in corpus (11)

• A non-adapted sparse approximation of PDEs with stochastic inputs
• Compressive Sampling of Polynomial Chaos Expansions: Convergence Analysis and Sampling Strategies
• A weighted L1-minimization approach for sparse polynomial chaos expansions
• Enhancing ${\ell }_1$-minimization estimates of polynomial chaos expansions using basis selection
• Least Squares Polynomial Chaos Expansion: A Review of Sampling Strategies
• Coherence Motivated Sampling and Convergence Analysis of Least-Squares Polynomial Chaos Regression
• Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions
• Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design
• Non-intrusive Low-Rank Separated Approximation of High-Dimensional Stochastic Models
• Assessing the Performance of Leja and Clenshaw-Curtis Collocation for Computational Electromagnetics with Random Input Data
• Influence of spatial dispersion on surface plasmons, nanoparticles and grating couplers

Cited by in corpus (6)

• On the influence of over-parameterization in manifold based surrogates and deep neural operators
• Multivariate sensitivity-adaptive polynomial chaos expansion for high-dimensional surrogate modeling and uncertainty quantification
• An $hp$-adaptive multi-element stochastic collocation method for surrogate modeling with information re-use
• Power Module Heat Sink Design Optimization with Ensembles of Data-Driven Polynomial Chaos Surrogate Models
• Approximation and Uncertainty Quantification of Systems with Arbitrary Parameter Distributions using Weighted Leja Interpolation
• A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems