A new relaxed HSS preconditioner for saddle point problems

2016/03/07 by Davod Khojasteh Salkuyeh, Salkuyeh, Davod Khojasteh, Mohsen Masoudi +1
Computer Science · Engineering · Physics and Astronomy · #65F08 #65F10 #Advanced Numerical Methods in Computational Mathematics #Electromagnetic Scattering and Analysis #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA)

paper · pdf · doi:10.48550/arxiv.1603.02120

openalex publication_date 2016/03/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Abstract

We present a preconditioner for saddle point problems. The proposed preconditioner is extracted from a stationary iterative method which is convergent under a mild condition. Some properties of the preconditioner as well as the eigenvalues distribution of the preconditioned matrix are presented. The preconditioned system is solved by a Krylov subspace method like restarted GMRES. Finally, some numerical experiments on test problems arisen from finite element discretization of the Stokes problem are given to show the effectiveness of the preconditioner.

Citations

• A Note on Preconditioning for Indefinite Linear Systems

Related

• Variants of the PSS preconditioner for generalized saddle point problems from the Navier-Stokes equations
• New preconditioner strategy for solving block four-by-four linear systems: An application to the saddle-point problem from 3D Stokes equation
• On the semi-convergence of regularized HSS iteration methods for singular saddle point problems from the Stokes equations
• Coupled clustering strategies for hierarchical matrix preconditioners in saddle point problems
• On the generalized shift-splitting preconditioner for saddle point\n problems