Uzawa type algorithms for nonsymmetric saddle point problems

In this paper, we consider iterative algorithms of Uzawa type for solving linear nonsymmetric saddle point problems. Specifically, we consider systems, written as usual in block form, where the upper left block is an invertible linear operator with positive definite symmetric part. Such saddle point problems arise, for example, in certain finite element and finite difference discretizations of Navier

• Type: Journal
• Year: 2000
• Where: MOC
• Authors: James H. Bramble, Joseph E. Pasciak, Apostol T. Vassilev
• Keywords: Algorithms, Finite Element, MOC 2000, Saddle Point Problems