Authors

Versus the customary preconditioners, our weakly random ones are generated more readily and for a much larger class of input matrices. Furthermore our preconditioners have a wider range of applications, in particular to linear systems with rectangular and rank deficient co-efficient matrices and to eigen-solving. We study the generation of such preconditioners and their impact on conditioning of the input matrix. Our analysis and experiments show the power of this approach even where we use weak randomization, with fewer random parameters, and choose sparse and structured preconditioners