An inexact Uzawa-type iterative algorithm is proposed for solving saddle point problems arising from mixed finite element methods or Lagrange multiplier methods for some PDEs. The convergence rate is given in terms of the rates of the two basic iterations and it is shown that the algorithm always converges as long as the two basic iterations converge.
International Journal of Computer Mathematics
Volume 80, 2003 - Issue 1
![Sample our Computer Science journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5928/TOC-Subject-Sample-2021-Computer-Science.jpg"})