An efficient numerical method for preconditioned saddle point problems

DOI10.1016/j.amc.2010.12.037zbMath1209.65038OpenAlexW2020231746MaRDI QIDQ628921

Dongping Li, Guo-Feng Zhang, Jing-yu Zhao

Publication date: 8 March 2011

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2010.12.037

zbMATH Keywords

convergencenumerical experimentspreconditioningconjugate gradient methoditeration methodsaddle point problemsmatrix splittingsymmetric positive definite coefficient matrix

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items

On HSS-based sequential two-stage method for non-Hermitian saddle point problems ⋮ An inexact relaxed DPSS preconditioner for saddle point problem ⋮ A generalization of the HSS-based sequential two-stage method for solving non-Hermitian saddle point problems ⋮ The preconditioned iterative methods with variable parameters for saddle point problem

Cites Work

• Unnamed Item
• Fast Uzawa algorithm for generalized saddle point problems
• On generalized successive overrelaxation methods for augmented linear systems
• Restrictive preconditioners for conjugate gradient methods for symmetric positive definite linear systems
• An Iterative Method with Variable Relaxation Parameters for Saddle-Point Problems
• Accelerated Hermitian and skew-Hermitian splitting iteration methods for saddle-point problems
• Numerical solution of saddle point problems
• Mixed and Hybrid Finite Element Methods
• Restrictively preconditioned conjugate gradient methods for systems of linear equations
• A Preconditioner for Generalized Saddle Point Problems