Sparse Grid Stochastic Collocation Research Articles

Efficient Numerical Implementation of the Time-Fractional Stochastic Stokes–Darcy Model

This paper presents an efficient numerical method for the fractional-order generalization of the stochastic Stokes–Darcy model, which finds application in various engineering, biomedical and environmental problems involving interaction between free fluid flow and flows in porous media. Unlike the classical model, this model allows taking into account the hereditary properties of the process under uncertainty conditions. The proposed numerical method is based on the combined use of the sparse grid stochastic collocation method, finite element/finite difference discretization, a fast numerical algorithm for computing the Caputo fractional derivative, and a cost-effective ensemble strategy. The hydraulic conductivity tensor is assumed to be uncertain in this problem, which is modeled by the reduced Karhunen–Loève expansion. The stability and convergence of the deterministic numerical method have been rigorously proved and validated by numerical tests. Utilizing the ensemble strategy allowed us to solve the deterministic problem once for all samples of the hydraulic conductivity tensor, rather than solving it separately for each sample. The use of the algorithm for computing the fractional derivatives significantly reduced both computational cost and memory usage. This study also analyzes the influence of fractional derivatives on the fluid flow process within the fractional-order Stokes–Darcy model under uncertainty conditions.

Uncertainty modeling and propagation for groundwater flow: a comparative study of surrogates

We compare sparse grid stochastic collocation and Gaussian process emulation as surrogates for the parameter-to-observation map of a groundwater flow problem related to the Waste Isolation Pilot Plant in Carlsbad, NM. The goal is the computation of the probability distribution of a contaminant particle travel time resulting from uncertain knowledge about the transmissivity field. The latter is modelled as a lognormal random field which is fitted by restricted maximum likelihood estimation and universal kriging to observational data as well as geological information including site-specific trend regression functions obtained from technical documentation. The resulting random transmissivity field leads to a random groundwater flow and particle transport problem which is solved realization-wise using a mixed finite element discretization. Computational surrogates, once constructed, allow sampling the quantities of interest in the uncertainty analysis at substantially reduced computational cost. Special emphasis is placed on explaining the differences between the two surrogates in terms of computational realization and interpretation of the results. Numerical experiments are given for illustration.

Uncertainty quantification for Fisher-Kolmogorov equation on graphs with application to patient-specific Alzheimer's disease

The Fisher-Kolmogorov equation is a diffusion-reaction PDE that is used to model the accumulation of prionic proteins, which are responsible for many different neurological disorders. Likely, the most important and studied misfolded protein in literature is the Amyloid-$\beta$, responsible for the onset of Alzheimer disease. Starting from medical images we construct a reduced-order model based on a graph brain connectome. The reaction coefficient of the proteins is modelled as a stochastic random field, taking into account all the many different underlying physical processes, which can hardly be measured. Its probability distribution is inferred by means of the Monte Carlo Markov Chain method applied to clinical data. The resulting model is patient-specific and can be employed for predicting the disease's future development. Forward uncertainty quantification techniques (Monte Carlo and sparse grid stochastic collocation) are applied with the aim of quantifying the impact of the variability of the reaction coefficient on the progression of protein accumulation within the next 20 years.

Adaptive density-based robust topology optimization under uncertain loads using parallel computing

This work presents an efficient parallel implementation of density-based robust topology optimization (RTO) using adaptive mesh refinement (AMR) schemes permitting us to address the problem with modest computational resources. We use sparse grid stochastic collocation methods (SCMs) for transforming the RTO problem into a weighted multiple-loading deterministic problem at the collocation points. The calculation of these deterministic problems and the functional sensitivity is computationally expensive. We combine distributed-memory parallel computing and AMR techniques to address the problem efficiently. The former allows us to exploit the computational resources available, whereas the latter permits us to increase performance significantly. We propose the parallel incremental calculation of the deterministic problems and the contribution to the functional sensitivity maintaining a similar memory allocation to the one used in the deterministic counterpart. The cumulative computing uses buffers to adapt the evaluation at the collocation points to the parallel computing resources permitting the exploitation of the embarrassing parallelism of SCMs. We evaluate the deterministic problems in a coarse mesh generated for each topology optimization iteration to increase the performance. We perform the regularization and design variable update in a fine mesh to obtain an equivalent design to the one generated in such a mesh. We evaluate the proposal in two- and three-dimensional problems to test its feasibility and scalability. We also check the performance improvement using computational buffers in parallel computing nodes. Finally, we compare the proposal to the same approach using different preconditioners without AMR schemes showing significant performance improvements.

