Koutis; Miller and Peng (Inexact Laplacian Solver SDD Systems Solvers): Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$\tilde{O}(m log n)$ | $\tilde{O}(m \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
| Line 29: | Line 29: | ||
== Year == | == Year == | ||
2010 | |||
== Reference == | == Reference == | ||
https://arxiv.org/abs/ | https://arxiv.org/abs/1102.4842 | ||
Revision as of 08:56, 10 April 2023
Time Complexity
$\tilde{O}(m \log n)$
Space Complexity
$O(n)$ words
(Derived: Uses an auxiliary chain of graphs, which can be kept track of with a single spanning tree)
Description
Incremental sparsifier
Approximate?
Approximate
Approximation Factor: \epsilon
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
2010