A Fast Random Sampling Algorithm for Sparsifying Matrices

We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more than the Chernoff-Hoeffding bounds. Despite the simplicity, the approximation is comparable and sometimes better than previ...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Arora, Sanjeev, Hazan, Elad, Kale, Satyen
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Applied sciences Eigenvector Computation Error Parameter Exact sciences and technology Flows in networks. Combinatorial problems Input Matrix Lanczos Iteration Mathematics Numerical analysis Numerical analysis. Scientific computation Numerical approximation Operational research and scientific management Operational research. Management science Sciences and techniques of general use Unit Eigenvector
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!