We survey recent progress on efficient algorithms for approximately
diag...
Given an n× n matrix with integer entries in the range [-h,h], how
close...
We develop a framework for proving rapid convergence of shifted QR algor...
We give a self-contained randomized algorithm based on shifted inverse
i...
Rapid convergence of the shifted QR algorithm on symmetric matrices was ...
We study the bit complexity of two related fundamental computational pro...
Let G be a random d-regular graph. We prove that for every constant
α > ...
We prove upper bounds on the graph diameters of polytopes in two setting...
We show that the multiplicity of the second normalized adjacency matrix
...
Let G_n be an n × n matrix with real i.i.d. N(0,1/n) entries, let
A be a...
We exhibit a randomized algorithm which given a square n× n complex
matr...
We show that for every prime d and α∈ (0,1/6), there is an
infinite sequ...
A matrix A∈C^n× n is diagonalizable if it has a basis of
linearly indepe...
We prove improved bounds on how localized an eigenvector of a high girth...
We study the space complexity of sketching cuts and Laplacian quadratic ...
The Generalized Lax Conjecture asks whether every hyperbolicity cone is ...