A new algorithm for high-dimensional uncertainty quantification based on dimension-adaptive sparse grid approximation and reduced basis methods

Peng Chen, Alfio Quarteroni
Elsevier, 2015
Article

Résumé

In this work we develop an adaptive and reduced computational algorithm based on dimension-adaptive sparse grid approximation and reduced basis methods for solving highdimensional uncertainty quantification (UQ) problems. In order to tackle the computational challenge of "curse of dimensionality" commonly faced by these problems, we employ a dimension-adaptive tensor-product algorithm [16] and propose a verified version to enable effective removal of the stagnation phenomenon besides automatically detecting the importance and interaction of different dimensions. To reduce the heavy computational cost of UQ problems modelled by partial differential equations (PDE), we adopt a weighted reduced basis method [7] and develop an adaptive greedy algorithm in combination with the previous verified algorithm for efficient construction of an accurate reduced basis approximation. The efficiency and accuracy of the proposed algorithm are demonstrated by several numerical experiments. (C) 2015 Elsevier Inc. Allrightsreserved.

Official source

https://infoscience.epfl.ch/record/211960?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Concepts associés

Chargement

Publications associées

Chargement

Publications associées (11)

A multilevel Monte Carlo (MLMC) method for mean square stable stochastic differential equations with multiple scales is proposed. For such problems, that we call stiff, the performance of MLMC methods based on classical explicit methods deteriorates because of the time step restriction to resolve the fastest scales that prevents to exploit all the levels of the MLMC approach. We show that by switching to explicit stabilized stochastic methods and balancing the stabilization procedure simultaneously with the hierarchical sampling strategy of MLMC methods, the computational cost for stiff systems is significantly reduced, while keeping the computational algorithm fully explicit and easy to implement. Numerical experiments on linear and nonlinear stochastic differential equations and on a stochastic partial differential equation illustrate the performance of the stabilized MLMC method and corroborate our theoretical findings. (C) 2013 Elsevier Inc. All rights reserved.

Academic Press Inc Elsevier Science2013

Chargement

Several computational challenges arise when evaluating the failure probability of a given system in the context of risk prediction or reliability analysis. When the dimension of the uncertainties becomes high, well established direct numerical methods can not be employed because of the "curse-of-dimensionality". Many surrogate models have been proposed with the aim of reducing computational effort. However, most of them fail in computing an accurate failure probability when the limit state surface defined by the failure event in the probability space lacks smoothness. In addition, for a stochastic system modeled by partial differential equations (PDEs) with random input, only a limited number of the underlying PDEs (order of a few tens) are affordable to solve in practice due to the considerable computational effort, therefore preventing the application of many numerical methods especially for high dimensional random inputs. In this work we develop hybrid and goal-oriented adaptive reduced basis methods to tackle these challenges by accurately and efficiently computing the failure probability of a stochastic PDE. The curse-of-dimensionality is significantly alleviated by reduced basis approximation whose bases are constructed by goal-oriented adaptation. Moreover, an accurate evaluation of the failure probability for PDE system with solution of low regularity in probability space is guaranteed by the certified a posteriori error bound for the output approximation error. At the end of this paper we suitably extend our proposed method to deal with more general PDE models. Finally we perform several numerical experiments to illustrate its computational accuracy and efficiency. (C) 2013 Elsevier B.V. All rights reserved.

Elsevier Science Sa2013

Chargement

Analysis and numerical simulation of free surface flows

Alexandre Caboussat

Mathematical and numerical aspects of free surface flows are investigated. On one hand, the mathematical analysis of some free surface flows is considered. A model problem in one space dimension is first investigated. The Burgers equation with diffusion has to be solved on a space interval with one free extremity. This extremity is unknown and moves in time. An ordinary differential equation for the position of the free extremity of the interval is added in order to close the mathematical problem. Local existence in time and uniqueness results are proved for the problem with given domain, then for the free surface problem. A priori and a posteriori error estimates are obtained for the semi-discretization in space. The stability and the convergence of an Eulerian time splitting scheme are investigated. The same methodology is then used to study free surface flows in two space dimensions. The incompressible unsteady Navier-Stokes equations with Neumann boundary conditions on the whole boundary are considered. The whole boundary is assumed to be the free surface. An additional equation is used to describe the moving domain. Local existence in time and uniqueness results are obtained. On the other hand, a model for free surface flows in two and three space dimensions is investigated. The liquid is assumed to be surrounded by a compressible gas. The incompressible unsteady Navier-Stokes equations are assumed to hold in the liquid region. A volume-of-fluid method is used to describe the motion of the liquid domain. The velocity in the gas is disregarded and the pressure is computed by the ideal gas law in each gas bubble trapped by the liquid. A numbering algorithm is presented to recognize the bubbles of gas. Gas pressure is applied as a normal force on the liquid-gas interface. Surface tension effects are also taken into account for the simulation of bubbles or droplets flows. A method for the computation of the curvature is presented. Convergence and accuracy of the approximation of the curvature are discussed. A time splitting scheme is used to decouple the various physical phenomena. Numerical simulations are made in the frame of mould filling to show that the influence of gas on the free surface cannot be neglected. Curvature-driven flows are also considered.

EPFL2004

Chargement

Afficher plus

Analysis and numerical simulation of free surface flows

Alexandre Caboussat

EPFL2004