TIME-PARALLEL ITERATIVE SOLVERS FOR PARABOLIC EVOLUTION EQUATIONS

被引:16
作者
Neumueller, Martin [1 ]
Smears, Iain [2 ]
机构
[1] Johannes Kepler Univ Linz, Inst Computat Math, A-4040 Linz, Austria
[2] UCL, Dept Math, London WC1E 6BT, England
基金
欧洲研究理事会;
关键词
parabolic partial differential equations; time-parallel methods; analysis of iterative methods and preconditioners; inf-sup stability; parallel complexity; weak and strong scaling; SADDLE-POINT PROBLEMS; DOMAIN DECOMPOSITION; ALGORITHM; PARAREAL; APPROXIMATION; DISCRETIZATION; INTEGRATION; EFFICIENT; SYSTEMS;
D O I
10.1137/18M1172466
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We present original time-parallel algorithms for the solution of the implicit Euler discretization of general linear parabolic evolution equations with time-dependent self-adjoint spatial operators. Motivated by the inf-sup theory of parabolic problems, we show that the standard nonsymmetric time-global system can be equivalently reformulated as an original symmetric saddle-point system that remains inf-sup stable with respect to the same natural parabolic norms. We then propose and analyze an efficient and readily implementable parallel-in-time preconditioner to be used with an inexact Uzawa method. The proposed preconditioner is nonintrusive and easy to implement in practice. It also features the key theoretical advantage of robust spectral bounds, which lead to convergence rates that are independent of the number of time-steps, final time, and spatial mesh size. Finally, it has a theoretical parallel complexity that grows only logarithmically with respect to the number of time-steps. Numerical experiments with large-scale parallel computations show the effectiveness of the method, along with its good weak and strong scaling properties.
引用
收藏
页码:C28 / C51
页数:24
相关论文
共 45 条
[1]   WAVELET-IN-TIME MULTIGRID-IN-SPACE PRECONDITIONING OF PARABOLIC EVOLUTION EQUATIONS [J].
Andreev, Roman .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2016, 38 (01) :A216-A242
[2]  
[Anonymous], 1983, COMPUTING METHODS AP
[3]   ERROR-BOUNDS FOR FINITE ELEMENT METHOD [J].
BABUSKA, I .
NUMERISCHE MATHEMATIK, 1971, 16 (04) :322-&
[4]  
Bal G, 2005, LECT NOTES COMP SCI, V40, P425
[5]  
Bal G, 2002, LECT NOTES COMP SCI, V23, P189
[6]   A parallel nearly implicit time-stepping scheme [J].
Botchev, MA ;
van der Vorst, HA .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2001, 137 (02) :229-243
[7]   Analysis of the inexact Uzawa algorithm for saddle point problems [J].
Bramble, JH ;
Pasciak, JE ;
Vassilev, AT .
SIAM JOURNAL ON NUMERICAL ANALYSIS, 1997, 34 (03) :1072-1092
[8]  
BREZZI F, 1974, REV FR AUTOMAT INFOR, V8, P129
[9]   A PARALLEL SPACE-TIME ALGORITHM [J].
Christlieb, Andrew J. ;
Haynes, Ronald D. ;
Ong, Benjamin W. .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2012, 34 (05) :C233-C248
[10]   TOWARD AN EFFICIENT PARALLEL IN TIME METHOD FOR PARTIAL DIFFERENTIAL EQUATIONS [J].
Emmett, Matthew ;
Minion, Michael L. .
COMMUNICATIONS IN APPLIED MATHEMATICS AND COMPUTATIONAL SCIENCE, 2012, 7 (01) :105-132