next up previous contents
Next: 5.4.1 Sequential algorithm Up: 5. Iterative methods Previous: 5.3.3 Parallel algorithm   Contents


5.4 Gauß-Seidel iteration

Denoting with $ L$ and $ U$ the strict lower and upper triangular submatrices and with $ D$ the main diagonal of the sparse matrix $ K$ from (5.1) we can write $ K = L + D + U$.

Subsections

Gundolf Haase 2000-03-20