Smoothed analysis of the condition number under low-rank perturbations release_tan26tiqqvflvgd5xvrjtj3p5q

by Rikhav Shah, Sandeep Silwal

Released as a article .

2021  

Abstract

Let M be an arbitrary n by n matrix of rank n-k. We study the condition number of M plus a low-rank perturbation UV^T where U, V are n by k random Gaussian matrices. Under some necessary assumptions, it is shown that M+UV^T is unlikely to have a large condition number. The main advantages of this kind of perturbation over the well-studied dense Gaussian perturbation, where every entry is independently perturbed, is the O(nk) cost to store U,V and the O(nk) increase in time complexity for performing the matrix-vector multiplication (M+UV^T)x. This improves the Ω(n^2) space and time complexity increase required by a dense perturbation, which is especially burdensome if M is originally sparse. Our results also extend to the case where U and V have rank larger than k and to symmetric and complex settings. We also give an application to linear systems solving and perform some numerical experiments. Lastly, barriers in applying low-rank noise to other problems studied in the smoothed analysis framework are discussed.
In text/plain format

Archived Files and Locations

application/pdf  654.9 kB
file_ndg7wyb33vh7fl7he7gfuqp5ay
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-07-13
Version   v2
Language   en ?
arXiv  2009.01986v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 6ed5203c-2cf3-4059-8370-89f622cc5eb6
API URL: JSON