Premium
Fast Uzawa algorithms for solving non‐symmetric stabilized saddle point problems
Author(s) -
Cao ZhiHao
Publication year - 2004
Publication title -
numerical linear algebra with applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.02
H-Index - 53
eISSN - 1099-1506
pISSN - 1070-5325
DOI - 10.1002/nla.330
Subject(s) - mathematics , saddle point , discretization , convergence (economics) , saddle , type (biology) , finite element method , algorithm , mathematical analysis , mathematical optimization , geometry , ecology , physics , economics , biology , economic growth , thermodynamics
Bramble et al . (Math. Comput. (2000); 69 (230) : 667–689) discussed the Uzawa type algorithms for iteratively solving nonsymmetric stable saddle point problems. In this paper, we consider the Uzawa type algorithms for iteratively solving generalized saddle point problems. Our main concern is how to accelerate the convergence of the inexact Uzawa type algorithms. The contributions of the paper are that a new non‐linear Uzawa type algorithm is presented and its convergence is analysed. Applications to Navier–Stokes equations by mixed finite element discretization with an unstable pair of approximation spaces, i.e. Q 1 ‐ P 0 pair of approximation spaces, are discussed and the results of the numerical experiments of applying our new algorithm are presented. Copyright © 2003 John Wiley & Sons, Ltd.