Modified Krylov acceleration for parallel environments

This paper considers a few variants of Krylov subspace techniques for solvi ng linear systems on parallel computers. The goal of these variants is to a void global dot-products which hamper parallelism in this class of methods. They are based on replacing the standard Euclidean inner product with a di screte inner product over polynomials. The set of knots for the discrete in ner product is obtained by estimating eigenvalues of the coefficient matrix . (C) 1999 Elsevier Science B.V. and IMACS. All rights reserved.