I am writing various Gauss-Seidel algorithm parallel implementations using different programming techniques for my assignment.
I have created a MATLAB script for generating strictly diagonally dominant matrices with different degree of diagonal dominance and sparseness for testing my implementations.
Problem is that I can't find a way to generate matrix that requires more than 15 iterations to converge (epsilon is set to 0.0001).
Is there a property that makes a system GS-hard?