.png){kind=icon}
返回
Parallel domain decomposition methods for stochastic elliptic equations
.png){kind=icon}
PRE
AI
DOI：10.1137/060662381.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present parallel Schwarz-type domain decomposition preconditioned recycling Krylov subspace methods for the numerical solution of stochastic elliptic problems, whose coefficients are assumed to be a random field with finite variance. Karhunen-Loeve (KL) expansion and double orthogonal polynomials are used to reformulate the stochastic elliptic problem into a large number of related but uncoupled deterministic equations. The key to an efficient algorithm lies in recycling computed subspaces. Based on a careful analysis of the KL expansion, we propose and test a grouping algorithm that tells us when to recycle and when to recompute some components of the expensive computation. We show theoretically and experimentally that the Schwarz preconditioned recycling GMRES method is optimal for the entire family of linear systems. A fully parallel implementation is provided, and scalability results are reported in the paper.
Keyword:
stochastic elliptic equations
domain decomposition
recycling Krylov subspace method
parallel scalability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
Effective CdS/ZnO nanorod arrays as antireflection coatings for light trapping in c-Si solar cells.png)
RSC Adv.
RSC Adv.IF0
PREAI
分享收藏
Coarse-gradient Langevin algorithms for dynamic data integration and uncertainty quantification
PREAI
分享收藏Solving elliptic boundary value problems with uncertain coefficients by the finite element method: the stochastic formulation通过有限元方法解决具有不确定系数的椭圆边值问题: 随机公式
PREAI
分享收藏
查看更多内容