pith. sign in

arxiv: 1812.04387 · v4 · pith:OQCKHCUXnew · submitted 2018-12-11 · 🧮 math.NA · cs.NA

Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs

classification 🧮 math.NA cs.NA
keywords high-dimensionalrecoverytensoradaptiveapproachmodelrandomrank
0
0 comments X
read the original abstract

This work proposes a systematic model reduction approach based on rank adaptive tensor recovery for partial differential equation (PDE) models with high-dimensional random parameters. Since the standard outputs of interest of these models are discrete solutions on given physical grids which are high-dimensional, we use kernel principal component analysis to construct stochastic collocation approximations in reduced dimensional spaces of the outputs. To address the issue of high-dimensional random inputs, we develop a new efficient rank adaptive tensor recovery approach to compute the collocation coefficients. Novel efficient initialization strategies for non-convex optimization problems involved in tensor recovery are also developed in this work. We present a general mathematical framework of our overall model reduction approach, analyze its stability, and demonstrate its efficiency with numerical experiments.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.