2000 character limit reached
Space and Chaos-Expansion Galerkin POD Low-order Discretization of PDEs for Uncertainty Quantification
Published 2 Sep 2020 in math.DS, cs.NA, and math.NA | (2009.01055v1)
Abstract: The quantification of multivariate uncertainties in partial differential equations can easily exceed any computing capacity unless proper measures are taken to reduce the complexity of the model. In this work, we propose a multidimensional Galerkin Proper Orthogonal Decomposition that optimally reduces each dimension of a tensorized product space. We provide the analytical framework and results that define and quantify the low-dimensional approximation. We illustrate its application for uncertainty modeling with Polynomial Chaos Expansions and show its efficiency in a numerical example.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.