Analysis of iterative algorithms of Uzawa type for saddle point problems

Authors:
M.-R. Cui
Affiliations:
School of Mathematics and System Science, Shandong University, Jinan 250100, Shandong, People's Republic of China
Venue:
Applied Numerical Mathematics
Year:
2004

Citing 14
Cited 5

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 domain decomposition technique for Stokes problems

Applied Numerical Mathematics - Domain Decomposition
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
Fast iterative solution of stabilised Stokes systems part II: using general block preconditioners

SIAM Journal on Numerical Analysis
Fast nonsymmetric iterations and preconditioning for Navier-Stokes equations

SIAM Journal on Scientific Computing - Special issue on iterative methods in numerical linear algebra; selected papers from the Colorado conference
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
Preconditioning for the Steady-State Navier--Stokes Equations with Low Viscosity

SIAM Journal on Scientific Computing
Uzawa type algorithms for nonsymmetric saddle point problems

Mathematics of Computation
On the Nonlinear Inexact Uzawa Algorithm for Saddle-Point Problems

SIAM Journal on Numerical Analysis
A sufficient condition for the convergence of the inexact Uzawa algorithm for saddle point problems

Journal of Computational and Applied Mathematics
Fast uzawa algorithm for generalized saddle point problems

Applied Numerical Mathematics

Application of modified homotopy perturbation method for solving the augmented systems

Journal of Computational and Applied Mathematics
On local Hermitian and skew-Hermitian splitting iteration methods for generalized saddle point problems

Journal of Computational and Applied Mathematics
Variational piecewise constant level set methods for shape optimization of a two-density drum

Journal of Computational Physics
Shape and topology optimization for elliptic boundary value problems using a piecewise constant level set method

Applied Numerical Mathematics
A preconditioned GLHSS iteration method for non-Hermitian singular saddle point problems

Computers & Mathematics with Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we consider the convergence criteria for iterative algorithms of Uzawa type for solving linear saddle point problems. Theoretically weaker convergence criteria than before are established for the general case and these are used to deduce conditions for convergence of two special cases: the exact Uzawa algorithm and the linear one-step method. The conclusions given here hold for both symmetric and nonsymmetric saddle point problems. These new sufficient conditions are compared with some known results and illustrated by two examples. Numerical experiments to verify the conclusions in this paper for the preconditioned exact Uzawa algorithm are provided.