CSE Seminar or Event|
An Offline Approach to Efficient Algorithms, Applied to Solving Linear Systems
Wednesday, March 21, 2018|
10:30am - 11:30am
Add to Google Calendar
About the Event
Solving a system of linear equations is one of the oldest and most well studied algorithmic problems. Linear system solvers have applications in diverse areas of computer science such as scientific computing, network science, and image processing. In this talk I will discuss recent progress on solvers for structured linear systems that led to nearly-linear time algorithms for analyzing random walks on directed graphs, as well as sub-quadratic time solvers for broader classes of linear systems.
Richard Peng is an assistant professor in the School of Computer Science at the Georgia Institute of Technology. His main research interests are in the design, analysis, and implementation of efficient algorithms. Over the past decade these interests revolved around problems induced by practice that arise at the intersection of discrete, numerical, and randomized algorithms. Results involving him include the current best runtime bounds for: solving linear systems corresponding to random walks on undirected/directed graphs, maintaining approximate max-matchings in fully dynamic graphs, reducing the sizes of matrices while preserving L_1-norm structures, and approximating max-flows on undirected graphs.
Open to: Public