Preconditioning linear systems and parallelism

We present three polynomial preconditioning techniques and analyze some of their theoretical and computational properties. We first show some formal relations between the preconditioning polynomial and the characteristic polynomial of the coefficient matrix. Parallel algorithms are then derived and their behaviour related to that of Csanky's method. We also present experimental results obtained for special types of matrices.