A stochastic collocation method based on sparse grids for a stochastic Stokes-Darcy model

<p style='text-indent:20px;'>In this paper, we develop a sparse grid stochastic collocation method to improve the computational efficiency in handling the steady Stokes-Darcy model with random hydraulic conductivity. To represent the random hydraulic conductivity, the truncated Karhunen-Loève expansion is used. For the discrete form in probability space, we adopt the stochastic collocation method and then use the Smolyak sparse grid method to improve the efficiency. For the uncoupled deterministic subproblems at collocation nodes, we apply the general coupled finite element method. Numerical experiment results are presented to illustrate the features of this method, such as the sample size, convergence, and randomness transmission through the interface.</p>

A Novel Method for Intrusive Stochastic Estimation of Geometric Tolerance Effects in Finite Element Electromagnetic Analysis

The robust design of microwave, millimeter-wave, or Terahertz components and structures incorporating manufacturing process tolerances would enhance the fabrication yield and thereby reduce the overall production cost. Based on the spectral stochastic finite element method (SSFEM) for material variations, a novel geometrical SSFEM (GSSFEM) is proposed to analyze dimensional uncertainty in 3-D microwave models. The Jacobian for Piola mapping is represented as a function of stochastic variables to capture mesh level uncertainties. Polynomial chaos expansion is used to approximate the electric field as a random process. The technique is validated by applying it to waveguide problems with uncertainty in geometric dimensions. GSSFEM results are compared with analytical formulations of the transmission coefficient for a physical insight and further with the Monte Carlo simulations for quantitative evaluation. The results using the proposed approach are in excellent agreement with conventional methods and are found to be faster than sparse grid stochastic collocation, while the scaling of the computational requirements with the number of degrees of freedom and stochastic dimension is as good as this efficient scheme. Furthermore, this approach has been employed to analyze uncertainty in multiple geometric parameters to compare their sensitivity. The proposed GSSFEM can be employed for analyzing the impact of fabrication tolerance of passive waveguide components at microwave frequencies and beyond.

A hybrid collocation-perturbation approach for PDEs with random domains.

Consider a linear elliptic PDE defined over a stochastic stochastic geometry a function of N random variables. In many application, quantify the uncertainty propagated to a Quantity of Interest (QoI) is an important problem. The random domain is split into large and small variations contributions. The large variations are approximated by applying a sparse grid stochastic collocation method. The small variations are approximated with a stochastic collocation-perturbation method and added as a correction term to the large variation sparse grid component. Convergence rates for the variance of the QoI are derived and compared to those obtained in numerical experiments. Our approach significantly reduces the dimensionality of the stochastic problem making it suitable for large dimensional problems. The computational cost of the correction term increases at most quadratically with respect to the number of dimensions of the small variations. Moreover, for the case that the small and large variations are independent the cost increases linearly.

Modeling and Simulation of Stochastic Inverse Problems in Viscoplasticity

