Sparse approximations, iterative methods, and faster algorithms for matrices and graphs

This thesis aims to advance our algorithmic understanding of some of the most fundamental objects in computer science: graphs and matrices. Specifically, on one hand, we develop a broad set of sampling techniques that yield better (sparser) approximations of these objects and do so more efficiently. On the other hand, we provide faster algorithms for a host of core problems in numerical linear algebra and graph algorithms. The resulting insights often lead to first in decades progress on the studied problems.

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2018

Author dc:creator

• Cohen, Michael Benjamin

Advisor dc:contributor.advisor

• Aleksander Ma̧dry

• Electrical Engineering and Computer Science.

Statement dc:rights

• MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/119599

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/119599