Assessing the Performance of Leja and Clenshaw-Curtis Collocation for Computational Electromagnetics with Random Input Data

12/19/2017
by   Dimitrios Loukrezis, et al.
0

We consider the problem of quantifying uncertainty regarding the output of an electromagnetic field problem in the presence of a large number of uncertain input parameters. In order to reduce the growth in complexity with the number of dimensions, we employ a dimension-adaptive stochastic collocation method based on nested univariate nodes. We examine the accuracy and performance of collocation schemes based on Clenshaw-Curtis and Leja rules, for the cases of uniform and bounded, non-uniform random inputs, respectively. Based on numerical experiments with an academic electromagnetic field model, we compare the two rules in both the univariate and multivariate case and for both quadrature and interpolation purposes. Results for a real-world electromagnetic field application featuring high-dimensional input uncertainty are also presented.

READ FULL TEXT
research
10/26/2019

The Vlasov-Fokker-Planck Equation with High Dimensional Parametric Forcing Term

We consider the Vlasov-Fokker-Planck equation with random electric field...
research
12/15/2017

Revisit Sparse Polynomial Interpolation based on Randomized Kronecker Substitution

In this paper, a new reduction based interpolation algorithm for black-b...
research
02/20/2020

Improving Sampling Accuracy of Stochastic Gradient MCMC Methods via Non-uniform Subsampling of Gradients

Common Stochastic Gradient MCMC methods approximate gradients by stochas...
research
08/22/2022

A Filon-Clenshaw-Curtis-Smolyak rule for multi-dimensional oscillatory integrals with application to a UQ problem for the Helmholtz equation

In this paper, we combine the Smolyak technique for multi-dimensional in...
research
01/21/2015

Lazier ABC

ABC algorithms involve a large number of simulations from the model of i...

Please sign up or login with your details

Forgot password? Click here to reset