A Sparse Grid Stochastic Collocation Method for Elliptic Interface Problems with Random Input

被引:5
|
作者
Zhang, Qian [1 ]
Li, Zhilin [1 ,2 ,3 ]
Zhang, Zhiyue [1 ]
机构
[1] Nanjing Normal Univ, Sch Math Sci, Jiangsu Key Lab NSLSCS, Nanjing 210023, Jiangsu, Peoples R China
[2] N Carolina State Univ, Ctr Res Sci Computat, Raleigh, NC 27695 USA
[3] N Carolina State Univ, Dept Math, Box 8205, Raleigh, NC 27695 USA
基金
中国国家自然科学基金;
关键词
Sparse grids; Stochastic inputs; Interface; Immersed finite element; Smolyak construction; PARTIAL-DIFFERENTIAL-EQUATIONS; FINITE-ELEMENT-METHOD; UNCERTAINTY QUANTIFICATION; POLYNOMIAL CHAOS; L(1)-MINIMIZATION; APPROXIMATIONS; INTERPOLATION; PROJECTION; DOMAINS; SPEED;
D O I
10.1007/s10915-015-0080-x
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In this paper, numerical solutions of elliptic partial differential equations with both random input and interfaces are considered. The random coefficients are piecewise smooth in the physical space and moderately depend on a large number of random variables in the probability space. To relieve the curse of dimensionality, a sparse grid collocation algorithm based on the Smolyak construction is used. The numerical method consists of an immersed finite element discretization in the physical space and a Smolyak construction of the extreme of Chebyshev polynomials in the probability space, which leads to the solution of uncoupled deterministic problems as in the Monte Carlo method. Numerical experiments on two-dimensional domains are also presented. Convergence is verified and compared with the Monte Carlo simulations.
引用
收藏
页码:262 / 280
页数:19
相关论文
共 50 条