An Efficient Parallel Solver for SDD Linear Systems

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=X9bzQUxhZvM


Duration: 53:21
714 views
6

Richard Peng, Massachusetts Institute of Technology
Spectral Algorithms: From Theory to Practice
http://simons.berkeley.edu/talks/richard-peng-2014-10-31



Other Videos By Simons Institute for the Theory of Computing


2014-11-14Tensor Decomposition, Sparse Representations and Applications
2014-11-14The Geometry of the Identifiability of Tensors
2014-11-14Tensors and Complexity in Quantum Information Science
2014-11-14Powers of Tensors and Fast Matrix Multiplication
2014-11-14Siegel's Theorem, Edge Coloring, and a Holant Dichotomy
2014-11-14Elementary Results on Maximal, Generic and Typical Ranks
2014-11-14Tensor Decompositions for Estimating Latent Variable Models
2014-11-14On Strassen's Conjecture
2014-11-14Matrix Multiplication: Coppersmith-Winograd and Beyond
2014-11-14Uniqueness of Tensor Decomposition and Identifiability in Mixture Models
2014-11-04An Efficient Parallel Solver for SDD Linear Systems
2014-11-03Autocatalytic Sets and Models of Early Life
2014-11-03Some Applications in Human Behavior Modeling
2014-11-03Comparing the Theory and Practice of Spectral Algorithms to Combinatorial Flow Algorithms for ...
2014-11-03Spectral Approaches to Nearest Neighbor Search
2014-11-03Learning Functions and Sets with Spectral Regularization
2014-11-03Graph Matching: Relax or Not?
2014-11-03Connection Laplacian, Hodge Laplacian, and Tensor Laplacian of a Graph
2014-11-03Independent Component Analysis: From Theory to Practice and Back
2014-11-03Topic Modeling: A Provable Spectral Method
2014-11-03Random Walks on Directed Graphs


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Algorithmic Spectral Graph Theory
Richard Peng