Solving linear systems of equations with randomization, augmentation and aggregation

Abstract

Seeking a basis for the null space of a rectangular and possibly rank deficient and ill conditioned matrix we apply randomization, augmentation, and aggregation to reduce our task to computations with well conditioned matrices of full rank. Our algorithms avoid pivoting and orthogonalization, preserve matrix structure and sparseness, and in the case of an ill conditioned input perform only a small part of the computations with high accuracy. We extend the algorithms to the solution of nonhomogeneous nonsingular ill conditioned linear systems of equations whose matrices have small numerical nullities. Our estimates and experiments show dramatic progress versus the customary matrix algorithms where the input matrices are rank deficient or ill conditioned. Our study can be of independent technical interest: we extend the known results on conditioning of random matrices to randomized preconditioning, estimate the condition numbers of randomly augmented matrices, and link augmentation to aggregation as well as homogeneous to nonhomogeneous linear systems of equations.