Year: 2017
Type: article
Abstract: 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 GMRES with two different preconditioners. 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.
DOI: 10.1137/16m1076770
Authors: Nguyenho Ho, Sarah D. Olson, Homer F. Walker
Institution: Worcester Polytechnic Institute
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: CAREER: Numerical Methods and Biomechanical Models for Sperm Motility, TAS::89 0222::TAS NEW; ANDERSON ACCELERATION FOR FIXED-POINT ITERATIONS; PI - HOMER WALKER, MRI: Acquisition of a High-Performance Computing System for Research, Education, and Training, Mechanisms of marine invertebrate sperm chemotaxis: from cellular signaling to flagellar swimming
OpenAlex ID: W2964237553