Gauss-Seidel method
= Gauss-Seidel method
{c}
{wiki=Gauss–Seidel_method}
= Gauss-Seidel iteration
{c}
{synonym}
With $A=D+L+U$, the <Gauss-Seidel method> solves $(D+L)x^{(k+1)}=b-Ux^{(k)}$. It uses each newly computed coordinate immediately in the remaining triangular solve. It is <successive over-relaxation> with parameter one, and converges from every start when $A$ is symmetric positive definite.