Preconditioned global Krylov subspace methods for solving saddle point problems with multiple right-hand sides - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Transactions on Numerical Analysis Année : 2019

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

A. Badahmane
  • Fonction : Auteur
A. Bentbib
  • Fonction : Auteur

Résumé

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 et versions

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

Identifiants

Citer

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⟩
15 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More