New answers tagged

2 votes

Implementing matrix term version of Gauss-seidel

In the Gauss iterative method (Gauss-seidel) we decompose the linear system $Ax=b$ into $x^{k+1} = (L+U)^{-1}(b-Ux^{k})$ as exposed in the reference indicated (Scientific Computing An Introductory ...
Carllos Limma's user avatar
4 votes
Accepted

Implementing matrix term version of Gauss-seidel

The $L$ and $U$ of Gauss-Seidel are different from the $L$ and $U$ that come from the LU factorization. For Gauss-Seidel, $L$ and $U$ are what you get if you zero out the upper or lower part, ...
Neil Lindquist's user avatar

Top 50 recent answers are included