Deflation and balancing preconditioners for Krylov subspace methods applied to nonsymmetric matrices. (English) Zbl 1163.65014
The authors study the convergence analysis of nonsymmetric linear systems in the context of the generalized minimal residual (GMRES) iteration and compare it with the abstract nonsymmetric balancing preconditioner. They show that many results for symmetric positive definite matrices carry over to arbitrary non-symmetric matrices. They establish that the spectra of the preconditioned systems are similar. They show that under certain conditions, the \(2\)-norm of residuals produced by GMRES combined with deflation is never larger than the \(2\)-norm of residuals produced by GMRES combined with the abstract balancing preconditioner. Numerical examples that confirm the theoretical results are also provided.
Reviewer: Răzvan Răducanu (Iaşi)
MSC:
65F10 | Iterative numerical methods for linear systems |
65F50 | Computational methods for sparse matrices |
65N22 | Numerical solution of discretized equations for boundary value problems involving PDEs |
65N55 | Multigrid methods; domain decomposition for boundary value problems involving PDEs |