In this paper, we have proposed an approach for parameter identification of random field for rigid viscoplastic material. It is assumed that the random field is stationary and Gaussian with known autocovariance function. Karhunen–Loève decomposition has been used to quantify the effects of random inputs. A method is presented that takes into account only the first two statistical moments of the analyzed displacement field, and only two values of searched process are identified—mean value and coefficient of variation in autocovariation function. It has been shown that this approach is desirable when complicated systems are analyzed. The discretization of the governing equations has been described by the finite element method. The sparse grid stochastic collocation method has been used to solve the stochastic direct problem. It is shown that for the described nonlinear equations, the response function due to searched parameters with wide bounds and with reduced number of measurement points has many local extrema and global optimization technique is required. Genetic algorithm has been adopted to compute the functional cost. Numerical example shows the identification problem for compressed cylindrical sample. It is revealed that the key factor determining the convergence of the method is the degree of reduction in the height of the tested sample.

A Sparse Grid Stochastic Collocation Discontinuous Galerkin Method for Constrained Optimal Control Problem Governed by Random Convection Dominated Diffusion Equations

A sparse grid stochastic collocation method combined with discontinuous Galerkin method is developed for solving convection dominated diffusion optimal control problem with random coefficients. By the optimal control theory, an optimality system is obtained for the problem, which consists of a state equation, a co-state equation and an inequality. Based on finite dimensional noise assumption of random field, the random coefficients are assumed to have finite term expansions depending on a finite number of mutually independent random variables in the probability space. An approximation scheme is established by using a discontinuous Galerkin method for the physical space and a sparse grid stochastic collocation method based on the Smolyak construction for the probability space, which leads to the solution of uncoupled deterministic problems. A priori error estimates are derived for the state, co-state and control variables. Numerical experiments are presented to illustrate the theoretical results.

Large-scale stochastic topology optimization using adaptive mesh refinement and coarsening through a two-level parallelization scheme

Topology optimization under uncertainty of large-scale continuum structures is a computational challenge due to the combination of large finite element models and uncertainty propagation methods. The former aims to address the ever-increasing complexity of more and more realistic models, whereas the latter is required to estimate the statistical metrics of the formulation. In this work, the computational burden of the problem is addressed using a sparse grid stochastic collocation method, to calculate the statistical metrics of the topology optimization under uncertainty formulation, and a parallel adaptive mesh refinement method, to efficiently solve each of the stochastic collocation nodes. A two-level parallel processing scheme (TOUU-PS2) is proposed to profit from parallel computation on distributed memory systems: the stochastic nodes are distributed through the distributed memory system, and the efficient computation of each stochastic node is performed partitioning the problem using a domain decomposition strategy and solving each subdomain using an adaptive mesh refinement method. A dynamic load-balancing strategy is used to balance the workload between subdomains, and thus increasing the parallel performance by reducing processor idle time. The topology optimization problem is addressed using the topological derivative concept in combination with a level-set method. The performance and scalability of the proposed methodology are evaluated using several numerical benchmarks and real-world applications, showing good performance and scalability up to thousands of processors.

A Sparse Grid Stochastic Collocation and Finite Volume Element Method for Constrained Optimal Control Problem Governed by Random Elliptic Equations

A Sparse Grid Stochastic Collocation and Finite Volume Element Method for Constrained Optimal Control Problem Governed by Random Elliptic Equations

Evolutionary topology optimization of continuum structures under uncertainty using sensitivity analysis and smooth boundary representation

This paper presents an evolutionary approach for the Robust Topology Optimization (RTO) of continuum structures under loading and material uncertainties. The method is based on an optimality criterion obtained from the stochastic linear elasticity problem in its weak form. The smooth structural topology is determined implicitly by an iso-value of the optimality criterion field. This iso-value is updated using an iterative approach to reach the solution of the RTO problem. The proposal permits to model the uncertainty using random variables with different probability distributions as well as random fields. The computational burden, due to the high dimension of the random field approximation, is efficiently addressed using anisotropic sparse grid stochastic collocation methods. The numerical results show the ability of the proposal to provide smooth and clearly defined structural boundaries. Such results also show that the method provides structural designs satisfying a trade-off between conflicting objectives in the RTO problem.

