# Fastest method for solving diagonally dominant matrix

• Nov 9th 2013, 12:30 PM
Nforce
Fastest method for solving diagonally dominant matrix
What is the fastest method in $O(n)$ notation for solving a matrix $A$. If I know that matrix $A$ is diagonally dominant and tridiagonal matrix. Is it LU decompositon or Gauss-Seidel method, or some combination of both? Or is it something else?

• Nov 10th 2013, 03:36 AM