Abstract
The convergence of two classes of iterative methods for stabilized saddle-point problems (inexact Uzawa algorithms and a class of methods with symmetric preconditioners) are studied using Zulerhner’s unified approach.
Acknowledgements
This work was supported by NSFC Project 10171021.