Solving Linear Systems with Randomized Augmentation ∗

Abstract

Our randomized preprocessing of a matrix by means of augmentation counters its degeneracy and ill conditioning, uses neither pivoting nor orthogonalization, readily preserves matrix structure and sparseness, and leads to dramatic speedup of the solution of general and structured linear systems of equations in terms of both estimated arithmetic time and… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics