scispace - formally typeset
Proceedings ArticleDOI

Probabilistic Collocation: An Efficient Non-Intrusive Approach for Arbitrarily Distributed Parametric Uncertainties

TLDR
The ProbabilisticCollocation method is introduced, which combines the non-intrusiveness of the Stochastic Collocation method with the exponential convergence for arbitrary probability distributions of the Galerkin Polynomial Chaos method.
Abstract
Complex o w and uid-structure interaction simulations require ecien t uncertainty quantication methods. In addition, a good property of an uncertainty quantication method is non-intrusiveness, meaning that existing deterministic solvers can be used for uncertainty quantication. In this paper the Probabilistic Collocation method is introduced, which combines the non-intrusiveness of the Stochastic Collocation method with the exponential convergence for arbitrary probability distributions of the Galerkin Polynomial Chaos method. Due to the non-intrusiveness and exponential convergence, the Probabilistic Collocation method requires only a few collocation points for a high accuracy. For the one dimensional piston problem the eciency of the Probabilistic Collocation method is compared with the Galerkin Polynomial Chaos method, the Non-Intrusive Polynomial Chaos method and the Stochastic Collocation method. The strength of the Probabilistic Collocation method is demonstrated by solving steady o w around a NACA0012 airfoil with an uncertain free stream velocity using a commercial o w solver. Dieren t possibilities of representing the stochastic solution are demonstrated to show the potential use of uncertainty quantication.

read more

Citations
More filters

Calculation of Gauss quadrature rules.

TL;DR: Two algorithms for generating the Gaussian quadrature rule defined by the weight function when: a) the three term recurrence relation is known for the orthogonal polynomials generated by $\omega$(t), and b) the moments of the weightfunction are known or can be calculated.
Proceedings ArticleDOI

Efficient Sampling for Non-Intrusive Polynomial Chaos Applications with Multiple Uncertain Input Variables

TL;DR: In this article, the accuracy and computational complexity of Point-Collocation Non-Intrusive Polynomial Chaos (NIPC) method applied to stochastic problems with multiple uncertain input variables has been investigated.
Journal ArticleDOI

Point-Collocation Nonintrusive Polynomial Chaos Method for Stochastic Computational Fluid Dynamics

TL;DR: In this article, a point-collocation non-intrusive polynomial chaos technique is used for uncertainty propagation in computational fluid dynamics simulations, where the input uncertainties are propagated with both the non-inrusive Polynomial Chaos method and Monte Carlo techniques to obtain the statistics of various output quantities.
Journal ArticleDOI

Bayesian estimates of parameter variability in the k-ε turbulence model

TL;DR: Estimates for the error in Reynolds-averaged Navier-Stokes (RANS) simulations based on the Launder-Sharma [email protected] turbulence closure model, for a limited class of flows are obtained.
Journal ArticleDOI

Predictive RANS simulations via Bayesian Model-Scenario Averaging

TL;DR: A stochastic, a posteriori error estimate, calibrated to specific classes of flow, based on variability in model closure coefficients across multiple flow scenarios, for multiple closure models is developed.
References
More filters
Book

Stochastic Finite Elements: A Spectral Approach

TL;DR: In this article, a representation of stochastic processes and response statistics are represented by finite element method and response representation, respectively, and numerical examples are provided for each of them.
Journal ArticleDOI

The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations

TL;DR: This work represents the stochastic processes with an optimum trial basis from the Askey family of orthogonal polynomials that reduces the dimensionality of the system and leads to exponential convergence of the error.
Journal ArticleDOI

The Homogeneous Chaos

Journal ArticleDOI

High-Order Collocation Methods for Differential Equations with Random Inputs

TL;DR: A high-order stochastic collocation approach is proposed, which takes advantage of an assumption of smoothness of the solution in random space to achieve fast convergence and requires only repetitive runs of an existing deterministic solver, similar to Monte Carlo methods.
Journal ArticleDOI

A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

TL;DR: A rigorous convergence analysis is provided and exponential convergence of the “probability error” with respect to the number of Gauss points in each direction in the probability space is demonstrated, under some regularity assumptions on the random input data.
Related Papers (5)