2017
DOI: 10.1016/j.jcp.2017.04.054
|View full text |Cite
|
Sign up to set email alerts
|

A dynamical polynomial chaos approach for long-time evolution of SPDEs

Abstract: We propose a Dynamical generalized Polynomial Chaos (DgPC) method to solve time-dependent stochastic partial differential equations (SPDEs) with white noise forcing. The long-time simulation of SPDE solutions by Polynomial Chaos (PC) methods is notoriously difficult as the dimension of the stochastic variables increases linearly with time. Exploiting the Markovian property of white noise, DgPC [1] implements a restart procedure that allows us to expand solutions at future times in terms of orthogonal polynomia… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
8
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7

Relationship

1
6

Authors

Journals

citations
Cited by 9 publications
(8 citation statements)
references
References 65 publications
0
8
0
Order By: Relevance
“…viable alternatives to a pointwise-in-time CS-based strategy; see [43] and the references therein. While PC expansions are widely applicable, they present known shortcomings for certain classes of time-dependent problems; see e.g., [44,32,45,46,47] that address problems where straightforward implementation of a PC-based approach is not optimal. Depending on the application at hand, other types of surrogates might provide better alternatives for the purposes of Algorithm 1.…”
Section: Input: (I) a Quadrature Formula On [0 T ] With Nodes And Wementioning
confidence: 99%
“…viable alternatives to a pointwise-in-time CS-based strategy; see [43] and the references therein. While PC expansions are widely applicable, they present known shortcomings for certain classes of time-dependent problems; see e.g., [44,32,45,46,47] that address problems where straightforward implementation of a PC-based approach is not optimal. Depending on the application at hand, other types of surrogates might provide better alternatives for the purposes of Algorithm 1.…”
Section: Input: (I) a Quadrature Formula On [0 T ] With Nodes And Wementioning
confidence: 99%
“…This intrusive approach was first applied to coupled partial differential equations, where the response at regular times of updates is considered as a new random variable and is added to the existing set of random variables. The idea of regular updates of the set of basis functions was further extended to multidimensional stochastic dynamical systems by Ozen and Bal 7 who introduced dynamical PC. The idea behind this approach is to find an optimal set of basis polynomials that can accurately represent the entire solution in space and time between short‐time intervals.…”
Section: Introductionmentioning
confidence: 99%
“…The approach we present here is an intrusive approach based on the idea of dynamical PC from Ozen and Bal 7 . There are several motivations for why we choose an intrusive approach over a nonintrusive approach which are described below.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Using the same basis in each time step is called a time-frozen PC expansion and results in large errors in the evaluation of the long-term response [15]. Several strategies to add physical information to the variation of the spectral coefficients have been proposed in [16,17]. To control the error made by the PC expansion, which is the distance between the response and its projection in the space spanned by the chosen polynomials, error estimates are needed.…”
Section: Introductionmentioning
confidence: 99%