Propagation of Parametric Uncertainties in a Nonlinear Aeroelastic System Using an Improved Adaptive Sparse Grid Quadrature Routine

A novel uncertainty quantification routine in the genre of adaptive sparse grid stochastic collocation (SC) has been proposed in this study to investigate the propagation of parametric uncertainties in a stall flutter aeroelastic system. In a hypercube stochastic domain, presence of strong nonlinearities can give way to steep solution gradients that can adversely affect the convergence of nonadaptive sparse grid collocation schemes. A new adaptive scheme is proposed here that allows for accelerated convergence by clustering more discretization points in regimes characterized by steep fronts, using hat-like basis functions with nonequidistant nodes. The proposed technique has been applied on a nonlinear stall flutter aeroelastic system to quantify the propagation of multiparametric uncertainty from both structural and aerodynamic parameters. Their relative importance on the stochastic response is presented through a sensitivity analysis.

A Sparse Grid Stochastic Collocation Upwind Finite Volume Element Method for the Constrained Optimal Control Problem Governed by Random Convection Diffusion Equations

In this paper, we deal with an optimal control problem governed by the convection diffusion equations with random field in its coefficients. Mathematically, we prove the necessary and sufficient optimality conditions for the optimal control problem. Computationally, we establish a scheme to approximate the optimality system through the discretization by the upwind finite volume element method for the physical space, and by the sparse grid stochastic collocation algorithm based on the Smolyak construction for the probability space, which leads to the discrete solution of uncoupled deterministic problems. Moreover, the existence and uniqueness of the discrete solution are given. A priori error estimates are derived for the state, the co-state and the control variables. Numerical examples are presented to illustrate our theoretical results.

Risk-averse structural topology optimization under random fields using stochastic expansion methods

This work proposes a level-set based approach for solving risk-averse structural topology optimization problems considering random field loading and material uncertainty. The use of random fields increases the dimensionality of the stochastic domain, which poses several computational challenges related to the minimization of the Excess Probability as a measure of risk awareness. This problem is addressed both from the theoretical and numerical viewpoints. First, an existence result under a typical geometrical constraint on the set of admissible shapes is proved. Second, a level-set continuous approach to find the numerical solution of the problem is proposed. Since the considered cost functional has a discontinuous integrand, the numerical approximation of the functional and its sensitivity combine an adaptive anisotropic Polynomial Chaos (PC) approach with a Monte-Carlo (MC) sampling method for uncertainty propagation. Furthermore, to address the increment of dimensionality induced by the random field, an anisotropic sparse grid stochastic collocation method is used for the efficient computation of the PC coefficients. A key point is that the non-intrusive nature of such an approach facilitates the use of High Performance Computing (HPC) to alleviate the computational burden of the problem. Several numerical experiments including random field loading and material uncertainty are presented to show the feasibility of the proposal.

Efficient Reduced Basis Methods for Saddle Point Problems with Applications in Groundwater Flow

Reduced basis methods (RBMs) are recommended to reduce the computational cost of solving parameter-dependent PDEs in scenarios where many choices of parameters need to be considered, for example, in uncertainty quantification (UQ). A reduced basis is constructed during a computationally demanding offline (or set-up) stage that allows the user to obtain cheap approximations for parameter choices of interest, online. In this paper we consider RBMs for parameter-dependent saddle point problems, in particular the one that arises in the mixed formulation of the Darcy flow problem in groundwater flow modeling. We apply a discrete empirical interpolation method (DEIM) to approximate the inverse of the diffusion coefficient, which depends nonaffinely on the system parameters. We develop an efficient RBM that exploits the DEIM approximation and combine it with a sparse grid stochastic collocation mixed finite element method (SCMFEM) to construct a surrogate solution, which then allows for efficient forward UQ. Through numerical experiments we demonstrate that significant computational savings can be made when we use the RB-DEIM-SCMFEM scheme over standard high fidelity methods. For groundwater flow problems, we provide a thorough cost assessment of the new method and show how the size of the reduced basis, and hence, the extent of the savings, depends on the statistical properties of the input parameters.

