On the worst-case convergence of MR and CG for symmetric positive definite tridiagonal Toeplitz matrices.
Lanczos’ method for solving the system of linear algebraic equations consists in constructing a sequence of vectors in such a way that and . This sequence of vectors can be computed by the BiCG (BiOMin) algorithm. In this paper is shown how to obtain the recurrences of BiCG (BiOMin) directly from this conditions.
Page 1