[HTML][HTML] Chaospy: An open source tool for designing methods of uncertainty quantification

J Feinberg, HP Langtangen - Journal of Computational Science, 2015 - Elsevier
The paper describes the philosophy, design, functionality, and usage of the Python software
toolbox Chaospy for performing uncertainty quantification via polynomial chaos expansions …

Stochastic finite element methods for partial differential equations with random input data

MD Gunzburger, CG Webster, G Zhang - Acta Numerica, 2014 - cambridge.org
The quantification of probabilistic uncertainties in the outputs of physical, biological, and
social systems governed by partial differential equations with random inputs require, in …

A stochastic collocation method for elliptic partial differential equations with random input data

I Babuška, F Nobile, R Tempone - SIAM review, 2010 - SIAM
This work proposes and analyzes a stochastic collocation method for solving elliptic partial
differential equations with random coefficients and forcing terms. These input data are …

Learning smooth functions in high dimensions: from sparse polynomials to deep neural networks

B Adcock, S Brugiapaglia, N Dexter… - arXiv preprint arXiv …, 2024 - arxiv.org
Learning approximations to smooth target functions of many variables from finite sets of
pointwise samples is an important task in scientific computing and its many applications in …

Stochastic testing method for transistor-level uncertainty quantification based on generalized polynomial chaos

Z Zhang, TA El-Moselhy, IM Elfadel… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
Uncertainties have become a major concern in integrated circuit design. In order to avoid the
huge number of repeated simulations in conventional Monte Carlo flows, this paper presents …

A multilevel stochastic collocation method for partial differential equations with random input data

AL Teckentrup, P Jantsch, CG Webster… - SIAM/ASA Journal on …, 2015 - SIAM
Stochastic collocation methods for approximating the solution of partial differential equations
with random input data (eg, coefficients and forcing terms) suffer from the curse of …

Fast estimation of expected information gains for Bayesian experimental designs based on Laplace approximations

Q Long, M Scavino, R Tempone, S Wang - Computer Methods in Applied …, 2013 - Elsevier
Shannon-type expected information gain can be used to evaluate the relevance of a
proposed experiment subjected to uncertainty. The estimation of such gain, however, relies …

On the optimal polynomial approximation of stochastic PDEs by Galerkin and collocation methods

J Beck, R Tempone, F Nobile… - Mathematical Models and …, 2012 - World Scientific
In this work we focus on the numerical approximation of the solution u of a linear elliptic PDE
with stochastic coefficients. The problem is rewritten as a parametric PDE and the functional …

Constructing least-squares polynomial approximations

L Guo, A Narayan, T Zhou - SIAM Review, 2020 - SIAM
Polynomial approximations constructed using a least-squares approach form a ubiquitous
technique in numerical computation. One of the simplest ways to generate data for least …

Multi-index stochastic collocation for random PDEs

AL Haji-Ali, F Nobile, L Tamellini, R Tempone - Computer Methods in …, 2016 - Elsevier
In this work we introduce the Multi-Index Stochastic Collocation method (MISC) for
computing statistics of the solution of a PDE with random data. MISC is a combination …