Large-scale robust topology optimization using multi-GPU systems

Robust topology optimization of continuum structures is an intensive computational task due to the use of uncertainty propagation methods to estimate the statistical metrics within the topology optimization process. Such a computational problem is exacerbated for large finite element (FE) models in terms of memory consumption and processing time. For these reasons, the efficient resolution of robust topology optimization with large models remains an important computational challenge. This work aims to alleviate these computational constraints proposing a well-suited strategy for Graphics Processing Unit (GPU) computing. Such a proposal exploits the multilevel parallelism provided by multi-GPU systems for the parallel execution both within FE models and through uncertainty propagation methods. Task-level parallelism is used to concurrently evaluate the independent simulation models arising from a sparse grid stochastic collocation method. Data-level parallelism with different granularities is then exploited for the efficient resolution of each simulation model and the computation required by the topology optimization process. The resolution of the different calculations of robust topology optimization pipeline using multi-GPU systems are compared to the classically used multi-CPU implementation achieving significant speedups.

A stochastic model reduction method for nonlinear unconfined flow with multiple random input fields

In this paper we present a stochastic model reduction method for efficiently solving nonlinear unconfined flow problems in heterogeneous random porous media. The input random fields of flow model are parameterized in a stochastic space for simulation. This often results in high stochastic dimensionality due to small correlation length of the covariance functions of the input fields. To efficiently treat the high-dimensional stochastic problem, we extend a recently proposed hybrid high-dimensional model representation (HDMR) technique to high-dimensional problems with multiple random input fields and integrate it with a sparse grid stochastic collocation method (SGSCM). Hybrid HDMR can decompose the high-dimensional model into a moderate M-dimensional model and a few one-dimensional models. The moderate dimensional model only depends on the most M important random dimensions, which are identified from the full stochastic space by sensitivity analysis. To extend the hybrid HDMR, we consider two different criteria for sensitivity test. Each of the derived low-dimensional stochastic models is solved by the SGSCM. This leads to a set of uncoupled deterministic problems at the collocation points, which can be solved by a deterministic solver. To demonstrate the efficiency and accuracy of the proposed method, a few numerical experiments are carried out for the unconfined flow problems in heterogeneous porous media with different correlation lengths. The results show that a good trade-off between computational complexity and approximation accuracy can be achieved for stochastic unconfined flow problems by selecting a suitable number of the most important dimensions in the M-dimensional model of hybrid HDMR.

Robust optimal Robin boundary control for the transient heat equation with random input data

SummaryThe problem of robust optimal Robin boundary control for a parabolic partial differential equation with uncertain input data is considered. As a measure of robustness, the variance of the random system response is included in two different cost functionals. Uncertainties in both the underlying state equation and the control variable are quantified through random fields. The paper is mainly concerned with the numerical resolution of the problem. To this end, a gradient‐based method is proposed considering different functional costs to achieve the robustness of the system. An adaptive anisotropic sparse grid stochastic collocation method is used for the numerical resolution of the associated state and adjoint state equations. The different functional costs are analysed in terms of computational efficiency and its capability to provide robust solutions. Two numerical experiments illustrate the performance of the algorithm. Copyright © 2016 John Wiley & Sons, Ltd.

Analytic regularity and collocation approximation for elliptic PDEs with random domain deformations

In this work we consider the problem of approximating the statistics of a given Quantity of Interest (QoI) that depends on the solution of a linear elliptic PDE defined over a random domain parameterized by N random variables. The elliptic problem is remapped onto a corresponding PDE with a fixed deterministic domain. We show that the solution can be analytically extended to a well defined region in CN with respect to the random variables. A sparse grid stochastic collocation method is then used to compute the mean and variance of the QoI. Finally, convergence rates for the mean and variance of the QoI are derived and compared to those obtained in numerical experiments.