In this paper, two types of Schur complement based preconditioners are studied for twofold and block tridiagonal saddle point problems. One is based on the nested (or recursive) Schur complement, the other is based on an additive type Schur complement after permuting the original saddle point systems. We discuss different preconditioners incorporating the exact Schur complements. It is shown that some of them will lead to positive stable preconditioned systems. Our theoretical analysis is instructive for devising various exact and inexact preconditioners, as well as iterative solvers for many twofold and block tridiagonal saddle point problems.
Download