What is the fastest method in $\displaystyle O(n)$ notation for solving a matrix $\displaystyle A$. If I know that matrix $\displaystyle 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?

Thank you for your help.