Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs

Liao, Qifeng; Lin, Guang

doi:10.1016/j.jcp.2016.04.029

Title: Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs

Full Record
Other Related Research

Authors:

Liao, Qifeng;

Publication Date:: Fri Jul 01 00:00:00 EDT 2016

Sponsoring Org.:: USDOE

OSTI Identifier:: 1347627

Resource Type:: Publisher's Accepted Manuscript

Journal Name:: Journal of Computational Physics

Additional Journal Information:: Journal Name: Journal of Computational Physics Journal Volume: 317 Journal Issue: C; Journal ID: ISSN 0021-9991

Publisher:: Elsevier

Country of Publication:: United States

Language:: English

Citation Formats


                    Liao, Qifeng, and Lin, Guang. Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs.  United States: N. p., 2016. 
Web.  doi:10.1016/j.jcp.2016.04.029.

Copy to clipboard


                    Liao, Qifeng, & Lin, Guang. Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs.  United States.  https://doi.org/10.1016/j.jcp.2016.04.029

Copy to clipboard


                    Liao, Qifeng, and Lin, Guang. Fri .  
"Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs".  United States.  https://doi.org/10.1016/j.jcp.2016.04.029.

Copy to clipboard


                    
@article{osti_1347627,

  title        = {Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs},

  author       = {Liao, Qifeng and Lin, Guang},

  abstractNote = {},

  doi          = {10.1016/j.jcp.2016.04.029},

  journal      = {Journal of Computational Physics},

  number       = C,

  volume       = 317,

  place        = {United States},

  year         = {Fri Jul 01 00:00:00 EDT 2016},

  month        = {Fri Jul 01 00:00:00 EDT 2016}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (Publisher)

Publisher's Version of Record
https://doi.org/10.1016/j.jcp.2016.04.029

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 9 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Similar Records in DOE PAGES and OSTI.GOV collections:

Reduced basis ANOVA methods for partial differential equations with high-dimensional random inputs

Journal Article Liao, Qifeng ; Lin, Guang - Journal of Computational Physics

In this paper we present a reduced basis ANOVA approach for partial deferential equations (PDEs) with random inputs. The ANOVA method combined with stochastic collocation methods provides model reduction in high-dimensional parameter space through decomposing high-dimensional inputs into unions of low-dimensional inputs. In this work, to further reduce the computational cost, we investigate spatial low-rank structures in the ANOVA-collocation method, and develop efficient spatial model reduction techniques using hierarchically generated reduced bases. We present a general mathematical framework of the methodology, validate its accuracy and demonstrate its efficiency with numerical experiments.
https://doi.org/10.1016/J.JCP.2016.04.029
The analysis of a sparse grid stochastic collocation method for partial differential equations with high-dimensional random input data.

Technical Report Webster, Clayton ; Tempone, Raul ; Nobile, Fabio

This work describes the convergence analysis of a Smolyak-type sparse grid stochastic collocation method for the approximation of statistical quantities related to the solution of partial differential equations with random coefficients and forcing terms (input data of the model). To compute solution statistics, the sparse grid stochastic collocation method uses approximate solutions, produced here by finite elements, corresponding to a deterministic set of points in the random input space. This naturally requires solving uncoupled deterministic problems and, as such, the derived strong error estimates for the fully discrete solution are used to compare the computational efficiency of the proposed methodmore »« less
https://doi.org/10.2172/934852

Full Text Available
A least-squares approximation of partial differential equations with high-dimensional random inputs

Journal Article Doostan, Alireza ; Iaccarino, Gianluca - Journal of Computational Physics

Uncertainty quantification schemes based on stochastic Galerkin projections, with global or local basis functions, and also stochastic collocation methods in their conventional form, suffer from the so called curse of dimensionality: the associated computational cost grows exponentially as a function of the number of random variables defining the underlying probability space of the problem. In this paper, to overcome the curse of dimensionality, a low-rank separated approximation of the solution of a stochastic partial differential (SPDE) with high-dimensional random input data is obtained using an alternating least-squares (ALS) scheme. It will be shown that, in theory, the computational cost ofmore »« less
https://doi.org/10.1016/j.jcp.2009.03.006
Stochastic finite element methods for partial differential equations with random input data

Journal Article Gunzburger, Max D ; Webster, Clayton G ; Zhang, Guannan - Acta Numerica
https://doi.org/10.1017/S0962492914000075
Local polynomial chaos expansion for linear differential equations with high dimensional random inputs

Journal Article Chen, Yi ; Jakeman, John ; Gittelson, Claude ; ... - SIAM Journal on Scientific Computing

In this paper we present a localized polynomial chaos expansion for partial differential equations (PDE) with random inputs. In particular, we focus on time independent linear stochastic problems with high dimensional random inputs, where the traditional polynomial chaos methods, and most of the existing methods, incur prohibitively high simulation cost. Furthermore, the local polynomial chaos method employs a domain decomposition technique to approximate the stochastic solution locally. In each subdomain, a subdomain problem is solved independently and, more importantly, in a much lower dimensional random space. In a postprocesing stage, accurate samples of the original stochastic problems are obtained frommore »« less
https://doi.org/10.1137/140970100

Similar Records