High-Order Collocation Methods for Differential Equations with Random Inputs

Abstract

Abstract.Recently there has been a growing interest in designing efficient methods for the solution of ordinary/partial differential equations with random inputs. To this end, stochastic Galerkin methods appear to be superior to other nonsampling methods and, in many cases, to several sampling methods. However, when the governing equations take complicated forms, numerical implementations of stochastic Galerkin methods can become nontrivial and care is needed to design robust and efficient solvers for the resulting equations. On the other hand, the traditional sampling methods, e.g., Monte Carlo methods, are straightforward to implement, but they do not offer convergence as fast as stochastic Galerkin methods. In this paper, a high-order stochastic collocation approach is proposed. Similar to stochastic Galerkin methods, the collocation methods take advantage of an assumption of smoothness of the solution in random space to achieve fast convergence. However, the numerical implementation of stochastic collocation is trivial, as it requires only repetitive runs of an existing deterministic solver, similar to Monte Carlo methods. The computational cost of the collocation methods depends on the choice of the collocation points, and we present several feasible constructions. One particular choice, based on sparse grids, depends weakly on the dimensionality of the random space and is more suitable for highly accurate computations of practical applications with large dimensional random inputs. Numerical examples are presented to demonstrate the accuracy and efficiency of the stochastic collocation methods.

A Trust-Region Algorithm with Adaptive Stochastic Collocation for PDE Optimization under Uncertainty

“…The material in this section is based on previous work by many authors, including [26,28,6,3,46,48,66].…”

Sensitivity analysis and model order reduction for random linear dynamical systems

“…Theoretically, the feasible set of constants r 0 may become tiny in probability if all ω ∈ I ω are considered. Thus the determination of a suitable r 0 would require to draw many random numbers and to check the error (27). Nevertheless, the set of reasonable constants r 0 often exhibits a relatively high probability due to the correlations between the different frequencies.…”

“…The aim is that the error (27) satisfies e(iω, r 0 ) < θ with a tolerance θ > 0 for all ω ∈ I ω and some fixed r 0 . Let f be the real part or imaginary part of the transfer function.…”

Airfoil Analysis with Uncertain Geometry Using the Probabilistic Collocation Method

“…12 If multiple uncertain parameters are present, the collocation points are found using tensor products of one dimensional points or using a sparse grid approach. 13 A stochastic computation is now performed as follows:…”