Parallel Domain Decomposition Methods with Mixed Order Discretization for Fully Implicit Solution of Tracer Transport Problems on the Cubed-Sphere

CORC > 软件研究所 > 软件所图书馆 > 期刊论文

	Parallel Domain Decomposition Methods with Mixed Order Discretization for Fully Implicit Solution of Tracer Transport Problems on the Cubed-Sphere
	Yang, Haijian (1) ; Yang, Chao (2) ; Cai, Xiao-Chuan (4)
刊名	Journal of Scientific Computing
	2014
卷号	61 期号:2 页码:1-23
关键词	Transport equation Cubed-sphere Fully implicit method Domain decomposition Parallel scalability
ISSN号	8857474
通讯作者	Cai, X.-C.(cai@cs.colorado.edu)
中文摘要	In this paper, a fully implicit finite volume Eulerian scheme and a corresponding scalable parallel solver are developed for some tracer transport problems on the cubed-sphere. To efficiently solve the large sparse linear system at each time step on parallel computers, we introduce a Schwarz preconditioned Krylov subspace method using two discretizations. More precisely speaking, the higher order method is used for the residual calculation and the lower order method is used for the construction of the preconditioner. The matrices from the two discretizations have similar sparsity pattern and eigenvalue distributions, but the matrix from the lower order method is a lot sparser, as a result, excellent scalability results (in total computing time and the number of iterations) are obtained. Even though Schwarz preconditioner is originally designed for elliptic problems, our experiments indicate clearly that the method scales well for this class of purely hyperbolic problems. In addition, we show numerically that the proposed method is highly scalable in terms of both strong and weak scalabilities on a supercomputer with thousands of processors. © 2014 Springer Science+Business Media New York.
英文摘要	In this paper, a fully implicit finite volume Eulerian scheme and a corresponding scalable parallel solver are developed for some tracer transport problems on the cubed-sphere. To efficiently solve the large sparse linear system at each time step on parallel computers, we introduce a Schwarz preconditioned Krylov subspace method using two discretizations. More precisely speaking, the higher order method is used for the residual calculation and the lower order method is used for the construction of the preconditioner. The matrices from the two discretizations have similar sparsity pattern and eigenvalue distributions, but the matrix from the lower order method is a lot sparser, as a result, excellent scalability results (in total computing time and the number of iterations) are obtained. Even though Schwarz preconditioner is originally designed for elliptic problems, our experiments indicate clearly that the method scales well for this class of purely hyperbolic problems. In addition, we show numerically that the proposed method is highly scalable in terms of both strong and weak scalabilities on a supercomputer with thousands of processors. © 2014 Springer Science+Business Media New York.
收录类别	SCI ; EI
语种	英语
WOS记录号	WOS:000343215600002
公开日期	2014-12-16
内容类型	期刊论文
源URL	[http://ir.iscas.ac.cn/handle/311060/16794]
专题	软件研究所_软件所图书馆_期刊论文
推荐引用方式 GB/T 7714	Yang, Haijian ,Yang, Chao ,Cai, Xiao-Chuan . Parallel Domain Decomposition Methods with Mixed Order Discretization for Fully Implicit Solution of Tracer Transport Problems on the Cubed-Sphere[J]. Journal of Scientific Computing,2014,61(2):1-23.
APA	Yang, Haijian ,Yang, Chao ,&Cai, Xiao-Chuan .(2014).Parallel Domain Decomposition Methods with Mixed Order Discretization for Fully Implicit Solution of Tracer Transport Problems on the Cubed-Sphere.Journal of Scientific Computing,61(2),1-23.
MLA	Yang, Haijian ,et al."Parallel Domain Decomposition Methods with Mixed Order Discretization for Fully Implicit Solution of Tracer Transport Problems on the Cubed-Sphere".Journal of Scientific Computing 61.2(2014):1-23.