Methods for solving symmetric indefinite systems are surveyed including a new one which is stable and almost as fast as the Cholesky method.

We consider a class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part. The algorithms are modelled ...