A sufficient condition for the convergence of the inexact Uzawa algorithm for saddle point problems

Authors:
Mingrong Cui
Affiliations:
School of Mathematics and System Science, Shandong University, Jinan 250100, People's Republic of China
Venue:
Journal of Computational and Applied Mathematics
Year:
2002

Citing 9
Cited 1

The algebraic eigenvalue problem

The algebraic eigenvalue problem
The convergence factor of preconditioned algorithms of the Arrow-Hurwicz type

SIAM Journal on Numerical Analysis
A preconditioned iterative method for saddlepoint problems

SIAM Journal on Matrix Analysis and Applications
Inexact and preconditioned Uzawa algorithms for saddle point problems

SIAM Journal on Numerical Analysis - Special issue: the articles in this issue are dedicated to Seymour V. Parter
Analysis of the Inexact Uzawa Algorithm for Saddle Point Problems

SIAM Journal on Numerical Analysis
An Optimal Preconditioner for a Class of Saddle Point Problems with a Penalty Term

SIAM Journal on Scientific Computing
Global and Superlinear Convergence of Inexact Uzawa Methods for Saddle Point Problems with Nondifferentiable Mappings

SIAM Journal on Numerical Analysis
On preconditioned Uzawa methods and SOR methods for saddle-point problems

Journal of Computational and Applied Mathematics
Uzawa type algorithms for nonsymmetric saddle point problems

Mathematics of Computation

Analysis of iterative algorithms of Uzawa type for saddle point problems

Applied Numerical Mathematics

Quantified Score

Hi-index	7.29

Visualization

Abstract

In this paper, the convergence property of the inexact Uzawa algorithm for solving symmetric indefinite linear systems is studied. A simple sufficient condition for the convergence of the inexact Uzawa algorithm is obtained. Two examples and numerical experiments illustrating the conclusion are provided.