Show simple item record

dc.contributor.authorNobile, Fabio
dc.contributor.authorHaji Ali, Abdul Lateef
dc.contributor.authorTamellini, Lorenzo
dc.contributor.authorTempone, Raul
dc.date.accessioned2017-06-08T06:32:30Z
dc.date.available2017-06-08T06:32:30Z
dc.date.issued2016-01-09
dc.identifier.urihttp://hdl.handle.net/10754/624871
dc.description.abstractIn this talk we consider the problem of computing statistics of the solution of a partial differential equation with random data, where the random coefficient is parametrized by means of a finite or countable sequence of terms in a suitable expansion. We describe and analyze a Multi-Index Monte Carlo (MIMC) and a Multi-Index Stochastic Collocation method (MISC). the former is both a stochastic version of the combination technique introduced by Zenger, Griebel and collaborators and an extension of the Multilevel Monte Carlo (MLMC) method first described by Heinrich and Giles. Instead of using firstorder differences as in MLMC, MIMC uses mixed differences to reduce the variance of the hierarchical differences dramatically. This in turn yields new and improved complexity results, which are natural generalizations of Giles s MLMC analysis, and which increase the domain of problem parameters for which we achieve the optimal convergence, O(TOL-2). On the same vein, MISC is a deterministic combination technique based on mixed differences of spatial approximations and quadratures over the space of random data. Provided enough mixed regularity, MISC can achieve better complexity than MIMC. Moreover, we show that in the optimal case the convergence rate of MISC is only dictated by the convergence of the deterministic solver applied to a one-dimensional spatial problem. We propose optimization procedures to select the most effective mixed differences to include in MIMC and MISC. Such optimization is a crucial step that allows us to make MIMC and MISC computationally effective. We finally show the effectiveness of MIMC and MISC with some computational tests, including tests with a infinite countable number of random parameters.
dc.titleMulti-Index Monte Carlo and stochastic collocation methods for random PDEs
dc.typePresentation
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.conference.dateJanuary 5-10, 2016
dc.conference.nameAdvances in Uncertainty Quantification Methods, Algorithms and Applications (UQAW 2016)
dc.conference.locationKAUST
dc.contributor.institutionÉcole Polytechnique Fédérale de Lausanne
dc.contributor.institutionUniversità di Pavia
kaust.personHaji Ali, Abdul Lateef
kaust.personTempone, Raul
refterms.dateFOA2018-06-14T03:40:40Z


Files in this item

This item appears in the following Collection(s)

Show simple item record