On parameterized inexact Uzawa methods for generalized saddle point problems

312 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Modulus‐based matrix splitting iteration methods for linear complementarity problems (2010, methodology): “Note that A=M−N is exactly the parameterized Uzawa splitting of the saddle-point matrix A; see [20, 21].”
A Relaxed HSS Preconditioner for Saddle Point Problems from Meshfree Discretization (2013, methodology): “The best known and the oldest methods are the Uzawa algorithm [14], the inexact Uzawa algorithms [9, 10, 18], the HSS (Hermitian and skew-Hermitian splitting) algorithms [1–3, 6, 13] and so on.”