Abstract
In this article, we study the convergence of an inexact Uzawa-type algorithm for solving stabilized saddle point problems. It is shown that for stabilized problems, the algorithm converges under the same condition as that in classical case.
Acknowledgements
The author would like to thank the anonymous referees for their helpful suggestions, which would greatly improve the article. This work is supported by the National Natural Science Foundation of China under grant 10801048.