Solution of indefinite linear systems using an LQ decomposition for the linear constraints

In this paper, indefinite linear systems with linear constraints are considered. We present a special decomposition that makes use of the LQ decomposition, and retains the constraints in the factors. The resulting decomposition is of a structure similar to that obtained using the Bunch–Kaufman–Parlett algorithm. The decomposition can be used in a direct solution algorithm for indefinite systems, but it can also be used to construct effective preconditioners. Combinations of the latter with conjugate gradient type methods have been demonstrated to be very useful