Show simple item record

dc.contributor.authorDolgov, Sergey*
dc.contributor.authorKhoromskij, Boris N.*
dc.contributor.authorLitvinenko, Alexander*
dc.contributor.authorMatthies, Hermann G.*
dc.identifier.citationPolynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Format 2015, 3 (1):1109 SIAM/ASA Journal on Uncertainty Quantificationen
dc.description.abstractWe apply the tensor train (TT) decomposition to construct the tensor product polynomial chaos expansion (PCE) of a random field, to solve the stochastic elliptic diffusion PDE with the stochastic Galerkin discretization, and to compute some quantities of interest (mean, variance, and exceedance probabilities). We assume that the random diffusion coefficient is given as a smooth transformation of a Gaussian random field. In this case, the PCE is delivered by a complicated formula, which lacks an analytic TT representation. To construct its TT approximation numerically, we develop the new block TT cross algorithm, a method that computes the whole TT decomposition from a few evaluations of the PCE formula. The new method is conceptually similar to the adaptive cross approximation in the TT format but is more efficient when several tensors must be stored in the same TT representation, which is the case for the PCE. In addition, we demonstrate how to assemble the stochastic Galerkin matrix and to compute the solution of the elliptic equation and its postprocessing, staying in the TT format. We compare our technique with the traditional sparse polynomial chaos and the Monte Carlo approaches. In the tensor product polynomial chaos, the polynomial degree is bounded for each random variable independently. This provides higher accuracy than the sparse polynomial set or the Monte Carlo method, but the cardinality of the tensor product set grows exponentially with the number of random variables. However, when the PCE coefficients are implicitly approximated in the TT format, the computations with the full tensor product polynomial set become possible. In the numerical experiments, we confirm that the new methodology is competitive in a wide range of parameters, especially where high accuracy and high polynomial degrees are required.en
dc.publisherSociety for Industrial & Applied Mathematics (SIAM)en
dc.rightsArchived with thanks to SIAM/ASA Journal on Uncertainty Quantificationen
dc.subjectuncertainty quantificationen
dc.subjectpolynomial chaos expansionen
dc.subjectKarhunen-Lo`eve expansionen
dc.subjectstochastic Galerkinen
dc.subjecttensor product methodsen
dc.subjecttensor train formaten
dc.subjectadaptive cross approximationen
dc.subjectblock crossen
dc.titlePolynomial Chaos Expansion of Random Coefficients and the Solution of Stochastic Partial Differential Equations in the Tensor Train Formaten
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division*
dc.identifier.journalSIAM/ASA Journal on Uncertainty Quantificationen
dc.eprint.versionPublisher's Version/PDFen
dc.contributor.institutionMax-Planck-Institut fur Dynamik komplexer technischer Systeme, Sandtorstr. 1, 39106 Magdeburg, Germany*
dc.contributor.institutionMax-Planck-Institut fur Mathematik in den Naturwissenschaften, Inselstraße 22, 04103 Leipzig, Germany*
dc.contributor.institutionInstitute for Scientific Computing, Technische Universitat Braunschweig, Hans-Sommerstr. 65, Brunswick, Germany*
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)*
kaust.authorLitvinenko, Alexander*

Files in this item

Final Publisher Version

This item appears in the following Collection(s)

Show simple item record


*Selected version