Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems - Archive ouverte HAL Access content directly
Journal Articles Numerical Algorithms Year : 2020

Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems

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

Abstract

In the present paper, we propose a separate approach as a new strategy to solve the saddle point problem arising from the stochastic Galerkin finite element discretization of Stokes problems. The preconditioner is obtained by replacing the (1,1) and (1,2) blocks in the RHSS preconditioner by others well chosen and the parameter α in (2,2) −block of the RHSS preconditioner by another parameter β. The proposed preconditioner can be used as a preconditioner corresponding to the stationary itearative method or to accelerate the convergence of the generalized minimal residual method (GMRES). The convergence properties of the GMRHSS iteration method are derived. Meanwhile, we analyzed the eigenvalue distribution and the eigenvectors of the preconditioned matrix. Finally, numerical results show the effectiveness of the proposed preconditioner as compared with other preconditioners.
No file

Dates and versions

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

Identifiers

Cite

A. Badahmane, A. Bentbib, Hassane Sadok. Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems. Numerical Algorithms, 2020, International Conference Mathematical Modelling with Applications (Mohammed V University, Rabat Morocco, 1-4, April 2019), 84 (4), pp.1295-1312. ⟨10.1007/s11075-019-00833-4⟩. ⟨hal-04409935⟩
3 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More