Exact Laplacian Solver

This problem refers to solving equations of the form Lx=bLx = b where LL is a Laplacian of a graph. In other words, this is solving equations of the form Ax=bAx = b for a SDD matrix AA. This variation of the problem requires an exact solution with no error.

Parameters

  • nn: dimension of matrix

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 2 of 2 algorithms

See more
Naive Implementation1940O(n!)O(n!)O(n2)O(n^2)
Gaussian Elimination-150O(n3)O(n^3)O(n2)O(n^2)

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table