Preconditioned Krylov subspace and GMRHSS iteration methods for solving the nonsymmetric saddle point problems
- 89 Downloads
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.
KeywordsKrylov subspace method Preconditioner Saddle point Kronecker
Mathematics Subject Classification (2010)65F10 65N22 65F50
The authors would like to thank Laura Dykes for enlightening comments and corrections on an early draft of this manuscript and would like to express their sincere thanks to the referees for their most valuable suggestions.
- 11.Bissuel, A., Allaire, G., Daumas, L., Chalot, F., Mallet, M.: Linear systems with multiple right-hand sides with GMRES, an application to aircraft design. ECCOMAS Congress (2016)Google Scholar