“…Besides specialized sparse direct solvers [16,17] we mention, among others, Uzawa-type schemes [11,21,24,27,62], block and approximate Schur complement preconditioners [4,15,20,22,41,45,46,48,51], splitting methods [18,30,31,49,57], indefinite preconditioning [23,35,39,43,48], iterative projection methods [5], iterative null space methods [1,32,54], and preconditioning methods based on approximate factorization of the coefficient matrix [25,50]. Several of these algorithms are based on some form of reduction to a smaller system, for example, by projecting the problem onto the null space of B, while others work with the original (augmented) matrix in (1.1).…”