An iterative method for indefinite linear systems of algebraic equations

By generalizing the CG, we obtain a kind of short-recursion iterative method for indefinite linear systems. Its computation complexity is less than the normalization method because it does one time fewer matrix-vector multiplications in each iterative step. Its storage complexity is less than GCR because it is of short recursion while the later is of long recursion. It converges in finite steps with a smoothly decreasing residual norm because it has got a minimal residual.