ISCAS OpenIR
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); Cai, X.-C.(cai@cs.colorado.edu)
2014
SourceJournal of Scientific Computing
ISSN8857474
Volume61Issue:2Pages:1-23
English AbstractIn 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.
Indexed TypeSCI ; EI
KeywordTransport Equation Cubed-sphere Fully Implicit Method Domain Decomposition Parallel Scalability
Department(1) College of Mathematics and Econometrics, Hunan University, Hunan, 410082, China; (2) Laboratory of Parallel Software and Computational Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China; (3) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100190, China; (4) Department of Computer Science, University of Colorado Boulder, Boulder, 80309, United States
Language英语
WOS IDWOS:000343215600002
Citation statistics
Content Type期刊论文
URIhttp://ir.iscas.ac.cn/handle/311060/16794
Collection中国科学院软件研究所
Corresponding AuthorCai, X.-C.(cai@cs.colorado.edu)
Recommended Citation
GB/T 7714
Yang, Haijian ,Yang, Chao ,Cai, Xiao-Chuan ,et al. 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 ,&Cai, X.-C..(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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Yang, Haijian (1)]'s Articles
[Yang, Chao (2)]'s Articles
[Cai, Xiao-Chuan (4)]'s Articles
Baidu academic
Similar articles in Baidu academic
[Yang, Haijian (1)]'s Articles
[Yang, Chao (2)]'s Articles
[Cai, Xiao-Chuan (4)]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Yang, Haijian (1)]'s Articles
[Yang, Chao (2)]'s Articles
[Cai, Xiao-Chuan (4)]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.