Exact Laplacian Solver: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 38: | Line 38: | ||
[[File:SDD Systems Solvers - Exact Laplacian Solver - Space.png|1000px]] | [[File:SDD Systems Solvers - Exact Laplacian Solver - Space.png|1000px]] | ||
== Space | == Time-Space Tradeoff == | ||
[[File:SDD Systems Solvers - Exact Laplacian Solver - Pareto Frontier.png|1000px]] | [[File:SDD Systems Solvers - Exact Laplacian Solver - Pareto Frontier.png|1000px]] | ||
Revision as of 15:43, 15 February 2023
Description
This problem refers to solving equations of the form $Lx = b$ where $L$ is a Laplacian of a graph. In other words, this is solving equations of the form $Ax = b$ for a SDD matrix $A$.
This variation of the problem requires an exact solution with no error.
Related Problems
Related: Inexact Laplacian Solver
Parameters
n: dimension of matrix
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Briggs; Henson; McCormick | 2000 | $O(n^{1.{2}5} loglogn)$ | Exact | Deterministic | Time | |
| Gaussian Elimination | -150 | $O(n^{3})$ | $O(n^{2})$ | Exact | Deterministic | |
| Naive Implementation | 1940 | $O(n!)$ | $O(n^{2})$ | Exact | Deterministic |
Time Complexity Graph
Space Complexity Graph
Time-Space Tradeoff
