๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The inexact Uzawa algorithm for saddle point problem

โœ Scribed by Xiao-Liang Cheng


Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
121 KB
Volume
13
Category
Article
ISSN
0893-9659

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On preconditioned Uzawa methods and SOR
โœ Xiaojun Chen ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 776 KB

This paper studies convergence analysis of a preconditioned inexact Uzawa method for nondifferentiable saddle-point problems. The SOR-Newton method and the SOR-BFGS method are special cases of this method. We relax the Bramble-Pasciak-Vassilev condition on preconditioners for convergence of the inex

Inexact Uzawa algorithms for variational
โœ Xiao-liang Cheng; Weimin Han ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 153 KB

In this paper we discuss inexact Uzawa algorithms and inexact non-linear Uzawa algorithms to solve discretized variational inequalities of the second kind. We prove convergence results for the algorithms. Numerical examples are included to show the effectiveness of the algorithms.