Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides - Archive ouverte HAL Access content directly
Journal Articles Electronic Transactions on Numerical Analysis Year : 2019

Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides

A. Badahmane
  • Function : Author
A. Bentbib
  • Function : Author

Abstract

In the present paper, we propose a preconditioned global approach as a new strategy to solve linear systems with several right-hand sides coming from saddle point problems. The preconditioner is obtained by replacing a (2,2)-block in the original saddle-point matrix A by another well-chosen block. We apply the global GMRES method to solve this new problem with several right-hand sides and give some convergence results. Moreover, we analyze the eigenvalue distribution and the eigenvectors of the proposed preconditioner when the first block is positive definite. We also compare different preconditioned global Krylov subspace algorithms (CG, MINRES, FGMRES, GMRES) with preconditioned block (CG, GMRES) algorithms. Numerical results show that our preconditioned global GMRES method is competitive with other preconditioned global Krylov subspace and preconditioned block Krylov subspace methods for solving saddle point problems with several right-hand sides.

Dates and versions

hal-04409946 , version 1 (22-01-2024)

Identifiers

Cite

A. Badahmane, A. Bentbib, Hassane Sadok. Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides. Electronic Transactions on Numerical Analysis, 2019, 51, pp.495-511. ⟨10.1553/etna_vol51s495⟩. ⟨hal-04409946⟩
10 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More