<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; ">Uzawa is an iterative method on the the Schur complement matrix, You can do preconditioned Uzawa which needs a preconditioner for the Schur compliment. And I was referring the Woodbury page.<div><br></div><div>FYI: the yellow SIAM book on mixed FE methods by Brezi and Fortin has an excellent 2 page section on Uzawa that give, among other things, a precise recipe for Uzawa (page 99 I think) including preconditioning and a non-zero RHS for the constraint part.<br><div><br><div><div>On Nov 4, 2011, at 9:45 PM, Jed Brown wrote:</div><br class="Apple-interchange-newline"><blockquote type="cite"><div class="gmail_quote">On Fri, Nov 4, 2011 at 13:55, Mark F. Adams <span dir="ltr"><<a href="mailto:mark.adams@columbia.edu">mark.adams@columbia.edu</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
The two actually look very similar. The community that I learned Uzawa from is very familiar with Sherman-Morrison. Uzawa might in fact be an iterative S-M ... the wikapedia page does not explain how to recover the solution Y and does not accommodate a non-zero RHS for the constraint equations. Both of which you'd want to do to be general.</blockquote>
</div><br><div>Well, the Schur complement is in the other direction. Are you talking about the Uzawa or Sherman-Morrison page? It's easy enough either way.</div>
</blockquote></div><br></div></div></body></html>