Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid
Proceedings of the 2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A general framework for graph sparsification
Proceedings of the forty-third annual ACM symposium on Theory of computing
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Proceedings of the forty-third annual ACM symposium on Theory of computing
A breakthrough in algorithm design
Communications of the ACM
Computer Vision and Image Understanding
Random partial paired comparison for subjective video quality assessment via hodgerank
MM '11 Proceedings of the 19th ACM international conference on Multimedia
Spectral sparsification via random spanners
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
How user behavior is related to social affinity
Proceedings of the fifth ACM international conference on Web search and data mining
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Faster approximate multicommodity flow using quadratically coupled flows
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Using petal-decompositions to build a low stretch spanning tree
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A fast solver for a class of linear systems
Communications of the ACM
Algorithms, graph theory, and the solution of laplacian linear equations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Ranking and sparsifying a connection graph
WAW'12 Proceedings of the 9th international conference on Algorithms and Models for the Web Graph
Runtime guarantees for regression problems
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Efficient preconditioning of laplacian matrices for computer graphics
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
A simple, combinatorial algorithm for solving SDD systems in nearly-linear time
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The Journal of Machine Learning Research
| Hi-index | 0.03 |
We present an algorithm that on input of an $n$-vertex $m$-edge weighted graph $G$ and a value $k$, produces an {\em incremental sparsifier} $\hat{G}$ with $n-1 + m/k$ edges, such that the condition number of $G$ with $\hat{G}$ is bounded above by $\tilde{O}(k\log^2 n) $, with probability $1-p$. The algorithm runs in time $$\tilde{O}((m \log{n} + n\log^2{n})\log(1/p)).$$ As a result, we obtain an algorithm that on input of an $n\times n$ symmetric diagonally dominant matrix $A$ with $m$ non-zero entries and a vector $b$, computes a vector ${x}$ satisfying $| |{x}-A^{+}b| |_A