A MODIFIED BLOCK FLEXIBLE GMRES METHOD WITH DEFLATION AT EACH ITERATION FOR THE SOLUTION OF NON-HERMITIAN LINEAR SYSTEMS WITH MULTIPLE RIGHT-HAND SIDES

被引:20
作者
Calandra, Henri [1 ]
Gratton, Serge [2 ,3 ]
Lago, Rafael [4 ]
Vasseur, Xavier [4 ,5 ]
Carvalho, Luiz Mariano [6 ]
机构
[1] Ctr Sci & Tech Jean Feger, TOTAL, F-64000 Pau, France
[2] Univ Toulouse, INPT IRIT, F-31071 Toulouse 7, France
[3] ENSEEIHT, F-31071 Toulouse 7, France
[4] CERFACS, F-31057 Toulouse 1, France
[5] HiePACS Project Joint INRIA CERFACS Lab, F-31057 Toulouse 1, France
[6] IME UERJ, Dept Appl Math, BR-20559900 Rio De Janeiro, RJ, Brazil
关键词
block Krylov space method; block size reduction; deflation at each iteration; flexible preconditioning; multiple right-hand sides; PERFECTLY MATCHED LAYER; ALGORITHMS; ABSORPTION; ARNOLDI;
D O I
10.1137/120883037
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
We propose a variant of the block GMRES method for the solution of linear systems of equations with multiple right-hand sides. We investigate a deflation strategy to detect when a linear combination of approximate solutions is already known that avoids performing expensive computational operations with the system matrix. This is especially useful when the cost of the preconditioner is supposed to be larger than the cost of orthogonalization in the block Arnoldi procedure. We specifically focus on the block GMRES method incorporating deflation at the end of each iteration proposed by Robbe and Sadkane [M. Robbe and M. Sadkane, Linear Algebra Appl., 419 (2006), pp. 265-285]. We extend their contribution by proposing that deflation be performed also at the beginning of each cycle. This change leads to a modified least-squares problem to be solved at each iteration and gives rise to a different behavior especially when multiple restarts are required to reach convergence. Additionally we investigate truncation techniques, aiming at reducing the computational cost of the iteration. This is particularly useful when the number of right-hand sides is large. Finally, we address the case of variable preconditioning, an important feature when iterative methods are used as preconditioners, as investigated here. The numerical experiments performed in a parallel environment show the relevance of the proposed variant on a challenging application related to geophysics. A savings of up to 35% in terms of computational time-at the same memory cost-is obtained with respect to the original method on this application.
引用
收藏
页码:S345 / S367
页数:23
相关论文
共 49 条
[1]  
Aliaga JI, 2000, MATH COMPUT, V69, P1577, DOI 10.1090/S0025-5718-99-01163-1
[2]  
Aminzadeh F., 1997, 3D salt and overthrust models
[3]  
[Anonymous], 2008, Functions of matrices: theory and computation
[4]   Augmented Block Householder Arnoldi method [J].
Baglama, James .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2008, 429 (10) :2315-2334
[5]   ABLE: An adaptive block Lanczos method for non-Hermitian eigenvalue problems [J].
Bai, ZJ ;
Day, D ;
Ye, Q .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1999, 20 (04) :1060-1082
[6]   On improving linear solver performance: A block variant of GMRES [J].
Baker, AH ;
Dennis, JM ;
Jessup, ER .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2006, 27 (05) :1608-1626
[7]   MULTIGRID SMOOTHERS FOR ULTRAPARALLEL COMPUTING [J].
Baker, Allison H. ;
Falgout, Robert D. ;
Kolev, Tzanio V. ;
Yang, Ulrike Meier .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2011, 33 (05) :2864-2887
[8]   Block Krylov subspace methods for the computation of structural response to turbulent wind [J].
Barbella, G. ;
Perotti, F. ;
Simoncini, V. .
COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2011, 200 (23-24) :2067-2082
[9]   Three-dimensional perfectly matched layer for the absorption of electromagnetic waves [J].
Berenger, JP .
JOURNAL OF COMPUTATIONAL PHYSICS, 1996, 127 (02) :363-379
[10]   A PERFECTLY MATCHED LAYER FOR THE ABSORPTION OF ELECTROMAGNETIC-WAVES [J].
BERENGER, JP .
JOURNAL OF COMPUTATIONAL PHYSICS, 1994, 114 (02) :185-200