Gaussian Elimination (Exact Laplacian Solver SDD Systems Solvers)
Revision as of 12:16, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$ words (Derived: Storing the inverse of the Laplacian) == Description == Use Gaussian elimination to compute the inverse of the Laplacian to solve for x == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == -150 == Reference == -")
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{2})$ words
(Derived: Storing the inverse of the Laplacian)
Description
Use Gaussian elimination to compute the inverse of the Laplacian to solve for x
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
-150
Reference
-