Journal of the
Korean Mathematical Society
JKMS

ISSN(Print) 0304-9914 ISSN(Online) 2234-3008

Article

HOME ALL ARTICLES View

J. Korean Math. Soc. 2017; 54(1): 193-213

Online first article November 15, 2016      Printed January 1, 2017

https://doi.org/10.4134/JKMS.j150673

Copyright © The Korean Mathematical Society.

Sparse grid stochastic collocation method for stochastic Burgers equation

Hyung-Chun Lee and Yun Nam

Ajou University, Ajou University

Abstract

We investigate an efficient approximation of solution to stochastic Burgers equation driven by an additive space-time noise. We discuss existence and uniqueness of a solution through the Orstein-Uhlenbeck (OU) process. To approximate the OU process, we introduce the \linebreak Karhunen-Lo{\`{e}}ve expansion, and sparse grid stochastic collocation method. About spatial discretization of Burgers equation, two separate finite element approximations are presented: the conventional Galerkin method and Galerkin-conservation method. Numerical experiments are provided to demonstrate the efficacy of schemes mentioned above.

Keywords: Burgers equation, Orstein-Uhlenbeck process, Karhunen-Lo{\`{e}}ve expansion, sparse grids collocation, finite element method

MSC numbers: 65M70, 76F65