SDD Systems Solvers

From Algorithm Wiki
Jump to navigation Jump to search

Problem Description

In mathematics, a square matrix is said to be diagonally dominant if, for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non-diagonal) entries in that row.

Bounds Chart

SDD Systems SolversBoundsChart.png

Step Chart

File:SDD Systems SolversStepChart.png

Improvement Table

Complexity Classes Algorithm Paper Links Lower Bounds Paper Links
Exp/Factorial
Polynomial > 3
Cubic
Quadratic
nlogn
Linear
logn