2015/10/14 by Nguyenho Ho, Sarah D. Olson, Ho, Nguyenho +3 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Numerical Methods in Computational Mathematics #FOS: Mathematics #Matrix Theory and Algorithms #Numerical Analysis (math.NA) #Numerical methods for differential equations
paper · pdf · doi:10.48550/arxiv.1510.04246
openalex publication_date 2015/10/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
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.