Preconditioning techniques for large linear systems: a survey
Journal of Computational Physics
Parallel Displacement Decomposition Solvers for Elasticity Problems
PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Large scale parallel FEM computations of far/near stress field changes in rocks
Future Generation Computer Systems
Displacement decomposition and parallelisation of the PCG method for elasticity problems
International Journal of Computational Science and Engineering
ACM Transactions on Mathematical Software (TOMS)
Large scale parallel FEM computations of far/near stress field changes in rocks
Future Generation Computer Systems
AMG for linear systems in engine flow simulations
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part II
Fast iterative solution of large sparse linear systems on geographically separated clusters
International Journal of High Performance Computing Applications
Flexible Variants of Block Restarted GMRES Methods with Application to Geophysics
SIAM Journal on Scientific Computing
SIAM Journal on Matrix Analysis and Applications
Original article: Macro-elementwise preconditioning methods
Mathematics and Computers in Simulation
Robust multilevel solvers for high-contrast anisotropic multiscale problems
Journal of Computational and Applied Mathematics
Hierarchical Krylov and nested Krylov methods for extreme-scale computing
Parallel Computing
Hi-index | 0.01 |
We analyze the conjugate gradient (CG) method with preconditioning slightly variable from one iteration to the next. To maintain the optimal convergence properties, we consider a variant proposed by Axelsson that performs an explicit orthogonalization of the search directions vectors. For this method, which we refer to as flexible CG, we develop a theoretical analysis that shows that the convergence rate is essentially independent of the variations in the preconditioner as long as the latter are kept sufficiently small. We further discuss the real convergence rate on the basis of some heuristic arguments supported by numerical experiments. Depending on the eigenvalue distribution corresponding to the fixed reference preconditioner, several situations have to be distinguished. In some cases, the convergence is as fast with truncated versions of the algorithm or even with the standard CG method, whereas quite large variations are allowed without too much penalty. In other cases, the flexible variant effectively outperforms the standard method, while the need for truncation limits the size of the variations that can be reasonably allowed.