Stochastic collocation methods via minimization using randomized quadratures
arXiv:1602.00995
Abstract
In this work, we discuss the problem of approximating a multivariate function via minimization method, using a random chosen sub-grid of the corresponding tensor grid of Gaussian points. The independent variables of the function are assumed to be random variables, and thus, the framework provides a non-intrusive way to construct the generalized polynomial chaos expansions, stemming from the motivating application of Uncertainty Quantification (UQ). We provide theoretical analysis on the validity of the approach. The framework includes both the bounded measures such as the uniform and the Chebyshev measure, and the unbounded measures which include the Gaussian measure. Several numerical examples are given to confirm the theoretical results.
arXiv comment25 pages, 8 figures
References in corpus (4)
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Compressive Sampling of Polynomial Chaos Expansions: Convergence Analysis and Sampling Strategies
- A generalized sampling and preconditioning scheme for sparse approximation of polynomial chaos expansions
- Stochastic collocation on unstructured multivariate meshes