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

@inproceedings{Shah2021SmoothedAO,
title={Smoothed analysis of the condition number under low-rank perturbations},
author={Rikhav Shah and Sandeep Silwal},
booktitle={APPROX-RANDOM},
year={2021}
}
• Published in APPROX-RANDOM 4 September 2020
• Computer Science

### Geometric random edge

• Mathematics, Computer Science
Math. Program.
• 2017
A variant of the random-edge pivoting rule results in a strongly polynomial time simplex algorithm for linear programs with A totally unimodular matrices, viewed as an algorithmic realization of the proof of small diameter for such polytopes by Bonifas et al.

### Smooth analysis of the condition number and the least singular value

• Mathematics
Math. Comput.
• 2010
A general estimate is given for the condition number and least singular value of the matrix M + N n, generalizing an earlier result of Spielman and Teng for the case when x is gaussian and involves the norm ∥M∥.

### The condition number of a randomly perturbed matrix

• Computer Science
STOC '07
• 2007
It is shown that, under very general conditions on M and M-N-sub, the condition number of M+N-n is polynomial in <i>n</i> with very high probability.

### Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices

• Computer Science
SIAM J. Matrix Anal. Appl.
• 2006
It is shown that the smoothed precision necessary to solve Ax = b, for any b, using Gaussian elimination without pivoting is logarithmic.

### Random Matrices: the Distribution of the Smallest Singular Values

• Mathematics
• 2009
Let ξ be a real-valued random variable of mean zero and variance 1. Let Mn(ξ) denote the n × n random matrix whose entries are iid copies of ξ and σn(Mn(ξ)) denote the least singular value of Mn(ξ).

### Recovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies

• Computer Science
IEEE Transactions on Information Theory
• 2013
First-order algorithms are developed to solve the nonsmooth convex optimization problem with provable iteration complexity guarantees and its ability to outperform existing alternatives is corroborated.

### The Expected Norm of Random Matrices

• Y. Seginer
• Mathematics
Combinatorics, Probability and Computing
• 2000
The Euclidean operator norm of a random matrix, A, obtained from a (non-random) matrix by randomizing the signs of the matrix's entries is considered, which is the best inequality possible (up to a multiplicative constant).