arXiv Analytics

Sign in

arXiv:1510.04246 [math.NA]AbstractReferencesReviewsResources

Accelerating the Uzawa Algorithm

Nguyenho Ho, Sarah D. Olson, Homer F. Walker

Published 2015-10-14Version 1

The Uzawa algorithm is an iterative method for the solution of saddle-point problems, which arise in many applications, including fluid dynamics. Viewing the Uzawa algorithm as a fixed- point iteration, we explore the use of Anderson acceleration (also known as Anderson mixing) to improve the convergence. We compare the performance of the preconditioned Uzawa algorithm with and without acceleration on several steady Stokes and Oseen problems for incompressible flows. For perspective, we include in our comparison several other iterative methods that have appeared in the literature. The results indicate that the accelerated preconditioned Uzawa algorithm converges significantly faster than the algorithm without acceleration and is competitive with the other methods considered.

Related articles: Most relevant | Search more
arXiv:2002.03694 [math.NA] (Published 2020-02-10)
Anderson Acceleration Using the $\mathcal{H}^{-s}$ Norm
arXiv:1803.03551 [math.NA] (Published 2018-03-09)
An iterative method for elliptic problems with rapidly oscillating coefficients
arXiv:1909.04638 [math.NA] (Published 2019-09-10)
Anderson acceleration for contractive and noncontractive operators